Accumulate-repeat-accumulate codes

IEEE Transactions on Communications

Volumn 55, Issue 4, 2007, Pages 692-702

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

^a RAMBUS INC   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^c University of California   (United States)

Author keywords

Error bounds; Graphs; Low density parity check (LDPC) codes; Thresholds; Turbo like codes; Weight distribution

Indexed keywords

CODES (SYMBOLS); COMPUTER SIMULATION; CONSTRAINT THEORY; GRAPH THEORY; ITERATIVE DECODING; RANDOM PROCESSES; TURBO CODES;

ACCUMULATE-REPEAT-ACCUMULATE (ARA) CODES; ERROR BOUNDS; INNOVATIVE CHANNEL CODING SCHEME; LOW-DENSITY PARITY CHECK (LDPC) CODES;

CHANNEL CODING;

EID: 34247261453     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2007.894109     Document Type: Article

References (29)

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, no. 10, pp. 1261-1271, Oct. 1996.
3. M. R. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
4. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
5. S.-Y. Chung, D. Forney, T. Richardson, and R. Urbanke, "On the design of low-density parity- check codes within 0.0045 dB of the Shannon limit," IEEE Commun. Lett., vol. 5, no. 1, pp. 58-60, Jan. 2001.
6. D. Divsalar, H. Jin, and R. McEliece, "Coding theorems for turbo-like codes," in Proc. Allerton Conf., 1998, pp. 201-210.
7. H. Jin, A. Khandekar, and R. McEliece, "Irregular repeat-accumulate codes," in Proc. 2nd Int. Symp. Turbo Codes, 2000, pp. 1-8.
8. J. Thorpe, Low Density Parity Check (LDPC) Codes Constructed from Pictographs JPL INP, 2003, Progress Rep. 42-154.
9. D. Divsalar, S. Dolinar, and F. Pollara, "Iterative turbo decoder analysis based on density evolution," IEEE J. Sel. Areas Commun., vol. 19, no. 5, pp. 891-907, May 2001.
10. Richardson, "Methods and Apparatus for Decoding LDPC Codes," U.S. Patent 6 633 856, Oct. 14, 2003.
11. T. Richardson, "Multi-edge type LDPC codes," in Workshop Honoring Prof. Bob McEliece, Pasadena, CA, May 24-25, 2002.
12. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electron. Lett., vol. 32, no. 18, p. 1645, Aug. 1996.
13. T. Richardson and R. Urbanke, "The renaissance of Gallager's low-density parity-check codes," IEEE Commun. Mag., pp. 126-131, Aug. 2003.
14. D. Divsalar, A Simple Tight Bound on Error Probability of Block Codes with Application to Turbo Codes Jet Propulsion Laboratory, CA, 1999, JPL TMO Progress Rep. 42-139.
15. D. Divsalar and E. Biglieri, "Upper bounds to error probabilities of coded systems beyond the cutoff rate," IEEE Trans. Commun., vol. 51, no. 12, pp. 2011-2018, Dec. 2003.
16. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, "Analysis of low density codes and improved designs using irregular graphs," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001.
17. T. Richardson and R. Urbanke, "The capacity of low-density parity check codes under message- passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
18. A. Abbasfar, D. Divsalar, and K. Yao, "A class of turbo-like codes with efficient and practical high-speed decoders," in Proc. IEEE Military Commun. Conf., Oct.-Nov. 2004, pp. 245-250.
19. Y. Kou, S. Lin, and M. P. C. Fossorier, "Low-density parity-check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Inf. Theory, vol. 47, no. 11, pp. 2711-2736, Nov. 2001.
20. F. R. Kschischang, "Codes defined on graphs," IEEE Commun. Mag., vol. 41, no. 8, pp. 118-125, Aug. 2003.
21. S. Bennedetto and G. Montorsi, "Unveiling turbo codes: Some results on parallel concatenated codes," IEEE Trans. Inf. Theory, vol. 42, no. 2, pp. 409-428, Mar. 1996.
22. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding," IEEE Trans. Inf. Theory, vol. 44, no. 5, pp. 909-926, May 1998.
23. D. Divsalar, S. Dolinar, J. Thorpe, and C. Jones, "Constructing LDPC codes from simple loop-free encoding modules," in Proc. IEEE ICC, Seoul, Korea, May 2005, pp. 658-662.
24. D. Divsalar, "Low-rate LDPC codes with simple protograph structure," in Proc. IEEE Int. Symp. Inf. Theory, Adelaide, Australia, Sep. 2005, pp. 1622-1626.
25. D. Divsalar, "Finite length weight enumerators for protograph based LDPC code ensembles," presented at the IEEE Commun. Theory Workshop Park City, UT, Jun. 2005.
26. D. Divsalar, "Ensemble weight enumerators for protograph LDPC codes," in Proc. IEEE Int. Symp. Inf. Theory, Seattle, WA, Jul. 2006, pp. 1554-1558.
27. K. Andrews, S. Dolinar, and J. Thorpe, "Encoders for block-circulant LDPC codes," in Proc. IEEE Int. Symp. Inf. Theory, Adelaide, Australia, Sep. 2005, pp. 2300-2304.
28. H. Jin and R. J. McEliece, "Coding theorems for turbo code ensembles," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1451-1461, Jun. 2002.
29. S. ten Brink, "Code doping for triggering iterative decoding convergence," in Proc. IEEE Int. Symp. Inf. Theory, Jul. 2001, p. 235.