Accumulate repeat accumulate codes

An innovative channel coding scheme called "accumulate repeat accumulate codes" (ARA) is proposed. ARA codes can be viewed as a subclass of low density parity check (LDPC) codes with fast encoder, and they have a projected graph or protograph representation. Using density evolution on their associated protographs, we find examples of rate 1/2 ARA codes with maximum variable node degree 5 for which a minimum bit SNR as low as 0.08 dB from channel capacity can be achieved as the block size goes to infinity. A family of high rate ARA codes with thresholds that stay uniformly close to their respective channel capacity thresholds are constructed. The ensemble weight distribution and ML threshold for rate 1/2 ARA codes were computed. For ARA with repeat 4, the ML threshold approaches within 0.005 dB of the ML threshold of random codes based on the existing tightest closed form bound.

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

[2]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[3]  Sergio Benedetto,et al.  Unveiling turbo codes: some results on parallel concatenated codes , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

[4]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[5]  Alain Glavieux,et al.  Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes" , 1998 .

[6]  Daniel A. Spielman,et al.  Analysis of low density codes and improved designs using irregular graphs , 1998, STOC '98.

[7]  Dariush Divsalar,et al.  Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding , 1997, IEEE Trans. Inf. Theory.

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

[9]  H. Jin,et al.  Irregular repeat accumulate codes , 2000 .

[10]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[11]  Shu Lin,et al.  Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.

[12]  Sae-Young Chung,et al.  On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit , 2001, IEEE Communications Letters.

[13]  Dariush Divsalar,et al.  Iterative turbo decoder analysis based on density evolution , 2001, IEEE J. Sel. Areas Commun..

[14]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[15]  Robert J. McEliece,et al.  Coding theorems for turbo code ensembles , 2002, IEEE Trans. Inf. Theory.

[16]  Frank R. Kschischang.  Codes defined on graphs , 2003, IEEE Commun. Mag..

[17]  Dariush Divsalar,et al.  Upper bounds to error probabilities of coded systems beyond the cutoff rate , 2003, IEEE Trans. Commun..

[18]  J. Thorpe.  Low-Density Parity-Check (LDPC) Codes Constructed from Protographs , 2003 .

[19]  Rüdiger L. Urbanke,et al.  The renaissance of Gallager's low-density parity-check codes , 2003, IEEE Commun. Mag..

[20]  T. Richardson,et al.  Multi-Edge Type LDPC Codes , 2004 .

[21]  Kung Yao,et al.  A class of turbo-like codes with efficient and practical high-speed decoders , 2004, IEEE MILCOM 2004. Military Communications Conference, 2004..

[22]  Samuel Dolinar,et al.  Encoders for block-circulant LDPC codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[23]  Dariush Divsalar,et al.  Constructing LDPC codes from simple loop-free encoding modules , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.