DocumentCode :
1267560
Title :
A constraint-length based modified Viterbi algorithm with adaptive effort
Author :
Feldmann, Christian ; Harris, Jay H.
Author_Institution :
Infineon Technol., Munich, Germany
Volume :
47
Issue :
11
fYear :
1999
fDate :
11/1/1999 12:00:00 AM
Firstpage :
1611
Lastpage :
1614
Abstract :
A modified Viterbi (1971) algorithm for convolutional codes is described that provides for signal-to-noise ratio (SNR) adaptive computational effort. The algorithm has three levels of prioritized effort. Movement from one level to the next is controlled by parameters that can be selected according to desired output bit error rate performance. For 3-bit soft decision detected signals, a coding gain within 0.06 dB of Viterbi at a 3-dB SNR is achieved for the same constraint-length code with modest parameter values and computational effort. At values of SNR above 6 dB, the algorithm decodes with very low computational effort. Effort levels are controlled by spanning the decoding trellis in steps that are one constraint-length long
Keywords :
Viterbi decoding; adaptive decoding; convolutional codes; error statistics; signal detection; SNR; coding gain; constraint-length based modified Viterbi algorithm; constraint-length code; convolutional codes; decoding trellis; modified Viterbi decoding algorithm; noise adaptive computational effort; output bit error rate performance; path segment matching; prioritized effort levels; signal-to-noise ratio; soft decision detected signals; Adaptive algorithm; Communications Society; Convolutional codes; Decoding; Frequency; Gain; Noise reduction; Signal detection; Signal to noise ratio; Viterbi algorithm;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/26.803492
Filename :
803492
Link To Document :
بازگشت