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...
| में प्रकाशित: | IEEE Transactions on wireless communications 3, 6 (2004). |
|---|---|
| मुख्य लेखक: | |
| स्वरूप: | लेख |
| भाषा: | English |
| विषय: |