Evaluation of block turbo code performance with the reduced search trellis decoding method

作     者：Shin, SK Lee, SI Lee, SP 

作者机构：Elect & Telecommun Res Inst Satellite Commun Syst Dept Yusong Gu Taejon 305350 South Korea 

出 版 物：《IEE PROCEEDINGS-COMMUNICATIONS》 (IEE Proc Commun)

年 卷 期：2001年第148卷第3期

页      面：125-131页

核心收录：

主　　题：coding gain computational complexity parallel concatenated codes turbo coding concatenated codes soft decoder output turbo codes decoder complexity reduction BER performance Shannon limit search problems AWGN channel block codes efficient reduced search algorithms block turbo code iterative decoding error statistics Other topics in statistics finite code length Viterbi decoding AWGN channels soft output Viterbi algorithm BCH codes Codes reduced search trellis decoding performance evaluation 

摘      要：Iterative decoding of parallel concatenated codes, also known as turbo codes, can provide tremendous coding gain approximating to the Shannon limit. Application of turbo coding techniques to block codes gives many advantages, due to the finite code length of the constituent codes and their ease of modification. The authors investigate the application of the trellis decoding method to block turbo codes, since one of the most easy and efficient ways of providing soft output at the decoder is incorporation of the trellis decoding method. The soft output Viterbi algorithm is mainly considered, with performance improvement techniques. The authors propose efficient reduced search algorithms in which the decoder complexity can be reduced about ten times with less than 0.1dB degradation in coding gain.