Reversible low-density parity-check codes
Authors: 
David Haley, Alex GrantAuthors Info & Claims
David Haley, Alex GrantAuthors Info & ClaimsPages 2016 - 2036
Abstract
Low-density parity-check (LDPC) codes may be decoded using a circuit implementation of the sum-product algorithm which maps the factor graph of the code. By reusing the decoder for encoding, both tasks can be performed using the same circuit, thus reducing area and verification requirements. Motivated by this, iterative encoding techniques based upon the graphical representation of the code are proposed. Code design constraints which ensure encoder convergence are presented, and then used to design iteratively encodable codes, while also preventing 4-cycle creation. We show how the Jacobi method for iterative matrix inversion can be applied to finite field matrices, viewed as message passing, and employed as the core of an iterative encoder. We present an algebraic construction of 4-cycle free iteratively encodable codes using circulant matrices. Analysis of these codes identifies a weakness in their structure, due to a repetitive patteru in the factor graph. The graph supports pseudo-codewords of low pseudo-weight. In order to remove the repetitive pattern in the graph, we propose a recursive technique for generating iteratively encodable codes. The new codes offer flexibility in the choice of code length and rate, and performance that compares well to randomly generated, quasi-cyclic and extended Euclidean-geometry codes.
References
[1]
D. J. C. MacKay and M. C. Davey, "Evaluation of Gallager codes for short block. length and high rate applications," in Codes. Systems and Graphical Models, ser. IMA Volumes in Mathematics and its Applications, B. Marcus and J. Rosenthal, Eds. New York: Springer-Verlag, 2000, vol. 123, pp. 113-130.
[2]
S. B. Wicker, Error Control Systems for Digital Communication and Storage. Englewood Cliffs, NJ: Prentice Hall, 1995.
[3]
R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
[4]
F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
[5]
D. Haley, C. Winstead, A. Grant, V. Gaudet. and C. Schlegel, "An analog/digital mode switching LDPC codec," in Proc. IEEE Int. Symp. Circuits and Systems, Kobe, Japan, 2005, pp. 5790-5793.
[6]
A. Blanksby and C. Howland, "A 690-mW 1-Gb/s 1024-b, rate-1/2 low-density parity-check code decoder," IEEE J. Solid-State Circuits, vol. 37, no 3, pp. 404-412, Mar. 2002.
[7]
C. Winstead, J. Dai, W. J. Kim, S. Little, Y. B. Kim, C. Myers, and C. Schlegel. "Analog MAP decoder for (8,4) hamming code in subthreshold CMOS," in Proc. ARVLSI (Advanced Research in VLSI), Salt Lake City, UT, 2001, pp. 132-147.
[8]
D. J. C. MacKay, S. T. Wilson, and M. C. Davey, "Comparison of constructions of irregular Gallager codes," IEEE Trans. Commun., vol. 47, no. 10, pp. 1449-1454, Oct. 1999.
[9]
L. Ping, W. K. Leung, and N. Phamdo, "Low density parity check codes with semi-random parity check matrix," Electron. Lett., vol. 35, no. 1, pp. 38-39, Jan. 1999.
[10]
T. J. Richardson and R. L. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 638--656, Feb. 2001.
[11]
S. Freundlich, D. Burshtein, and S. Litsyn, "Approximately lower triangular ensembles of LDPC codes with linear encoding complexity," IEEE Trans. Inf. Theory, vol. 53, no. 4, pp. 1484-1494, Apr. 2007.
[12]
J. M. Perez and K. Andrews, "Low-density parity-check code design techniques to simplify encoding," IPN Progr. Rep., vol. 42-171, Nov. 2007.
[13]
M. Sipser and D. A. Spielman, "Expander codes," IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1710-1722, Nov. 1996.
[14]
M. G. Luby, M. A. Shokrolloahi, M. Mizenmacher, and D. A. Spielman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001.
[15]
R. Lucas, M. P. C. Fossorier, Y. Kou, and S. Lin, "Iterative decoding of one-step majoririty logic deductible codes based on belief propagation," IEEE Trans. Commun., vol. 48, no. 6, pp. 931-937, Jun. 2000.
[16]
Y. Kou, S. Lin, and M. P. C. Fossorier, "Low density parity check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001.
[17]
R. L. Townsend and E. J. Weldon, Jr, "Self orthogonal quasi-cyclic codes," IEEE Trans. Inf. Theory, vol. IT-13, no. 2, pp. 183-195, Apr. 1967.
[18]
M. Karlin, "New binary coding results by circulants," IEEE Trans. Inf. Theory, vol. IT-15, no. 1, pp. 81-92, Jan. 1969.
[19]
M. P. C. Fossorier, "Quasi-cyclic low-density parity-check codes from circulant permutation matrices," IEEE Trans. Inf. Theory, vol. 50, no. 8, pp. 1788-793, Aug. 2004.
[20]
D. Haley, A. Grant, and J. Buetefuer, "Iterative encoding oflow-density parity-check codes," in Proc. GLOBECOM 2002, Taipei, Taiwan, 2002, vol. 2, pp. 1289-1293.
[21]
G. Strang, Linear Algebra and its Applications, 3rd ed. Ft. Worth, TX: Saunders College Publishing, 1988.
[22]
J. Bond, S. Hui, and H. Schmidt, "Constructing low-density parity-check codes," in Proc. EUROCOMM 2000, Munich, Germany, 2000, pp. 260-262.
[23]
R. M. Roth, Introduction to Coding Theory. Cambridge, U.K.: Cambridge Univ. Press, 2006.
[24]
T. Shibuya and K. Sakaniwa, "Construction of cyclic codes suitable for iterative decoding via generating idempotents," IEICE Trans. Fundamentals, vol. E86-A, no. 4, pp. 928-939, 2003.
[25]
D. J. C. MacKay, Encyclopedia of Sparse Graph Codes, {Online}. Available: http://wol.ra.phy.cam.ac.uk/mackay/codes/.
[26]
D. J. C. MacKay, "Good error correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
[27]
A. Vardy, "The intractability of computing the minimum distance of a code," IEEE Trans. Inf. Theory, vol. 43, no. 6, pp. 1757-1766, Nov. 1997.
[28]
R. M. Tanner, "Minimum-distance bounds by graph analysis," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 808-821, Feb. 2001.
[29]
P. Vontobel, "Algebraic Coding for Iterative Decoding," Ph.D. dissertation, ETH Zürich, Zürich, Switzerland, 2003.
[30]
R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
[31]
C. Di, D. Proietti, I. E. Telatar, T. J. Richardson, and R. L. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1570-1579, Jun. 2002.
[32]
T. Tian, C. Jones, J. D. Villasenor, and R. D. Wesel, "Construction of irregular LDPC codes with low error floors," in Proc. IEEE Int. Conf. Communications (ICC 2003), Anchorage, AK, 2003, vol. 5, pp. 3125-3129.
[33]
R. M. Tanner, "Spectral graphs for quasi-cyclic LDPC codes," in Proc. IEEE Int. Symp. Information Theory, Washington, DC, Jun./Jul. 2001, p. 226.
[34]
D. J. C. MacKay and M. S. Postol, "Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes," in Proc. 2nd Irish Conf. Mathematical Foundations of Computer Science and Information Technology, MFCSIT 2002 (ser. Electronic Notes in Theoretical Computer Science), Galway, Ireland, 2003, vol. 74, pp. 97-104.
[35]
R. Kötter and P. O. Vontobel, "Graph-covers and iterative decoding of finite length codes," in Proc. Int. Symp. Turbo Codes and Related Topics, Brest, France, 2003, pp. 75-82.
[36]
P. Vontobel and R. Kötter, "Lower bounds on the minimum pseudoweight of linear codes," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 70.
[37]
P. Vontobel, Personal Communication.
[38]
N. Alon, "Eigenvalues and expanders," Combinatorica, vol. 6, no. 2, pp. 83-96, 1986.
[39]
J. Friedman, "On the second eigenvalue and random walks in random d-regular graphs," Combinatorica, vol. 11, no. 4, pp. 331-362, 1991.
[40]
G. A. Margulis, "Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators," Probl. Inf. Transm., vol. 24, no. 1, pp. 39-46, 1988.
[41]
A. Lubotzky, R. Phillips, and P. Sarnak, "Ramanujan graphs," Combinatorica, vol. 8, no. 3, pp. 261-277, 1988.
[42]
J. Lafferty and D. Rockmore, "Codes and iterative decoding on algebraic expander graphs," in Proc. Int. Symp. Information Theory and Its Applications, Honolulu, HI, 2000, p. 276.
[43]
J. Rosenthal and P. O. Vontobel, "Constructions of LDPC codes using RamanuJan graphs and ideas from Margulis," in Proc. Allerton Conf. Communication, Control and Computing, Monticello, IL, 2000, pp. 248-257.
[44]
E. W. Weisstein, Circulant Determinant, {Online}. Available: http:// mathworld.wolfram.com/circulantdeterminant.html.
[45]
F. Lustenberger, "On the Design of Analog Iterative VLSI Decoders" Ph.D. dissertation, ETH Zürich, Zürich, Switzerland, 2000.
- Reversible low-density parity-check codes
Recommendations
Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications
The moderate complexity of low-density parity-check (LDPC) codes under iterative decoding is attributed to the sparseness of their parity-check matrices. It is therefore of interest to consider how sparse parity-check matrices of binary linear block ...
Results on Punctured Low-Density Parity-Check Codes and Improved Iterative Decoding Techniques
This paper first introduces an improved decoding algorithm for low-density parity-check (LDPC) codes over binary-input-output-symmetric memoryless channels. Then some fundamental properties of punctured LDPC codes are presented. It is proved that for ...
Low-density parity-check codes for nonergodic block-fading channels
We design powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather straightforward. Since optimal ...
Comments
Information & Contributors
Information
Published In
Copyright © 2009.
Publisher
IEEE Press
Publication History
Published: 01 May 2009
Revised: 02 December 2008
Received: 26 August 2006
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Jan 2025