Viterbi Decoder (Complexity when decoding low rate convolutional codes)

Hi,

Does the complexity of the viterbi decoder of a 1/N-convolutional code
increase with N? The constraint length L is kept constant.

Thanks!

>Hi,
>
>Does the complexity of the viterbi decoder of a 1/N-convolutional code
>increase with N? The constraint length L is kept constant.
>
>Thanks!
>

I _think_ the time complexity of a Viterbi decoder is O(K*(2^^(L-1))) where
K is the number of observed symbols (N-tuples) and L is the constraint
length.  So N doesn't really affect the time complexity other than changing
it by a constant.

-Doug

>>Hi,
>>
>>Does the complexity of the viterbi decoder of a 1/N-convolutional code
>>increase with N? The constraint length L is kept constant.
>>
>>Thanks!
>>
>
>I _think_ the time complexity of a Viterbi decoder is O(K*(2^^(L-1)))
where
>K is the number of observed symbols (N-tuples) and L is the constraint
>length.  So N doesn't really affect the time complexity other than
changing
>it by a constant.
>
>-Doug
>

This is my understanding too.