Accumulate-Repeat-Delay-Partial-Delay Codes


Article Preview

Inspired by Accumulate-Repeat-Accumulate (ARA) codes, in this letter we propose a new channel coding scheme called Accumulate-Repeat-Delay-Partial-Delay (ARDPD) codes. Contrary to ARA codes, ARDPD codes simultaneously achieve good threshold and linear minimum distance. Based on EXIT for LDPC codes, we show that for maximum variable node degree 5, the threshold of ARDPD codes outperforms the best known unstructured irregular LDPC codes. Iterative decoding simulation results show that the proposed codes perform as predicted.



Edited by:

Robin G. Qiu and Yongfeng Ju






Z. L. Li and G. J. Xia, "Accumulate-Repeat-Delay-Partial-Delay Codes", Applied Mechanics and Materials, Vols. 135-136, pp. 167-170, 2012

Online since:

October 2011





[1] R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, (1963).

[2] D. J. C. MacKay and R. M. Neal, Near Shannon limit performance of low density parity check codes, IEE Electron. lett., vol. 32, no. 18, pp.1645-1646, Aug. (1996).

DOI: 10.1049/el:19961141

[3] A. Abbasfar, D. Divsalar, and K. Yao, Accumulate Repeat Accumulate Codes, IEEE Globecom 2004, Dallas, Texas, 29 November – 3 December, (2004).

DOI: 10.1109/glocom.2004.1378000

[4] Jeremy Thorpe, Low Density Parity Check (LDPC) Codes Constructed from Protographs, JPL INP Progress Report 42-154, August 15, (2003).

[5] T. Richardson, A. Shokrollahi, and R. Urbanke, Design of capacity-approaching irregular low- density parity-check codes, IEEE Trans. Inform. Theory, vol. 47, pp.619-637, (2001).

DOI: 10.1109/18.910578

[6] D. Divsalar, S. Dolinar, C. Jones, Construction of Protograph Codes with Liner Minimum Distance, IEEE ISIT, pp.664-668, July. (2006).

DOI: 10.1109/isit.2006.261868

[7] D. Divsalar, Ensemble weight enumerators for protograph LDPC codes, IEEE ISIT, pp.1554-1558, July. (2006).

DOI: 10.1109/isit.2006.262129

[8] G. Liva, S. Song, L. Lan, Y. Zhang, W. Ryan, and S. Lin, Design of LDPC codes: A survey and new results, J. Comm. Software and Systems, Sept. (2006).

DOI: 10.24138/jcomss.v2i3.283

[9] X. Y. Hu, E. Eleftheriou, D. M. Arnold, Progressive edge-growth tanner graphs, in Proc. IEEE Global Telecommum. Conf., Nov. 2001, pp.995-1001.

[10] Xiaofu Wu, xiaohu You, Chunming Zhao, An efficient Girth-Locating Algorithm for Quasi-Cyclic LDPC Codes, IEEE ISIT, pp.817-820, July. (2006).

DOI: 10.1109/isit.2006.261727

In order to see related information, you need to Login.