Study of Turbo Codes and Decoding in Binary Erasure Channel Based on Stopping Set Analysis

SUMMARY In this paper, we define a stopping set of turbo codes with the iterative decoding in the binary erasure channel. Based on the stopping set analysis, we study the block and bit erasure probabilities of turbo codes and the performance degradation of the iterative decoding against the maximum-likelihood decoding. The error floor performance of turbo codes with the iterative decoding is dominated by the small stopping sets. The performance degradation of the iterative decoding is negligible in the error floor region, so the error floor performance is asymptotically dominated by the low weight codewords.

[1]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[2]  Daniel A. Spielman,et al.  Practical loss-resilient codes , 1997, STOC '97.

[3]  Hans-Andrea Loeliger,et al.  Codes and iterative decoding on general graphs , 1995, Eur. Trans. Telecommun..

[4]  L. Pérez,et al.  On the Free Distance of TURBO Codes and Related Product Codes , 1995 .

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

[6]  Emre Telatar,et al.  Finite-length analysis of low-density parity-check codes on the binary erasure channel , 2002, IEEE Trans. Inf. Theory.

[7]  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.

[8]  T. Richrdson,et al.  Finite-length analysis of various low-density parity-check ensembles for the binary erasure channel , 2002, Proceedings IEEE International Symposium on Information Theory,.

[9]  Sergio Benedetto,et al.  Unveiling turbo codes: some results on parallel concatenated coding schemes , 1996, IEEE Trans. Inf. Theory.