DocumentCode
111497
Title
Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation
Author
Kudekar, Shrinivas ; Richardson, Tom ; Urbanke, Rudiger L.
Author_Institution
Qualcomm, Bridgewater, NJ, USA
Volume
59
Issue
12
fYear
2013
fDate
Dec. 2013
Firstpage
7761
Lastpage
7813
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 that fulfills these constraints universally on this class of channels under belief propagation decoding. In fact, most codes in this ensemble have this property. The quantifier universal refers to the single ensemble/code that is good for all channels but 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; channel coding; decoding; error statistics; parity check codes; belief propagation; belief propagation decoding; belief propagation threshold; binary erasure channel; binary-input memoryless output-symmetric channels; convolutional LDPC; error probability; maximum a priori threshold; quantifier universal; receiver; spatial coupling; spatially coupled code; spatially coupled ensembles universally achieve capacity; Convolutional codes; Couplings; Decoding; Encoding; Energy states; Error probability; Parity check codes; Belief propagation (BP); LDPC codes; capacity-achieving codes; channel coding; convolutional low-density parity-check (LDPC) codes; iterative decoding; spatial coupling; spatially coupled codes; threshold saturation;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2013.2280915
Filename
6589171
Link To Document