That's the "quickie" overview. 'k-1', BTW, is the memory order
required to realize the actual encoder; the "constraint length" is
effectively how long a single ("impulse") input bit can possibly
effect output bits. Codes are (sometimes) referred to as (n,m,k),
where 'n' is the number of i
That is straightforward.
In High SNR, the lazy algorithm is O(1)!!!
In low SNR, both the lazy algorithm and the traditional algorithm are
both O(2^k) where k+1 is the constraint length.
It is not a simple relationship as the SNR falls off but in many of the
cases we would consider, the l
Michael Dickens wrote:
I'm working on programming the "Lazy" Viterbi (convolutional, maximum
likelihood) decoder right now. See
< http://citeseer.ist.psu.edu/599573.html >
< http://vanu.com/resources/publications/
2002fast_maximum_likelihood_decoder.pdf >
Mike,
Can't help you with the alg
I'm working on programming the "Lazy" Viterbi (convolutional, maximum
likelihood) decoder right now. See
< http://citeseer.ist.psu.edu/599573.html >
< http://vanu.com/resources/publications/
2002fast_maximum_likelihood_decoder.pdf >
I have a few issues which I'm trying to resolve, and maybe
