A Survey on Protograph LDPC Codes and Their Applications

被引:130
作者
Fang, Yi [1 ,2 ]
Bi, Guoan [2 ]
Guan, Yong Liang [2 ]
Lau, Francis C. M. [3 ]
机构
[1] Guangdong Univ Technol, Sch Informat Engn, Guangzhou 510006, Guangdong, Peoples R China
[2] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
[3] Hong Kong Polytech Univ, Dept Elect & Informat Engn, Kowloon, Hong Kong, Peoples R China
关键词
Asymptotic weight distribution (AWD); decoding threshold; extrinsic information transfer (EXIT); protograph low-density parity-check (LDPC) codes; PARITY-CHECK CODES; DECODE-AND-FORWARD; PERFORMANCE ANALYSIS; BELIEF PROPAGATION; MINIMUM DISTANCE; JOINT CHANNEL; DESIGN; DIVERSITY; CAPACITY; ENSEMBLES;
D O I
10.1109/COMST.2015.2436705
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Low-density parity-check (LDPC) codes have attracted much attention over the past two decades since they can asymptotically approach the Shannon capacity in a variety of data transmission and storage scenarios. As a type of promising structured LDPC codes, the protograph LDPC codes not only inherit the advantage of conventional LDPC codes, i.e., excellent error performance, but also possess simple representations to realize fast encoding and efficient decoding. This paper provides a comprehensive survey on the state-of-the-art in protograph LDPC code design and analysis for different channel conditions, including the additive white Gaussian noise (AWGN) channels, fading channels, partial response (PR) channels, and Poisson pulse-position modulation (PPM) channels. Moreover, the applications of protograph LDPC codes to joint source-and-channel coding (JSCC) and joint channel-and-physical-layer-network coding (JCPNC) are reviewed and studied. In particular, we focus our attention on the encoding design and assume the decoder is implemented by the belief propagation (BP) algorithm. Hopefully, this survey may facilitate research in this area.
引用
收藏
页码:1989 / 2016
页数:28
相关论文
共 160 条
[1]  
Abbasfar A, 2004, GLOB TELECOMM CONF, P509
[2]   Accumulate-repeat-accumulate codes [J].
Abbasfar, Aliazam ;
Divsalar, Dariush ;
Yao, Kung .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2007, 55 (04) :692-702
[3]  
Abu-Surra S, 2006, LECT NOTES COMPUT SC, V3857, P245
[4]  
Abu-Surra S., 2010, PROC INF THEORY APPL, P1
[5]  
Abu-Surra S., 2006, P UCSD WORKSH ITA FE, P6
[6]  
Abu-Surra S, 2007, GLOB TELECOMM CONF, P1492
[7]   Enumerators for Protograph-Based Ensembles of LDPC and Generalized LDPC Codes [J].
Abu-Surra, Shadi ;
Divsalar, Dariush ;
Ryan, William E. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (02) :858-886
[8]   A linear time erasure-resilient code with nearly optimal recovery [J].
Alon, N ;
Luby, M .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (06) :1732-1736
[9]  
Andrews A., 2004, P IPN PROGR REP NOV, V42-159, P1
[10]   The development of turbo and LDPC codes for deep-space applications [J].
Andrews, Kenneth S. ;
Divsalar, Dariush ;
Dolinar, Sam ;
Hamkins, Jon ;
Jones, Christopher R. ;
Pollara, Fabrizio .
PROCEEDINGS OF THE IEEE, 2007, 95 (11) :2142-2156