A linear-programming approach to the design of LDPC codes for non-uniform channels

IEEE International Conference on Communications

Volumn 3, Issue , 2006, Pages 1142-1147

  Ardakani, Masoud ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; LINEAR PROGRAMMING; NETWORK ARCHITECTURE; PARAMETER ESTIMATION; SIGNAL TO NOISE RATIO;

CHANNEL PARAMETERS; LOW-DENSITY PARITY-CHECK CODES (LDPC); MULTI-INPUT MULTI-OUTPUT SYSTEMS;

CHANNEL CODING;

EID: 42549085305     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2006.254901     Document Type: Conference Paper

References (14)

1. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
2. A. Shokrollahi, "New sequence of linear time erasure codes approaching the channel capacity," in Proc. the International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, no. 1719, Lecture Notes in Computer Science, 1999, pp. 65-67.
3. S.-Y. Chung, G. D. Forney Jr., T. J. Richardson, and R. L. 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.
4. H. Pishro-Nik, N. Rahnavard, and F. Fekri, "Non-uniform error correction using low-density parity-check codes," IEEE Trans. Inform. Theory, submitted for publication.
5. P. Zarrinkhat and A. H. Banihashemi, "Hybrid hard-decision iterative decoding of irregular low-density parity-check codes," IEEE Trans. Commun., submitted for publication.
6. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001.
7. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. 27, no. 5, pp. 533-547, Sept. 1981.
8. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
9. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
10. T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
11. M. Ardakani, T. H. Chan, and F. R. Kschischang, "EXIT-Chart properties of the highest-rate LDPC code with desired convergence behavior," IEEE Commun. Lett., vol. 9, no. 1, pp. 52-54, Jan. 2005.
12. S. ten Brink, G. Kramer, and A. Ashikhmin, "Design of low-density parity-check codes for multi-antenna modulation and detection," IEEE Trans. Commun., submitted for publication.
13. M. Ardakani and F. R. Kschischang, "A more accurate one-dimensional analysis and design of LDPC codes," IEEE Trans. Commun., vol. 52, no. 12, pp. 2106-2114, Dec. 2004.
14. M. Ardakani, B. Smith, W. Yu, and F. R. Kschischang, "Complexity- optimized LDPC codes," in Proc. 43rd Annual Allerton Conference on Communication, Control and Computing, Allerton House, Sep 2005.