Accumulate-Repeat-Accumulate Codes: Systematic Codes Achieving the Binary Erasure Channel Capacity with Bounded Complexity
摘要
The paper introduces ensembles of accumulate-repeat-accumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with {\em bounded complexity} per information bit. It also introduces symmetry properties which play a central role in the construction of capacity-achieving ensembles for the BEC. The results here improve on the tradeoff between performance and complexity provided by the first capacity-achieving ensembles of irregular repeat-accumulate (IRA) codes with bounded complexity per information bit; these IRA ensembles were previously constructed by Pfister, Sason and Urbanke. 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 LDPC and IRA codes. The ARA codes also have the advantage of being systematic.
引用
@article{arxiv.cs/0509044,
title = {Accumulate-Repeat-Accumulate Codes: Systematic Codes Achieving the Binary Erasure Channel Capacity with Bounded Complexity},
author = {Henry D. Pfister and Igal Sason},
journal= {arXiv preprint arXiv:cs/0509044},
year = {2007}
}
备注
15 pages, 3 figures (please ignore the 16th page in the PDF file, which appears as a result of a temporary problem in the compilation of the PDF; however, the PS file is indeed 15 pages). The paper will be presented in the Forty-Third Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, USA, Sept. 28-30, 2005