Protograph-Based Raptor-Like LDPC Codes

被引:117
作者
Chen, Tsung-Yi [1 ]
Vakilinia, Kasra [2 ]
Divsalar, Dariush [2 ]
Wesel, Richard D. [2 ,3 ]
机构
[1] SpiderCloud Wireless Inc, San Jose, CA 95134 USA
[2] Univ Calif Los Angeles, Dept Elect Engn, Los Angeles, CA 90095 USA
[3] CALTECH, Jet Prop Lab, Pasadena, CA 91109 USA
基金
美国国家科学基金会;
关键词
Channel coding; low-density parity-check codes; PARITY-CHECK CODES; DESIGN; COMPLEXITY; CAPACITY; PERFORMANCE;
D O I
10.1109/TCOMM.2015.2404842
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper proposes protograph-based Raptor-like (PBRL) codes as a class of rate-compatible low-density parity-check codes for binary-input AWGN channels. As with the Raptor codes, exclusive-OR operations on precoded bits produce additional parity bits providing extensive rate compatibility. Unlike Raptor codes, each additional parity bit in the protograph is explicitly designed to optimize the density evolution threshold. During the lifting process, approximate cycle extrinsic message degree (ACE) and circulant progressive edge growth (CPEG) constraints are used to avoid undesirable graphical structures. Some density-evolution performance is sacrificed to obtain lower error floors, particularly at short blocklengths. Simulation results are shown for information block sizes of k = 1032 and 16 384. For a target frame error rate of 10(-5), at each rate, the k = 1032 and 16 384 code families perform within 1 dB and 0.4 dB of both the Gallager bound and the normal approximation, respectively. The 16 384 code family outperforms the best known standardized code family, namely, the AR4JA codes. The PBRL codes also outperform DVB-S2 codes that have the advantages of longer blocklengths and outer BCH codes. Performance is similar to RC code families designed by Nguyen et al. that do not constrain codes to have the PBRL structure and involve simulation in the optimization process at each rate.
引用
收藏
页码:1522 / 1532
页数:11
相关论文
共 56 条
[11]  
Divsalar D, 2005, GLOB TELECOMM CONF, P1152
[12]   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
[13]  
Dolinar S, 2005, 2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2, P1627
[14]  
Eckford AW, 2006, IEEE ICC, P1537
[15]   Design of Rate-Compatible Structured LDPC Codes for Hybrid ARQ Applications [J].
El-Khamy, Mostafa ;
Hou, Jilei ;
Bhushan, Naga .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2009, 27 (06) :965-973
[16]   Raptor codes on binary memoryless symmetric channels [J].
Etesami, O ;
Shokrollahi, A .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (05) :2033-2051
[17]   Time-varying periodic convolutional codes with low-density parity-check matrix [J].
Felstrom, AJ ;
Zigangirov, KS .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (06) :2181-2191
[18]   A SIMPLE DERIVATION OF THE CODING THEOREM AND SOME APPLICATIONS [J].
GALLAGER, RG .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1965, 11 (01) :3-18
[19]   LOW-DENSITY PARITY-CHECK CODES [J].
GALLAGER, RG .
IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (01) :21-&
[20]  
GALLAGER RG, 1960, THESIS MIT CAMBRIDGE