Performance versus complexity per iteration for low-density parity-check codes: An information-theoretic approach

Turbo Codes and Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium on

Volumn , Issue , 2006, Pages

  Sason, Igal ^a   Wiechman, Gil ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CODING; INFORMATION THEORY; ITERATIVE DECODING; ITERATIVE METHODS; MESSAGE PASSING; SATELLITE COMMUNICATION SYSTEMS; TURBO CODES;

DECODING COMPLEXITY; INFORMATION THEORETIC BOUNDS; INFORMATION-THEORETIC APPROACH; LOW-DENSITY PARITY-CHECK (LDPC) CODES; MESSAGE-PASSING ITERATIVE DECODING; ML DECODING; OPTIMALITY; PARALLEL CHANNEL;

CODES (SYMBOLS);

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

References (26)

1. M. Ardakani, B. Smith, W. Yu and F. Kschischang "Complexity-optimized low-density parity-check codes," presented in the 43rd Allerton Conference on Communication, Control and Computing, Monticello, Illinois, USA, 28-30 September 2005.
2. O. Burshtein, M. Krivelevich, S. Litsyn and G. Miller, "Upper bounds on the rate of LOPC codes," IEEE Trans.on Information Theory, vol. 48, no. 9, pp. 2437-2449, September 2002.
3. T. Etzion, A. Trachtenberg and A. Vardy, " Which codes have cycle-free Tanner graphs? "IEEE Trans.on Information Theory, vol. 45, no. 6, pp. 2173-2181, September 1999.
4. R. G. Gallager, Low-density parity-check codes, Cambridge, MA, USA, MIT Press, 1963.
5. J. Ha and S. W. McLaughlin, "Rate-compatible puncturing of low-density parity-check codes," IEEE Trans.on Iriformation Theory, vol. 50, no. 11, pp. 2824-2836, November 2004.
6. C. H. Hsu and A. Anastasopoulos, "Capacity-achieving LOPC codes through puncturing," Proceedings 2005 IEEE International Conference on Wireless Networks, Communications and Mobile Computing (WirelessCom 2005), Mauii, Hawaii, USA, June 13-16, 2005.
7. C. H. Hsu and A. Anastasopoulos, "Capacity-achieving codes with bounded graphical complexity on noisy channels," presented in the 43rd Allerton Conference on Communication, Control and Computing, Monticello, Illinois, USA, 28-30 September 2005. [Online). Available: http://www.arxiv.org/abs/cs.IT/0509062.
8. A. Khandekar and R. J. McEliece, "On the complexity of reliable communications on the erasure channel," Proceedings 2001 International Symposium on Iriformation Theory, p. 1, Washington,-C, USA, June 24-29, 2001.
9. C. Measson, A. Montanari, T. Richardson and R. Urbanke, "Life above threshold: From list decoding to area theorem and MSE,", 2004 IEEE Iriformation Theory Workshop, San Antonio, TX, USA, October 24-29, 2004. [Online). Available: http://www.arxiv.org/abs/cs.IT/0410028.
10. C. Measson, A. Montanari and R. Urbanke, "Maxwell construction: the hidden bridge between iterative and maximum a posteriori decoding," submitted to IEEE Trans.on Information Theory, June 2005. [Online). Available: http://www.arxiv.org/abs/cs.IT/0506083.
11. A. Montanari, "Tight bounds for LOPC codes and LOGM codes under MAP decoding," IEEE Trans.on Information Theory, vol. 51, no. 9, pp. 3221-3246, September 2005.
12. C. Measson, A. Montanari and R. Urbanke, "Why we can not surpass capacity: the matching condition," presented in the 43rd Allerton Conference on Communication, Control and Computing, Monticello, Illinois, USA, 28-30 September 2005.
13. H. Pfister, J. Sason and R. Urbanke, "Bounds on the decoding complexity of punctured codes on graphs," Proceedings of the Forty-Second Annual Allerton Conference on Communication, Control and Computing (invited paper), pp. 481-491, Urbana-Champaign, 1L, USA, September 29-0ctober 1, 2004. [Online). Available: http://www.arxiv.org/abs/cs.IT/0409027.
14. H. O. Pfister, I. Sason, and R. Urbanke, "Capacity-achieving ensembles for the binary erasure channel with bounded complexity," IEEE Trans.on Information Theory, vol. 51, no. 7, pp. 2352-2379, July 2005.
15. H. O. Pfister and I. Sason, "Accumulate-repeataccumulate codes: systematic codes achieving the binary erasure channel capacity with bounded complexity," presented In the 43rd Allerton Conference on Communication, Control and Computing, Monticello, Illinois, USA, 28-30 September 2005. [Online). Available: http://www.arxiv.org/abs/cs.IT/0509044.
16. H. Pishro-Nik, N. Rahnavard and F. Fekri, "Nonuniform error correction using low-density parity-check codes," IEEE Trans.on Information Theory, vol. 51, pp. 2702-2714, July 2005.
17. H. Pishro-Nik and F. Fekri, "Results on punctured LOPC codes," Proceedings 2004 IEEE Iriformation Theory Workshop (ITW 2004), pp. 215-219, San Antonio, Texas, USA, October 24-29, 2004.
18. T. Richardson and R. Urbanke, "Efficient encoding of lowdensity parity-check codes," IEEE Trans.on Iriformation Theory, vol. 47, no. 2, pp. 599-618, February 2001.
19. T. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans.on Information Theory, vol. 47, no. 2, pp. 599-618, February 2001.
20. T. Richardson, A. Shokrollahi and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans.on Iriformation Theory, vol. 47, no. 2, pp. 619-637, February 2001.
21. I. Sason and R. Urbanke, "Parity-check density versus performance of binary linear block codes over memoryless symmetric channels," IEEE Trans.on Information Theory, vol. 49, no. 7, pp. 1611-1635, July 2003.
22. I. Sason and R. Urbanke, "Complexity versus performance of capacity-achieving irregular repeat-accumulate codes on the binary erasure channel," IEEE Trans.on Iriformation Theory, vol. 50, pp. 1247-1256, June 2004.
23. I. Sason and G. Wiechman, "On achievable rates and complexity of LOPC codes for parallel channels with application to puncturing," submitted to IEEE Trans.on information Theory, August 2005. [Online). Available: http://arxiv.org/abs/cs.IT/0508072.
24. A. Shokrollahi, "New sequences of time erasure codes approaching channel capacity," in Proceedings of the 13th international Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Lectures Notes in Computer Science 1719, Springer Verlag, pp. 65-76, 1999.
25. w. Yu, M. Ardakani, B. Smith and F. Kschischang, "Complexity-optimized low-density parity-check codes for Gallager decoding algorithm B", Proceedings IEEE International Symposium on Iriformation Theory (ISIT 2005), pp. 1488-1492, Adelaide, Australia, 4-9 September 2005.
26. G. Wiechman and I. Sason, "Improved bounds on the parity-check density and achievable rates of binary linear block codes with applications to LOPC codes," submitted to IEEE Trans.on Iriformation Theory, May 2005. See http://arxiv.org/abs/cs.IT/0505057.