Accumulate Repeat Accumulate codes

GLOBECOM - IEEE Global Telecommunications Conference

Volumn 1, Issue , 2004, Pages 509-513

  Abbasfar, Aliazam ^a   Divsalar, Dariush ^b   Yao, Kung ^a  

^a University of California   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHECK NODES; LOW DENSITY PARITY CHECK (LDPC); NODE DEGREE DISTRIBUTION; SPEED DECODERS;

APPROXIMATION THEORY; CHANNEL CAPACITY; COMPUTER SIMULATION; GRAPHIC METHODS; MATHEMATICAL MODELS; SET THEORY; SIGNAL TO NOISE RATIO; WAVE PROPAGATION;

ENCODING (SYMBOLS);

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

References (19)

1. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT ' Press, 1963.
2. C. Berrou and A. Glavieux, "Near optimum error correcting coding and decoding: Turbo-codes," IEEE Trans. Commun., Vol. 44, pp. 1261-1271, October 1996.
3. M. R. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. 27, pp. 533-547, 1981.
4. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," TF.F.F, Trans. Inform. Theory, vol. 47, pp. 619-637, 2001.
5. S.-Y. Chung, D. Fomey, T. Richardson, and R. Urbanke, "On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit," IEEE Communication Letters, vol. 5, pp. 58-60, 2001.
6. D. Divsalar, H. Jin, and R. McEliece, "Coding theorems for Turbo-like codes," in Proceedings of the 1998 Allerton Conference, pp. 201-210, 1998.
7. H. Jin, A. Khandekar, and R. McEliece, "Irregular repeat-accumulate codes." in Proc. 2nd International Symposium on Turbo Codes, pp. 1-8, 2000.
8. Jeremy Thorpe, "Low Density Parity Check (LDPC) Codes Constructed from Protographs," IPL INP Progress Report 42-154, August 15, 2003.
9. D. Divsalar, S. Dolinar, and F. Pollara, "Iterative Turbo Decoder Analysis based on Density Evolution," IEEE Journal on Select Areas in Communications, Volume: 19 Issue: 5, May 2001, Page(s): 891-907
10. Richardson, et al., "Methods and apparatus for decoding LDPC codes," United States Patent 6,633,856, October 14, 2003.
11. T. Richardson, "Multi-Edge Type LDPC Codes," presented at the Workshop honoring Prof. Bob McEliece on his 60th birthday (but not included in the proceedings), California Institute of Technology, Pasadena, California, May 24-25, 2002.
12. D.J.C. MacKay, R.M. Neal, "Near Shannon limit performance of low density parity check codes," Electronics Letters, Vol. 32, Issue 18, 29 Aug. 1996, Page(s) 1645.
13. T. Richardson and R. Urbanke,"The Renaissance of Gallagers Low-Density Parity-Check Codes," IEEE Communications Magazine, pages 126-131, August 2003
14. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, "Analysis of low density codes and improved designs using irregular graphs," IEEE Trans. Inform. Theory, vol. 47, pp. 585-598, 2001.
15. T. Richardson and R. Urbanke, "The capacity of low-density parity check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, 2001.
16. Y. Kou, S. Lin, and M.P.C. Fossorier, "Low-density parity-check codes based on finite geometries: a rediscovery and new results," IEEE Transactions on Information Theory, Volume: 47 Issue: 7, Nov. 2001, Page(s): 2711-2736.
17. F.R. Kschischang, "Codes defined on graphs." IEEE Communications Magazine, Vol. 41, Issue 8, Aug. 2003, Pages 118-125.
18. S. Bennedetto and G. Montorsi, "Unveiling Turbo Codes: Some results on parallel concatenated codes," IEEE Trans. On Information Theory, vol. 42, no. 2, March 1996, pp. 409-428.
19. S. Benedetto, G. Montorsi, D. Divsalar, and F. Pollara, "Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding," IFFF. Trans. Info. Theory, vol. 44, pp. 909-926, May 1998.