Hybrid concatenated codes with asymptotically good distance growth

Turbo Codes and multiple parallel concatenated codes (MPCCs) yield performance very close to the Shannon limit. However, they are not asymptotically good, in the sense of having the minimum distance grow linearly with the length of the code. At the other extreme, multiple serially concatenated codes (MSCCs), for example very simple repeat-accumulate-accumulate codes, have proven to be asymptotically good, but they suffer from a convergence threshold far from capacity. In this paper, we investigate hybrid concatenated coding structures consisting of an outer MPCC with very simple memory-1 component encoders serially concatenated with an inner accumulator. We show that such structures exhibit linear distance growth with block length and that they have better thresholds than MSCCs. The results indicate a fundamental tradeoff between minimum distance growth and convergence threshold in turbo-like codes.

[1]  Dariush Divsalar,et al.  Serial and Hybrid Concatenated Codes with Applications , 1997 .

[2]  Claude Berrou,et al.  Improving the distance properties of turbo codes using a third component code: 3D turbo codes - [transactions letters] , 2009, IEEE Transactions on Communications.

[3]  Jing Li,et al.  Product accumulate codes: a class of codes with near-capacity performance and low decoding complexity , 2004, IEEE Transactions on Information Theory.

[4]  Paul H. Siegel,et al.  On the capacity of finite state channels and the analysis of convolutional accumulate-m codes , 2003 .

[5]  Stephan ten Brink,et al.  Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..

[6]  F. Pollara,et al.  Serial concatenation of interleaved codes: performance analysis, design and iterative decoding , 1996, Proceedings of IEEE International Symposium on Information Theory.

[7]  New Results on the Minimum Distance of Repeat Multiple Accumulate Codes , 2007 .

[8]  Alex J. Grant,et al.  Convergence analysis and optimal scheduling for multiple concatenated codes , 2005, IEEE Transactions on Information Theory.

[9]  M. Tuchler,et al.  Convergence prediction for iterative decoding of threefold concatenated systems , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[10]  Dariush Divsalar,et al.  Coding theorems for 'turbo-like' codes , 1998 .

[11]  Michael Tüchler.  Convergence prediction for iterative decoding of threefold concatenated systems , 2002, GLOBECOM.

[12]  Daniel J. Costello,et al.  New low-complexity turbo-like codes , 2001, Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494).

[13]  Mohammad Mahdian,et al.  The Minimum Distance of Turbo-Like Codes , 2009, IEEE Transactions on Information Theory.

[14]  R. Urbanke,et al.  On the minimum distance of parallel and serially concatenated codes , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

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

[16]  C. Douillard,et al.  Adding a Rate-1 Third Dimension to Turbo Codes , 2007, 2007 IEEE Information Theory Workshop.

[17]  Claude Berrou,et al.  Serial/parallel (S/P) turbo codes for low error rates , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[18]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.