Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels

IEEE Transactions on Information Theory

Volumn 52, Issue 2, 2006, Pages 549-583

  Bennatan, Amir ^a   Burshtein, David ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Bandwidth efficient coding; Coset codes; Iterative decoding; Low density parity check (LDPC) codes

Indexed keywords

APPROXIMATION THEORY; BANDWIDTH; COMPUTER SIMULATION; DECODING; INTERSYMBOL INTERFERENCE; ITERATIVE METHODS; POLYNOMIALS; PROBABILITY; VECTORS; WHITE NOISE;

ADDITIVE WHITE GAUSSIAN NOISE (AWGN) CHANNEL; BANDWIDTH-EFFICIENT CODING; COSET CODES; EXTRINSIC INFORMATION TRANSFER (EXIT) CHARTS; ITERATIVE DECODING; LOW-DENSITY PARITY-CHECK (LDPC) CODES; PROBABILITY VECTORS;

COMMUNICATION CHANNELS (INFORMATION THEORY);

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

References (39)

1. A. Bennatan and D. Burshtein, "On the application of a LDPC codes to arbitrary discrete-memoryless channels," IEEE Trans. Inf. Theory, vol. 50, no. 3, pp. 417-438, Mar. 2004.
2. A. Bennatan and D. Burshtein, "Iterative decoding of LDPC codes over arbitrary discrete-memoryless channels," in Proc. 41st Annu. Allerton Conf. Communication, Control and Computers, Monticello, IL, Oct. 2003, pp. 1416-1425.
3. A. Bennatan, D. Burshtein, G. Caire, and S. Shamai (Shitz), "Superposition coding for side-information channels," IEEE Trans. Inf. Theory, submitted for publication.
4. Matlab Source Code for EXIT Charts. [Online]. Available: http://www.eng. tau.ac.il/~burstyn/publications.htm
5. R. E. Blahut, Theory and Practice of Error Control Codes. Reading, MA: Addison-Wesley, 1984.
6. D. Burshtein and G. Miller, "Bounds on the performance of belief propagation decoding," IEEE Trans. Inf. Theory, vol. 48, no. 1, pp. 112-122, Jan. 2002.
7. G. Caire, G. Taricco, and E. Biglieri, "Bit-interleaved coded modulation," IEEE Trans. Inf. Theory, vol. 44, no. 3, pp. 927-946, May 1998.
8. S.-Y. Chung, J. G. D. Forney, T. 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.
9. S.-Y. Chung, T. J. Richardson, and R. L. Urbanke, "Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 657-670, Feb. 2001.
10. M. C. Davey and D. MacKay, "Low-density parity check codes over GF(q)," IEEE Commun. Lett., vol. 2, no. 6, pp. 165-167, Jun. 1998.
11. D. E. Dudgeon and R. M. Mersereau, Multidimensional Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1984.
12. P. Elias, "Coding for noisy channels," in IRE Conv. Rec., vol. 3, Mar. 1955, pp. 37-46.
13. G. D. Forney Jr. and G. Ungerboeck, "Modulation and coding for linear Gaussian channels," IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2384-2415, Oct. 1998.
14. C. Fragouli, R. D. Wesel, D. Sommer, and G. Fettweis, "Turbo codes with nonuniform QAM constellations," in Proc. IEEE Int. Conf. Communication, vol. 1, Helsinki, Finland, Jun. 2001, pp. 70-73.
15. B. J. Frey, R. Koetter, and A. Vardy, "Signal-space characterization of iterative decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 766-781, Feb. 2001.
16. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: M.I.T Press, 1963.
17. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
18. 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, no. 9, pp. 2141-2155, Sep. 2003.
19. A. Kavčić, X. Ma, and M. Mitzenmacher, "Binary intersymbol interference channels: Gallager codes, density evolution and code performance bounds," IEEE Trans. Inf. Theory, vol. 49, no. 7, pp. 1636-1652, Jul. 2003.
20. A. Khandekar, "Graph-Based Codes and Iterative Decoding," Ph.D. dissertation, Calif. Inst. Technol., Pasadena, CA. Available: [Online] at http://etd.caltech.edu.
21. 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.
22. G. Li, I. J. Fair, and W. A. Krzymień, "Analysis of nonbinary LDPC codes using Gaussian approximation," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun/Jul. 2003, p. 234.
23. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001.
24. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, 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.
25. R. J. McEliece, "Are turbo-codes effective on nonstandard channels?," IEEE Information Theory Society Newsletter, vol. 51, no. 4, pp. 1-8, Dec. 2001.
26. E. A. Ratzer and D. J. C. MacKay, "Sparse low-density parity-check codes for channels with cross-talk," in Proc. ITW2003, Paris, France, Mar/Apr. 2003.
27. T. Richardson and R. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 638-656, Feb. 2001.
28. T. Richardson and R. Urbanke, "The capacity of low-density parity check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
29. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
30. P. Robertson and T. Wörz, "Bandwidth-efficient turbo trellis-coded modulation using punctured component codes," IEEE J. Sel. Areas Commun., vol. 16, no. 2, pp. 206-218, Feb. 1998.
31. E. Sharon, A. Ashikhmin, and S. Litsyn, "EXIT functions for the Gaussian channel," in Proc. 40th Annu. Allerton Conf. Communication, Control, and Computers, Allerton, IL, Oct. 2003, pp. 972-981.
32. A. Shwartz and A. Weiss, Large Deviations for Performance Analysis. London, U.K.: Chapman & Hall, 1995.
33. F.-W. Sun and H. C. A. van Tilborg, "Approaching capacity by equiprobable signaling on the Gaussian channel," IEEE Trans. Inf. Theory, vol. 39, no. 5, pp. 1714-1716, Sep. 1993.
34. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
35. S. ten Brink, G. Kramer, and A. Ashikhmin, "Design of low-density parity-check codes for modulation and detection," IEEE Trans. Commun., vol. 52, no. 4, pp. 670-678, Apr. 2004.
36. S. ten Brink, "Convergence behavior of iteratively decoded parallel concatenated codes," IEEE Trans. Commun., vol. 49, no. 10, pp. 1727-1737, Oct. 2001.
37. N. Varnica, X. Ma, and A. Kavčić, "Iteratively decodable codes for bridging the shaping gap in communications channels," in Proc. Asilomar Conf. Signals, Systems and Computers, Pacific Grove, CA, Nov. 2002.
38. C. C. Wang, S. R. Kulkarni, and H. V. Poor, "Density evolution for asymmetric channels," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4216-4236, Dec. 2005.
39. H. Wymeersch, H. Steendam, and M. Moeneclaey, "Log-domain decoding of LDPC codes over Gf(q)," in Proc. IEEE Int. Conf. Communications, Paris, France, Jun. 2004, pp. 772-776.