Complexity-optimized low-density parity-check codes

43rd Annual Allerton Conference on Communication, Control and Computing 2005

Volumn 1, Issue , 2005, Pages 45-54

  Ardakani, Masoud ^a   Smith, Benjamin ^b   Yu, Wei ^b   Kschischang, Frank R ^b  

^a UNIVERSITY OF ALBERTA   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84961924662     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Improved low-density parity-check codes using irregular graphs", IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001.
2. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacityapproaching irregular low-density parity-check codes", IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
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 Communications Letters, vol. 5, no. 2, pp. 58-60, Feb. 2001.
4. M. Ardakani, T. H. Chan, and F. R. Kschischang, "EXIT-Chart properties of the highest-rate LDPC code with desired convergence behavior", IEEE Communications Letters, vol. 9, no. 1, pp. 52-54, Jan. 2005.
5. 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.
6. A. Khandekar and R. J. McEliece, "On the complexity of reliable communication on the erasure channel", in Proc. IEEE International Symposium on Information Theory, 2001, p. 1.
7. I. Sason and R. Urbanke, "Complexity versus performance of capacity-achieving irregular repeat-accumulate codes on the binary erasure channel", IEEE Transactions on Information Theory, vol. 50, no. 6, pp. 1247-1256, June 2004.
8. W. Yu, M. Ardakani, B. Smith, and F. R. Kschischang, "Complexity-optimized LDPC codes for Gallager decoding algorithm B", in Proc. IEEE International Symposium on Information Theory, Adelaide, Australia, Sept. 2005.
9. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
10. M. Ardakani and F. R. Kschischang, "A more accurate one-dimensional analysis and design of LDPC codes", IEEE Transactions on Communications, vol. 52, no. 12, pp. 2106-2114, Dec. 2004.
11. T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding", IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
12. S. ten Brink, "Convergence behavior of iteratively decoded parallel concatenated codes", IEEE Transactions on Communications, vol. 49, pp. 1727-1737, Oct. 2001.
13. R. L. Urbanke, "LdpcOpt: a fast and accurate degree distribution optimizer for LDPC code ensembles", online: lthcwww.epfs.ch/research/ldpcopt.
14. A. Ashikhmin, G. Kramer, and S. ten Brink, "Extrinsic information transfer functions: a model and two properties", in Proc. Conference on Information Sciences and Systems, Princeton, USA, Mar. 2002, pp. 742-747.