publication . Conference object . Preprint . 2007

Non-binary Hybrid LDPC Codes: structure, decoding and optimization

Lucile Sassatelli; David Declercq;
Open Access
  • Published: 09 Jan 2007
  • Publisher: IEEE
Abstract
In this paper, we propose to study and optimize a very general class of LDPC codes whose variable nodes belong to finite sets with different orders. We named this class of codes Hybrid LDPC codes. Although efficient optimization techniques exist for binary LDPC codes and more recently for non-binary LDPC codes, they both exhibit drawbacks due to different reasons. Our goal is to capitalize on the advantages of both families by building codes with binary (or small finite set order) and non-binary parts in their factor graph representation. The class of Hybrid LDPC codes is obviously larger than existing types of codes, which gives more degrees of freedom to find ...
Persistent Identifiers
Subjects
arXiv: Computer Science::Information TheoryComputer Science::Hardware Architecture
ACM Computing Classification System: Data_CODINGANDINFORMATIONTHEORY
free text keywords: Computer Science - Information Theory, Tornado code, Turbo code, Mathematics, Low-density parity-check code, Linear code, Theoretical computer science, Block code, Expander code, Serial concatenated convolutional codes, Concatenated error correction code

[1] K. Kasai, T. Shibuya and K.Sakaniwa, ”Detailedly Represented Irregular LDPC Codes,” IEICE Trans. Fundamentals, vol. E86-A(10) pp. 2435- 2443, Oct. 2003.

[2] S.Y. Chung, T. Richardson and R. Urbanke, ”Analysis of Sum-Product Decoding LDPC Codes using a Gaussian Approximation,” IEEE Trans. on Inform. Theory, vol. 47, no. 2, pp. 657-670, Feb. 2001.

[3] A. Bennatan and David Burshtein, ”Design and Analysis of Nonbinary LDPC Codes for Arbitrary Discrete-Memoryless Channels,” IEEE Trans. on Inform. Theory, vol. 52, no. 2, pp. 549-583, Feb. 2006.

[4] G. Byers and F. Takawira, ”EXIT Charts for Non-binary LDPC Codes,” Proc. IEEE ICC 2005, vol. 1, pp. 652-657, May 2005.

[5] G. Li, I. Fair and W. Krzymien, ”Analysis of Nonbinary LDPC Codes Using Gaussian Approximation,” Proc. IEEE ISIT 2003, p. 234, July 2003.

[6] S. ten Brink, ”Convergence Behavior of Iteratively Decoded Parallel Concatenated Codes,” IEEE Trans. on Comm., vol. 49, no. 10, pp. 1727-1737, Oct. 2001.

[7] X.-Y. Hu and E. Eleftheriou, “Binary Representation of Cycle TannerGraph GF(2q ) Codes,” The Proc. IEEE Intern. Conf. on Comm., Paris, France, pp. 528-532, June 2004.

[8] C. Poulliat, M. Fossorier and D. Declercq, “Using Binary Image of Nonbinary LDPC Codes to Improve Overall Performance,” in IEEE Intern. Symp. on Turbo Codes, Munich, April 2006.

[9] A. Goupil, M. Colas, G. Gelle and D. Declercq, “FFT-based BP Decoding of General LDPC Codes over Abelian Groups,” to appear in IEEE Trans. on Comm., 2006.

[10] M. Davey and D.J.C. MacKay, “Low Density Parity Check Codes over GF(q),” IEEE Comm. Lett., vol. 2, pp. 165-167, June 1998.

[11] D. Sridhara and T.E. Fuja, “Low Density parity Check Codes over Groups and Rings,” in proc. of ITW'02, Bangladore, India, Oct. 2002.

[12] G. Liva, W.E. Ryan and M. Chiani, “Design of quasi-cyclic Tanner Codes with Low Error Floors,” in IEEE Intern. Symp. on Turbo Codes, Munich, April 2006. [OpenAIRE]

Any information missing or wrong?Report an Issue