Reduced-search BCJR algorithms
V. Franz, J.B. Anderson · 1997
Summary form only given. There is great interest in coding systems that employ various kinds of code concatenation. In all of these schemes, an important element in the decoder is the MAP decoder, a device that puts out the probability of trellis states or data bits, rather than simply the most likely state or bit. For trellis encoding and Markov data, the MAP decoder is a special scheme, the BCJR algorithm. Unfortunately, the BCJR algorithm is computationally intensive. The purpose of this paper is to present a strong simplification of it that does not sacrifice the decoder error performance. Our algorithms exploit the fact that most working probabilities in the BCJR algorithm are very small, and with a little care can be ignored without losing performance. We find that the most successful strategy is to ignore working probabilities that fall below a certain threshold.