Low-density lattice codes

IEEE Transactions on Information Theory

Volumn 54, Issue 4, 2008, Pages 1561-1585

  Sommer, Naftali ^a,b   Feder, Meir ^a   Shalvi, Ofir ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b Anobit Technologies   (Israel)

Author keywords

Iterative decoding; Lattice codes; Lattices; Low density parity check (LDPC) code

Indexed keywords

ADDITIVE NOISE; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; GAUSSIAN NOISE (ELECTRONIC); ITERATIVE DECODING; WHITE NOISE;

ADDITIVE WHITE GAUSSIAN NOISE (AWGN); LINEAR-TIME ITERATIVE DECODING; LOW-DENSITY LATTICE CODES (LDLC); LOW-DENSITY PARITY-CHECK (LDPC) CODE;

CODES (SYMBOLS);

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

References (30)

1. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379, 623-423, 656, Jul.-Oct. 1948.
2. P. Elias, "Coding for noisy channels," IRE Conv. Rec., vol. 3, pt. 4, pp. 37-46, Mar. 1955.
3. C. E. Shannon, "Probability of error for optimal codes in a Gaussian channel," Bell Syst. Tech. J., vol. 38, pp. 611-656, 1959.
4. R. E. Blahut, Theory and Practice of Error Control Codes. Reading, MA: Addison-Wesley, 1983.
5. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
6. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo codes," in Proc. IEEE Int. Conf. Commun., 1993, pp. 1064-1070.
7. R. de Buda, "The upper error bound of a new near-optimal code," IEEE Trans. Inf. Theory, vol. IT-21, pp. 441-445, Jul. 1975.
8. R. de Buda, "Some optimal codes have structure," IEEE J. Sel. Areas Commun., vol. 7, pp. 893-899, Aug. 1989.
9. T. Linder, C. Schlegel, and K. Zeger, "Corrected proof of de Buda's theorem," IEEE Trans. Inf. Theory, pp. 1735-1737, Sep. 1993.
10. H. A. Loeliger, "Averaging bounds for lattices and linear codes," IEEE Trans. Inf. Theory, vol. 43, pp. 1767-1773, Nov. 1997.
11. R. Urbanke and B. Rimoldi, "Lattice codes can achieve capacity on the AWGN channel," IEEE Trans. Inf. Theory, pp. 273-278, Jan. 1998.
12. 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.
13. A. R. Calderbank and N. J. A. Sloane, "New trellis codes based on lattices and cosets," IEEE Trans. Inf. Theory, vol. IT-33, pp. 177-195, Mar. 1987.
14. G. D. Forney Jr., "Coset codes-Part I: Introduction and geometrical classification," IEEE Trans. Inf. Theory, vol. 34, pp. 1123-1151, Sep. 1988.
15. M. R. Sadeghi, A. H. Banihashemi, and D. Panario, "Low-density parity-check lattices: Construction and decoding analysis," IEEE Trans. Inf. Theory, vol. 52, no. 10, pp. 4481-4495, Oct. 2006.
16. O. Shalvi, N. Sommer, and M. Feder, "Signal codes," in Proc. Inf. Theory Workshop, 2003, pp. 332-336.
17. O. Shalvi, N. Sommer, and M. Feder, Signal Codes, to be published.
18. A. Bennatan and D. Burshtein, "Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels," IEEE Trans. Inf. Theory, vol. 52, pp. 549-583, Feb. 2006.
19. J. Hou, P. H. Siegel, L. B. Milstein, and H. D. Pfister, "Capacity approaching bandwidth efficient coded modulation schemes based on low density parity check codes," IEEE Trans. Inf. Theory, vol. 49, pp. 2141-2155, Sep. 2003.
20. J. H. Conway and N. J. Sloane, Sphere Packings, Lattices and Groups New York: Springer, 1988.
21. G. Poltyrev, "On coding without restrictions for the AWGN channel," IEEE Trans. Inf. Theory, vol. 40, pp. 409-417, Mar. 1994.
22. N. Wiberg, "Codes and Decoding on General Graphs," Doctoral, Dep. Elec. Eng., Linköping Univ., Linköping, Sweden, 1996.
23. F. R. Kschischang, B. J. Frey, and H. A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, pp. 498-519, Feb. 2001.
24. J. Pearl, Probabilistic Reasoning in Intelligent Systems, Second Printing ed. San Mateo, CA: Morgan Kaufmann, 1988.
25. A. Papoulis, Probability, Random Variables and Stochastic Processes second ed. New York: McGraw-Hill, 1984.
26. Y. Saad, Iterative Methods for Sparse Linear Systems, 2nd ed. New York: Society for Industrial and Applied Mathematic (SIAM), 2003.
27. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Trans. Inf. Theory, vol. 48, pp. 2201-2214, Aug. 2002.
28. N. Sommer, M. Feder, and O. Shalvi, "Closest point search in lattices using sequential decoding," in Proc. Int. Symp. Inf. Theory (ISIT) 2005, pp. 1053-1057.
29. H. S. Cronie, "Superposition coding for power and bandwidth efficient communication over the Gaussian channel," in Proc. Int. Symp. Inf. Theory (ISIT), 2007.
30. H. El Gamal, G. Caire, and M. Damen, "Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels," IEEE Trans. Inf. Theory, vol. 50, pp. 968-985, Jun. 2004.