A constraint-length based modified Viterbi algorithm with adaptive effort

作     者：Feldmann, C Harris, JH 

作者机构：San Diego State Univ Dept Elect & Comp Engn San Diego CA 92182 USA 

出 版 物：《IEEE TRANSACTIONS ON COMMUNICATIONS》 (IEEE Trans Commun)

年 卷 期：1999年第47卷第11期

页      面：1611-1614页

核心收录：

学科分类：0810[工学-信息与通信工程] 0808[工学-电气工程] 08[工学] 

基　　金：Lockheed Martin-CSU Foundation 

主　　题：Fishing power DECODING Self tuning Viterbi algorithm bit error rate performance coding gain convolutional coding 

摘      要：A modified Viterbi 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, coding gain within 0.06 dB of Viterbi at 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.