Concatenated decoding with a reduced-search BCJR algorithm

作     者：Franz, V Anderson, JB 

作者机构：Siemens AG D-8000 Munich Germany Rensselaer Polytech Inst Dept Elect Comp & Syst Engn Troy NY 12180 USA 

出 版 物：《IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS》 (IEEE J Sel Areas Commun)

年 卷 期：1998年第16卷第2期

页      面：186-195页

核心收录：

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

主　　题：complexity reduction concatenated coding decoders error correction 

摘      要：We apply two reduced-computation variants of the BCJR algorithm to the decoding of serial and parallel cancatenated convolutional codes, One computes its recursions at only M states per trellis stage;one computes only at states with values above a threshold, The threshold scheme is much more efficient, and it greatly reduces the computation of the BCJR algorithm, By computing only when the channel demands it, the threshold scheme reduces the turbo decoder computation to one-four nodes per trellis stage after the second iteration.