Lowering the Error Floor of Turbo Codes With CRC Verification

Decoding performance of turbo codes can flatten at moderately high signal-to-noise ratio. This letter proposes a low complexity method for lowering this error floor. This method rests on the observation of the extrinsic information during the iterative decoding process. A set of q most unreliable bits are identified based on their associated extrinsic information. A total of 2q test patterns are then built by inverting the most unreliable bits. The decoded codeword is identified thanks to a cyclic redundancy check detector. This method keeps the turbo coding scheme unchanged as long as an error detection code is serially concatenated with the turbo code. Simulations were performed on a rate-1/3 Long-Term Evolution turbo code and show an improvement of at least one decade in terms of frame error rate in the error floor region. This low complexity method paves the way for further improvements in lowering the error floor of turbo codes.

[1]  J. Vogt,et al.  Improving the max-log-MAP turbo decoder , 2000 .

[2]  Catherine Douillard,et al.  Precoding Techniques for Turbo Codes , 2015 .

[3]  R. Kerr,et al.  Performance of a 4-State Turbo Code with Data Puncturing and a BCH Outer Code , 2006, 23rd Biennial Symposium on Communications, 2006.

[4]  Mehul Motani,et al.  On the distribution of residual errors of turbo codes and its application to concatenated codes , 2002, Proceedings IEEE 56th Vehicular Technology Conference.

[5]  David Gnaedig.  High-Speed decoding of convolutional Turbo Codes , 2005 .

[6]  Paul Guinand,et al.  High-performance low-memory interleaver banks for turbo-codes , 2001, IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No.01CH37211).

[7]  Youssouf Ould-Cheikh-Mouhamedou,et al.  Improving the Error Rate Performance of Turbo Codes using the Forced Symbol Method , 2007, IEEE Communications Letters.

[8]  Roberto Garello,et al.  Computing the free distance of turbo codes and serially concatenated codes with interleavers: algorithms and applications , 2001, IEEE J. Sel. Areas Commun..

[9]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[10]  Claude Berrou,et al.  Designing good permutations for turbo codes: towards a single model , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[11]  Jung-Fu Cheng,et al.  Error Detection Reliability of LTE CRC Coding , 2008, 2008 IEEE 68th Vehicular Technology Conference.

[12]  G. David Forney,et al.  Concatenated codes , 2009, Scholarpedia.

[13]  Youssouf Ould-Cheikh-Mouhamedou,et al.  A Method for Lowering Turbo Code Error Flare using Correction Impulses and Repeated Decoding , 2006 .

[14]  Daniel J. Costello,et al.  A distance spectrum interpretation of turbo codes , 1996, IEEE Trans. Inf. Theory.

[15]  Catherine Douillard,et al.  On the Equivalence of Interleavers for Turbo Codes , 2015, IEEE Wireless Communications Letters.

[16]  Ming Xiao,et al.  Erasure Floor Analysis of Distributed LT Codes , 2015, IEEE Transactions on Communications.

[17]  J. D. Andersen.  Turbo codes extended with outer BCH code , 1996 .

[18]  Carl-Erik W. Sundberg,et al.  On list sequence turbo decoding , 2005, IEEE Transactions on Communications.

[19]  Daniel J. Costello,et al.  On the frame-error rate of concatenated turbo codes , 2001, IEEE Transactions on Communications.