Adaptive Viterbi algorithm with ARQ for bounded complexity decoding.

Adaptive bounded computational and memory requirements for a Viterbi decoder can be achieved using an error trapping Viterbi decoder algorithm initially develop for hybrid automatic repeat request (ARQ) implementations. Partial path metrics and a sliding window are used to eliminate unreliable paths...

Full beskrivning

Bibliografiska uppgifter

I publikationen:	IEEE Transactions on wireless communications 3, 6 (2004).
Huvudupphovsman:	Harvey, B.A
Materialtyp:	Artikel
Språk:	engelska
Ämnen:	ARQ. Adaptive Viterbi algorithm. Bounded complexity decoding. Error trapping Viterbi decoder algorithm. Hybrid automatic repeat request. Partial path metric.