Low-density parity-check lattices: Construction and decoding analysis

IEEE Transactions on Information Theory

Volumn 52, Issue 10, 2006, Pages 4481-4495

  Sadeghi, Mohammad Reza ^b   Banihashemi, Amir H ^a,c   Panario, Daniel ^a,c  

^a IEEE   (Canada)

^b AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^c CARLETON UNIVERSITY   (Canada)

Author keywords

Additive white Gaussian noise (AWGN) channel; Iterative decoding; Lattice codes; Lattices; Low density parity check (LDPC) codes; Low density parity check (LDPC) lattices; Min sum algorithm; Progressive edge growth (PEG) construction; Tanner graphs

Indexed keywords

ADDITIVE WHITE GAUSSIAN NOISE (AWGN) CHANNEL; LATTICE CODES; LOW-DENSITY PARITY-CHECK (LDPC) CODES; MIN-SUM ALGORITHM; PROGRESSIVE-EDGE GROWTH (PEG) CONSTRUCTION; TANNER GRAPHS;

ALGORITHMS; BLOCK CODES; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; ITERATIVE DECODING;

CRYSTAL LATTICES;

EID: 33947409864     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.881720     Document Type: Article

References (31)

1. A. H. Banihashemi and I. F. Blake, "Trellis complexity and minimal trellis diagrams of lattices," IEEE Trans. Inf. Theory, vol. 44, pp. 1829-1847, Sep. 1998.
2. A. H. Banihashemi and F. R. Kschinschang, "Tanner graphs for group codes and lattices: Construction and complexity," IEEE Trans. Inf. Theory, vol. 47, pp. 824-882, Feb. 2001.
3. E. S. Barnes and N. J. A. Sloane, "New lattice packings of spheres," Canad. J. Math., vol. 35, pp. 117-130, 1983.
4. n," SIAM J. Discrete Math., vol. 9, pp. 597-601, 1996.
5. A. Bos, J. H. Conway, and N. J. A. Sloane, "Further lattice packings in high dimensions," Mathematika, vol. 29, pp. 171-180, 1982.
6. R. de Buda, "Some optimal codes have structure," IEEE J. Sel. Areas Comm., vol. 7, pp. 893-899, Aug. 1989.
7. S. Y. Chung, G. D. Forney, T. J. Richardson, and R. Urbanke, "On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit," IEEE Commun. Lett., vol. 5, no. 2, pp. 58-60, Feb. 2001.
8. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, 3nd ed. New York: Springer-Verlag, 1998.
9. U. Erez and R. Zamir, "Achieving 1/2 log(1 + SNR) on the AWGN channel with lattice encoding and decoding," IEEE Trans. Inf. Theory, vol. 50, pp. 2293-2314, Oct. 2004.
10. G. D. Forney Jr., "Coset codes. Part I: Introduction and geometrical classification," IEEE Trans. Inf. Theory, vol. 34, pp. 1123-1151, Sep. 1988.
11. _, "Coset codes. Part II: Binary lattices and related codes," IEEE Trans. Inf. Theory, vol. 34, pp. 1152-1187, Sep. 1988.
12. _, "Density/length profile and trellis complexity of lattices," IEEE Trans. Inf. Theory; vol. 40, pp. 1753-1772, Nov. 1994.
13. _, "On iterative decoding and two-way algorithm," in Proc. Int. Symp. Turbo Codes Rel. Topics, Brest, France, 1997, pp. 12-25.
14. _, "On the role of MMSE estimation in approaching the information-theoritic limits of linear Gaussian channels: Shannon meets Wiener," in Proc. 41st Annu. Allerton Conf. Commun., Contr. Comput., IL, Oct. 2003, pp. 430-439.
15. G. D. Forney Jr., M. D. Trott, and S.-Y. Chung, "Sphere-bound- achieving coset codes and multilevel coset codes," IEEE Trans. Inf. Theory, vol. 46, pp. 820-850, May 2000.
16. R. G. Gallager, "Low-density parity-check codes," IRE Trans Inf. Theory, vol. IT-8, pp. 21-28, 1962.
17. _, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
18. X.-Y. Hu, E. Eleftheriou, and D. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inf. Theory, vol. 51, pp. 386-398, Jan. 2005.
19. J. Leech, "Some sphere packings in higher space," Canad. J. Math., vol. 16, pp. 657-682, 1964.
20. T. Linder, C. Schlegel, and K. Zeger, "Corrected proof of de Buda's theorem," IEEE Trans. Inf. Theory, vol. 39, pp. 1735-1737, Sep. 1993.
21. S. Litsyn and V. Shevelev, "On ensemble of low-density parity-check codes: Asymptotic distance distributions," IEEE Trans. Inf. Theory, vol. 48, pp. 888-908, Apr. 2002.
22. D. J. C. MacKay, "Good error correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, pp. 399-431, Mar. 1999.
23. Y. Mao and A. H. Banihashemi, "A heuristic search for good low-density parity-check codes at short block lengths," in Proc. IEEE ICC2001, Helsinki, Finland, Jun. 2001, pp. 11-14.
24. T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Tans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
25. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
26. M. R. Sadeghi, "Low Density Parity Check Lattices," Ph.D. dissertation, Carleton University, ON, Canada, 2003.
27. P. Samuel, Algebraic Theory of Numbers. Paris, France: Hermann, 1971.
28. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. 27, pp. 533-547, Sep. 1981.
29. V. Tarokh and A. Vardy, "Universal bound on the performance of lattice codes," IEEE Trans. Inf. Theory, vol. 45, pp. 670-681, 1999.
30. N. Wiberg, "Codes and Decoding on General Graphs," Ph.D. dissertation, Likoping University, Likoping, Sweden, 1996.
31. [Online]. Available: http://www.inference.phy.cam.ac.uk/mackay/codes/ data.html#14