Construction of Near-Capacity Protograph LDPC Code Sequences With Block-Error Thresholds

被引:30
作者
Pradhan, Asit Kumar [1 ]
Thangaraj, Andrew [1 ]
Subramanian, Arunkumar [2 ]
机构
[1] Indian Inst Technol, Dept Elect Engn, Madras 600036, Tamil Nadu, India
[2] SanDisk Corp, Milpitas, CA 95035 USA
关键词
Capacity; LDPC codes; protographs; DESIGN; GRAPHS; ENSEMBLES;
D O I
10.1109/TCOMM.2015.2500234
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Density evolution for protograph low-density parity-check (LDPC) codes is considered, and it is shown that the message-error rate falls double-exponentially with iterations whenever the degree-2 subgraph of the protograph is cycle-free and noise level is below threshold. Conditions for stability of protograph density evolution are established and related to the structure of the protograph. Using large-girth graphs, sequences of protograph LDPC codes with block-error threshold equal to bit-error threshold and block-error rate falling near-exponentially with blocklength are constructed deterministically. Small-sized protographs are optimized to obtain thresholds near capacity for binary erasure and binary-input Gaussian channels.
引用
收藏
页码:27 / 37
页数:11
相关论文
共 36 条
[11]   Regular graphs of large girth and arbitrary degree [J].
Dahan, Xavier .
COMBINATORICA, 2014, 34 (04) :407-426
[12]  
Davidoff G., 2003, LONDON MATH SOC STUD
[13]   Construction of protograph LDPC codes with linear minimum distance [J].
Divsalar, Dariush ;
Dolinar, Sam ;
Jones, Christopher .
2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, :664-+
[14]   Capacity-Approaching Protograph Codes [J].
Divsalar, Dariush ;
Dolinar, Sam ;
Jones, Christopher R. ;
Andrews, Kenneth .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2009, 27 (06) :876-888
[15]   Design and Analysis of Root-Protograph LDPC Codes for Non-Ergodic Block-Fading Channels [J].
Fang, Yi ;
Bi, Guoan ;
Guan, Yong Liang .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2015, 14 (02) :738-749
[16]   Design of Protograph LDPC Codes for Partial Response Channels [J].
Fang, Yi ;
Chen, Pingping ;
Wang, Lin ;
Lau, Francis C. M. .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2012, 60 (10) :2809-2819
[17]  
Gallager R. G., 1963, RES MONOGRAPH SERIES
[18]   Terminated and Tailbiting Spatially Coupled Codes With Optimized Bit Mappings for Spectrally Efficient Fiber-Optical Systems [J].
Hager, Christian ;
Graell i Amat, Alexandre ;
Brannstrom, Fredrik ;
Alvarado, Alex ;
Agrell, Erik .
JOURNAL OF LIGHTWAVE TECHNOLOGY, 2015, 33 (07) :1275-1285
[19]   Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC [J].
Kudekar, Shrinivas ;
Richardson, Thomas J. ;
Urbanke, Ruediger L. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (02) :803-834
[20]   On the connectivity of certain graphs of high girth [J].
Lazebnik, F ;
Viglione, R .
DISCRETE MATHEMATICS, 2004, 277 (1-3) :309-319