Title :
Capacity-achieving ensembles for the binary erasure channel with bounded complexity
Author :
Pfister, Henry ; Sason, Igal ; Urbanke, Rüdiger
Author_Institution :
QUALCOMM Inc., San Diego, CA, USA
Abstract :
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the binary erasure channel (BEC) with bounded complexity. This is in contrast to all previous constructions of capacity-achieving sequences of ensembles whose complexity grows at least like the log of the inverse of the gap to capacity. The new bounded complexity result is achieved by allowing a sufficient number of state nodes in the Tanner graph representing the codes.
Keywords :
binary codes; channel capacity; channel coding; computational complexity; graph theory; BEC; Tanner graph; binary erasure channel; bounded complexity; capacity-achieving ensembles; nonsystematic irregular repeat-accumulate codes; state nodes; Channel capacity; Code standards; Communication channels; Communication standards; Error correction codes; H infinity control; Iterative decoding; Linear code; Parity check codes; Standards development;
Conference_Titel :
Electrical and Electronics Engineers in Israel, 2004. Proceedings. 2004 23rd IEEE Convention of
Print_ISBN :
0-7803-8427-X
DOI :
10.1109/EEEI.2004.1361101
