Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation

被引:262
作者
Kudekar, Shrinivas [1 ]
Richardson, Tom [1 ]
Urbanke, Ruediger L. [2 ]
机构
[1] Qualcomm, Bridgewater, NJ 08807 USA
[2] Ecole Polytech Fed Lausanne, Sch Comp & Commun Sci, CH-1015 Lausanne, Vaud, Switzerland
关键词
Belief propagation (BP); capacity-achieving codes; channel coding; convolutional low-density parity-check (LDPC) codes; iterative decoding; LDPC codes; spatial coupling; spatially coupled codes; threshold saturation; PARITY-CHECK CODES; SHANNON LIMIT PERFORMANCE; REDUNDANT SIGNAL SETS; CONVOLUTIONAL-CODES; THRESHOLD SATURATION; COSET CODES; DENSITY; CHANNEL; BOUNDS; BLOCK;
D O I
10.1109/TIT.2013.2280915
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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 Felstrom 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.
引用
收藏
页码:7761 / 7813
页数:53
相关论文
共 118 条
[71]   Near Shannon limit performance of low density parity check codes [J].
MacKay, DJC ;
Neal, RM .
ELECTRONICS LETTERS, 1996, 32 (18) :1645-1646
[72]   Good error-correcting codes based on very sparse matrices [J].
MacKay, DJC .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (02) :399-431
[73]   Near Shannon limit performance of low density parity check codes [J].
MacKay, DJC ;
Neal, RM .
ELECTRONICS LETTERS, 1997, 33 (06) :457-458
[74]  
MacKay DJC, 1995, LECT NOTES COMPUT SC, V1025, P100
[75]  
MASSEY JL, 1969, IEEE T INFORM THEORY, V15, P122, DOI 10.1109/TIT.1969.1054260
[76]   The Generalized Area Theorem and Some of its Consequences [J].
Measson, Cyril ;
Montanari, Andrea ;
Richardson, Thomas J. ;
Urbanke, Ruediger .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (11) :4793-4821
[77]   Maxwell Construction: The Hidden Bridge Between Iterative and Maximum a Posteriori Decoding [J].
Measson, Cyril ;
Montanari, Andrea ;
Urbanke, Ruediger .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (12) :5277-5307
[78]   Asymptotically Good LDPC Convolutional Codes Based on Protographs [J].
Mitchell, David G. M. ;
Pusane, Ali E. ;
Zigangirov, Kamil Sh. ;
Costello, Daniel J., Jr. .
2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, :1030-+
[79]  
Nguyen PS, 2012, IEEE ICC, P2181, DOI 10.1109/ICC.2012.6364433
[80]  
Olmos P. M., 2011, Proceedings of the 2011 IEEE International Symposium on Information Theory - ISIT, P1816, DOI 10.1109/ISIT.2011.6033863