Asymptotic weight distributions of irregular repeat-accumulate codes

GLOBECOM - IEEE Global Telecommunications Conference

Volumn 3, Issue , 2005, Pages 1147-1151

  Hsu, Chun Hao ^a   Anastasopoulos, Achilleas ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC WEIGHT DISTRIBUTIONS; AVERAGE INPUT-PARITY WEIGHT ENUMERATOR (AIPWE); AVERAGE WEIGHT DISTRIBUTION (AWD); REPEAT-ACCUMULATE (RA) ENSEMBLES;

ASYMPTOTIC STABILITY; DECODING; MATRIX ALGEBRA; SPECTRUM ANALYSIS;

CODES (SYMBOLS);

EID: 33746617973     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2005.1577833     Document Type: Conference Paper

References (19)

1. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: turbo-codes," in Proc. International Conf. Communications, Geneva, Switzerland, May 1993, pp. 1064-1070.
2. R. G. Gallager, "Low density parity check codes," IEEE Trans. Information Theory, vol. 8, pp. 21-28, Jan. 1962.
3. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Information Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001.
4. H. Jin, A. Khandekar, and R. J. McEliece, "Irregular repeat-accumulate codes," in Proc. International Symposium on Turbo Codes and Related Topics, Brest, France, Sept. 2000, pp. 1-8.
5. H. D. Pfister, I. Sason, and R. Urbanke, "Capacity-achieving ensembles for the binary erasure channel with bounded complexity," IEEE Trans. Information Theory, vol. 51, no. 7, pp. 2352-2379, July 2005.
6. T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Information Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
7. A. Barg and G. Zemor, "Error exponents of expander codes," IEEE Trans. Information Theory, vol. 48, no. 6, pp. 1725-1729, June 2002.
8. N. Varnica and M. Fossorier, "Belief-propagation with information correction: improved near maximum-likelihood decoding of low-density parity-check codes," in Proc. International Symposium on Information Theory, Chicago, USA, June 2004, p. 343.
9. H. Pishro-Nik and F. Fekri, "On decoding of low-density parity-check codes over the binary erasure channel," IEEE Trans. Information Theory, vol. 50, no. 3, pp. 439-454, Mar. 2004.
10. I. Sason and R. Urbanke, "Parity-check density versus performance of binary linear block codes over memoryless symmetric channels," IEEE Trans. Information Theory, vol. 49, no. 7, pp. 1611-1635, July 2003.
11. I. Sason, E. Telatar, and R. Urbanke, "On the asymptotic input-output weight distributions and thresholds of convolutional and turbo-like encoders," IEEE Trans. Information Theory, vol. 48, no. 12, pp. 3052-3061, Dec. 2002.
12. A. Abbasfar, D. Divsalar, and K. Yao, "Maximum likelihood decoding analysis of accumulate-repeat-accumulate codes," in Proc. Global Telecommunications Conference, Dallas, USA, Nov. 2004, pp. 514-519.
13. J. Garcia-Frias and W. Zhong, "Approaching shannon performance by iterative decoding of linear codes with low-density generator matrix," IEEE Commun. Lett., vol. 7, no. 6, pp. 266-268, June 2003.
14. G. Poltyrev, "Bounds on the decoding error probability of binary linear codes via their spectra," IEEE Trans. Information Theory, vol. 40, no. 4, pp. 1284-1292, July 1994.
15. N. Shulman and M. Feder, "Random coding techniques for nonrandom codes," IEEE Trans. Information Theory, vol. 45, no. 6, pp. 2101-2104, Sept. 1999.
16. D. Divsalar, "A simple tight bound on error probability of block codes with application to turbo codes," Tech. Rep. TDA Progress Report 42-139, Jet Propulsion Labs., Pasadena, CA, Nov. 1999.
17. D. Divsalar, H. Jin, and R. J. McEliece, "Coding theorems for turbolike codes," in Proc. Allerton Conf. Commun., Control, Comp., Allerton House, Illinois, 1998, pp. 201-210.
18. D. Burshteind and G. Miller, "Asymptotic enumeration methods for analyzing ldpc codes," IEEE Trans. Information Theory, vol. 50, no. 6, pp. 1115-1131, June 2004.
19. S. Shamai and I. Sason, "Variations on the gallager bounds, connections, and applications," IEEE Trans. Information Theory, vol. 48, no. 12, pp. 3029-3051, Dec. 2002.