publication . Article . 2008

Design of regular (2,dc)-LDPC codes over GF(q) using their binary images

Poulliat, Charly; Fossorier, Marc; Declercq, David;
Open Access English
  • Published: 01 Oct 2008
  • Publisher: HAL CCSD
  • Country: France
International audience; In this paper, a method to design regular (2, dc)- LDPC codes over GF(q) with both good waterfall and error floor properties is presented, based on the algebraic properties of their binary image. First, the algebraic properties of rows of the parity check matrix H associated with a code are characterized and optimized to improve the waterfall. Then the algebraic properties of cycles and stopping sets associated with the underlying Tanner graph are studied and linked to the global binary minimum distance of the code. Finally, simulations are presented to illustrate the excellent performance of the designed codes.
arXiv: Computer Science::Information Theory
free text keywords: [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]
22 references, page 1 of 2

[3] S.-Y. Chung, T. J. Richardson, R.L. Urbanke, “Analysis of Sum-Product Decoding of Low-Density-Parity-Check Codes using a Gaussian Approximation”, IEEE Trans. on Inf. Theory, Vol. 47, pp. 657-670, February 2001.

[4] M.C. Davey, Error-Correction using Low-Density Parity-Check Codes, PhD thesis, University of Cambridge, 1999.

[5] M.C. Davey and D. MacKay, “Low-Density Parity-Check Codes over GF(q)”, IEEE Commun. letters, Vol.2, pp. 165-167, June 1998.

[6] D. Declercq and M. Fossorier, “Decoding Algorithms for Nonbinary LDPC Codes over GF(q)”, submitted to IEEE Trans. on Commmunications.

[7] C. Di, D. Proietti, I.E. Telatar, T.J. Richardson, R.L. Urbanke, ”Finite-length Analysis of Low-Density Parity-Check Codes on the Binary Erasure Channel”, IEEE Trans. on Inf. Theory, Vol. 48, No. 6, pp. 1570 - 1579, June 2002.

[8] D. Divsalar, C. Jones, S. Dolinar and J. Thorpe, “Protograph Based LDPC Codes with Minimum Distance Linearly Growing with Block Size”, in Proc. IEEE GLOBECOM conference, Vol. 3, pp. 1152-1156, St Louis, MO, USA, November 2005.

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

[10] X.Y. Hu and M. Fossorier, “On the Computation of the Minimum Distance of Low-Density Parity-Check Codes,” IEEE Int. Conf. on Commun., Paris, France, June 2004. [OpenAIRE]

[11] X.Y. Hu and E. Eleftheriou, “Binary Representation of Cycle Tanner-Graph GF(2q) codes, IEEE Int. Conf. on Commun., Paris, France, June 2004. [OpenAIRE]

[12] X.Y. Hu, M. Fossorier and E. Eleftheriou, “Approximate Algorithms for Computating the Minimum Distance of LowDensity Parity-Check Codes”, IEEE Int. Symp. on Inf. Theory, Chicago, USA, June 2004. [OpenAIRE]

[13] X.-Y. Hu, E. Eleftheriou and D.M. Arnold, “Regular and Irregular Progressive Edge-Growth Tanner Graphs”, IEEE Trans. on Inf. Theory, Vol. 51, No. 1, pp. 386-398, January 2005. [OpenAIRE]

[14] G. Liva, W.E. Ryan, M. Chiani, “Design of quasi-cyclic Tanner codes with low error floors”, in Proc. Int. Turbo Code Symposium, Munich, Germany, April 2006. [OpenAIRE]

[15] M.G. Luby, M. Mitzenmacher, M.A. Shokrollahi, D.A. Spielman, “Improved Low Density Parity Check Codes using Irregular Graphs”, IEEE Trans. On Inf. Theory, Vol. 47, No. 2, pp. 585-598, Feb. 2001.

[16] D. J. C. Mackay, “Good Error Correcting Codes based on Very Sparse Matrices”, IEEE Trans. On Info. Theory, Vol. 45, No. 2, pp 399-431, 1999.

[17] D. MacKay, “Optimizing Sparse Graph Codes over GF(q)”, available at, August 2003.

22 references, page 1 of 2
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue