Accumulate-repeat-accumulate codes: Systematic codes achieving the binary erasure channel capacity with bounded complexity

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

Volumn 1, Issue , 2005, Pages 30-44

  Pfister, Henry D ^a   Sason, Igal ^b  

^a EPFL   (Switzerland)

^b Dept of Electrical Engineering ^*  (Israel)

Author keywords

Binary erasure channel (BEC); Capacity; Complexity; Degree distribution (d.d.); Density evolution (DE); Irregular repeat accumulate (IRA) codes; Iterative decoding; Systematic codes

Indexed keywords

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

References (15)

1. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Efficient erasure correcting codes, " IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001.
2. M. A. Shokrollahi, "New sequences of linear time erasure codes approaching the channel capacity, " in Applicable Algebra in Eng., Commun. Comp., 1999, pp. 65-76.
3. P. Oswald and M. A. Shokrollahi, "Capacity-achieving sequences for the erasure channel, " IEEE Trans. Inform. Theory, vol. 48, no. 12, pp. 3017-3028, Dec. 2002.
4. H. Jin, A. Khandekar, and R. J. McEliece, "Irregular repeat-accumulate codes, " in Proc. Int. Symp. on Turbo Codes & Related Topics, Brest, France, Sept. 2000.
5. I. Sason and R. Urbanke, "Complexity versus performance of capacity-achieving irregular repeat- accumulate codes on the binary erasure channel, " IEEE Trans. Inform. Theory, vol. 50, no. 6, pp. 1247-1256, June 2004.
6. A. Khandekar and R. J. McEliece, "On the complexity of reliable communication on the erasure channel, " in Proc. IEEE Int. Symp. Information Theory, Washington, D.C., USA, June 2001, p. 1.
7. I. Sason and R. Urbanke, "Parity-check density versus performance of binary linear block codes over memoryless symmetric channels, " IEEE Trans. Inform. Theory, vol. 49, no. 7, pp. 1611-1635, July 2003.
8. H. D. Pfister, I. Sason, and R. Urbanke, "Capacity-achieving ensembles for the binary erasure channel with bounded complexity, " IEEE Trans. Inform. Theory, vol. 51, no. 7, pp. 2352-2379, July 2005.
9. A. Abbasfar, D. Divsalar, and Y. Kung, "Accumulate repeat accumulate codes, " in Proc. IEEE Global Telecom. Conf., Dallas, TX, USA, Dec. 2004, pp. 509-513.
10. D. Divsalar, S. Dolinar, and J. Thorpe, "Accumulate-repeat-accumulate codes, " in Proc. IEEE Vehicular Technology Conf., vol. 2, Los Angeles, CA, USA, Sept. 2004, pp. 1271-1275.
11. K. Andrews, S. Dolinar, D. Divsalar, and J. Thorpe, "Design of low-density parity-check (ldpc) codes for deep-space applications, " IPN Progress Report, vol. 42, no. 159, Nov. 2004. [Online]. Available: http://tmo.jpl.nasa.gov/progress report/42-159/159K.pdf
12. C. H. Hsu and A. Anastasopoulos, "Capacity-achieving codes with bounded graphical complexity on noisy channels, " in Proc. 43rd Annual Allerton Conf. on Commun., Control, and Comp., Monticello, IL, USA, Sept. 2005.
13. R. M. Tanner, "A recursive approach to low complexity codes, " IEEE Trans. Inform. Theory, vol. 27, no. 5, pp. 533-547, Sept. 1981.
14. J. Thorpe, "Low-density parity-check (LDPC) codes constructed from protographs, " IPN Progress Report, vol. 42, no. 154, Aug. 2003. [Online]. Available: http://tmo.jpl.nasa.gov/progress report/42-154/154C.pdf
15. G. D. Forney, "Codes on graphs: Normal realizations, " IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 520-548, Feb. 2001.