DocumentCode :
3126846
Title :
Spatially coupled ensembles universally achieve capacity under belief propagation
Author :
Kudekar, Shrinivas ; Richardson, Tom ; Urbanke, Rüdiger
Author_Institution :
Qualcomm, Bridgewater, NJ, USA
fYear :
2012
fDate :
1-6 July 2012
Firstpage :
453
Lastpage :
457
Abstract :
We investigate spatially coupled code ensembles. For transmission over the binary erasure channel, it was recently shown that spatial coupling increases the belief propagation threshold of the ensemble to essentially the maximum a-priori threshold of the underlying component ensemble. This explains why convolutional LDPC ensembles, originally introduced by Felström and Zigangirov, perform so well over this channel. We show that the equivalent result holds true for transmission over general binary-input memoryless output-symmetric channels. More precisely, given a desired error probability and a gap to capacity, we can construct a spatially coupled ensemble which fulfills these constraints universally on this class of channels under belief propagation decoding. In fact, most codes in that ensemble have that property. The quantifier universal refers to the single ensemble/code which is good for all channels if we assume that the channel is known at the receiver. The key technical result is a proof that under belief propagation decoding spatially coupled ensembles achieve essentially the area threshold of the underlying uncoupled ensemble. We conclude by discussing some interesting open problems.
Keywords :
belief networks; convolutional codes; decoding; error statistics; parity check codes; telecommunication channels; area threshold; belief propagation decoding; belief propagation threshold; binary erasure channel; binary-input memoryless output-symmetric channel; component ensemble; convolutional LDPC ensembles; error probability; maximum a-priori threshold; quantifier universal; receiver; spatially coupled code ensembles; uncoupled ensemble; Belief propagation; Convolutional codes; Couplings; Decoding; Encoding; Entropy; Parity check codes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
Conference_Location :
Cambridge, MA
ISSN :
2157-8095
Print_ISBN :
978-1-4673-2580-6
Electronic_ISBN :
2157-8095
Type :
conf
DOI :
10.1109/ISIT.2012.6284229
Filename :
6284229
Link To Document :
بازگشت