Accumulate-repeat-accumulate codes: Capacity-achieving ensembles of systematic codes for the erasure channel with bounded complexity

Published

Journal Article

This paper introduces ensembles of systematic accumulaterepeataccumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with bounded complexity, per information bit, of encoding and decoding. It also introduces symmetry properties which play a central role in the construction of new capacity-achieving ensembles for the BEC. The results here improve on the tradeoff between performance and complexity provided by previous constructions of capacity-achieving code ensembles defined on graphs. The superiority of ARA codes with moderate to large block length is exemplified by computer simulations which compare their performance with those of previously reported capacity-achieving ensembles of low-density parity-check (LDPC) and irregular repeataccumulate (IRA) codes. ARA codes also have the advantage of being systematic. © 2007 IEEE.

Full Text

Duke Authors

Cited Authors

  • Pfister, HD; Sason, I

Published Date

  • June 1, 2007

Published In

Volume / Issue

  • 53 / 6

Start / End Page

  • 2088 - 2115

International Standard Serial Number (ISSN)

  • 0018-9448

Digital Object Identifier (DOI)

  • 10.1109/TIT.2007.896873

Citation Source

  • Scopus