Abstract
In order to solve high encoding complexities of irregular low-density parity-check (LDPC) codes, a deterministic construction of irregular LDPC codes with low encoding complexities was proposed. And the encoding algorithms were designed, whose complexities are linear equations of code length. The construction and encoding algorithms were derived from the effectively encoding characteristics of repeat-accumulate (RA) codes and masking technique. Firstly, the new construction modified parity-check matrices of RA codes to eliminate error floors of RA codes. Secondly, the new constructed parity-check matrices were based on Vandermonde matrices, this deterministic algebraic structure was easy for hardware implementation. Theoretic analysis and experimental results show that, at a bit-error rate of 10×10−4, the new codes with lower encoding complexities outperform Mackay’s random LDPC codes by 0.4–0.6 dB over an additive white Gauss noise (AWGN) channel.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Gallager R G. Low-Density Parity-Check Codes[J]. IRE Trans Inf Theory, 1962, 8: 21–28.
Jin H. Analysis and Design of Turbo-Like Codes[D]. Pasadena: Department of Electrical Engineering, California Institute of Technology, 2001.
Liva G, Song S, Lan L, et al. Design of LDPC Codes: A Survey and New Results[J]. Journal of Communication Software and Systems, 2006, 2(3): 1–22.
Fossorier M P. Quasi-Cyclic Low-Density Parity-Check Codes from Circulant Permutation Matrices[J]. IEEE Trans Inf Theory, 2004, 50(8): 1788–1793.
Richardson T J, Urbanke R L. The Capacity of Low-density Parity-Check Codes under Message-Passing Decoding[J]. IEEE Trans Inf Theory, 2001, 47(2): 599–618.
Hocevar D E. LDPC Code Construction with Flexible Hardware Implementation[C]//Proceeding of IEEE ICC. New York: IEEE Press, 2003: 2708–2712.
Fujita H, Ohata M, Sakaniwa K. An Algebraic Method for Constructing Efficiently Encodable Irregular LDPC Codes [C]//Proceeding of IEEE ISIT. New York: IEEE Press, 2005: 855–859.
Xu J, Chen L, Djurdjevic I, et al. Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking[J]. IEEE Tran Inf Theory, 2007, 53(1): 121–134.
Lan L, Zeng L, Tai Y Y, et al. Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach[J]. IEEE Tran Inf Theory, 2007, 53(7): 2429–2458.
Tanner R M. A Recursive Approach to Low Complexity Codes[J]. IEEE Tran Inf Theory, 1981, 27(5): 533–547.
Fan J L. Array Codes as Low-Density Parity-Check Codes [C]//Proceeding of 2nd Int Symp Turbo Codes and Related Topics. New York: IEEE Press, 2000: 543–546.
Yang M, Ryan W E, Li Y. Design of Efficiently Encodable Moderate-Length High-Rate Irregular LDPC Code[J]. IEEE Trans Communications, 2004, 52(4): 564–571.
Chung S Y, Richardson T J, Urbanke R L. Analysis of Sum-product Decoding of Low-Density Parity-Check Codes Using a Gaussian Approximation[J]. IEEE Trans Inf Theory, 2001, 47(2): 657–670.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: Supported by the National Natural Science Foundation of China(60496315, 60572050)
Rights and permissions
About this article
Cite this article
Zhan, W., Zhu, G. & Peng, L. A deterministic construction of irregular LDPC codes. Wuhan Univ. J. Nat. Sci. 14, 39–42 (2009). https://doi.org/10.1007/s11859-009-0109-9
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11859-009-0109-9
Key words
- low-density parity-check (LDPC) codes
- quasi-cyclic codes
- repeat-accumulate (RA) codes
- masking operation
- Vandermonde matrices