Simplified Compression of Redundancy Free Trellis Sections in Turbo Decoder

It has been recently shown that a sequence of R = q(M - 1) redundancy free trellis stages of a recursive convolutional decoder can be compressed in a sequence of L = M - 1 trellis stages, where M is the number of states of the trellis and q is a positive integer. In this paper, we show that for an M state Turbo decoder, among the L compressed trellis stages, only m = 3 or even m = 2 are necessary. The so-called m-min algorithm can either be used to increase the throughput for decoding a high rate turbo-code and/or to reduce its power consumption.

[1]  Andrew J. Viterbi,et al.  An Intuitive Justification and a Simplified Implementation of the MAP Decoder for Convolutional Codes , 1998, IEEE J. Sel. Areas Commun..

[2]  Christian Bettstetter,et al.  Turbo decoding with tail-biting trellises , 1998, 1998 URSI International Symposium on Signals, Systems, and Electronics. Conference Proceedings (Cat. No.98EX167).

[3]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[4]  Heinrich Meyr,et al.  On Complexity, Energy- and Implementation-Efficiency of Channel Decoders , 2010, IEEE Transactions on Communications.

[5]  Emmanuel Boutillon,et al.  Compression of redundancy free trellis stages in turbo-decoder , 2013 .

[6]  Catherine Douillard,et al.  Iterative Decoding of Concatenated Convolutional Codes: Implementation Issues , 2007, Proceedings of the IEEE.