Spatially Coupled LDPC Codes via Partial Superposition

被引:0
作者
Wang, Qianfan [1 ]
Cai, Suihua [2 ]
Lin, Wenchao [3 ]
Chen, Li [1 ]
Ma, Xiao [3 ,4 ]
机构
[1] Sun Yat Sen Univ, Sch Elect & Commun Engn, Guangzhou 510006, Guangdong, Peoples R China
[2] Sun Yat Sen Univ, Sch Elect & Informat Technol, Guangzhou 510006, Guangdong, Peoples R China
[3] Sun Yat Sen Univ, Sch Data & Comp Sci, Guangzhou 510006, Guangdong, Peoples R China
[4] Sun Yat Sen Univ, Guangdong Key Lab Informat Secur Technol, Guangzhou 510006, Guangdong, Peoples R China
来源
2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2019年
关键词
CONVOLUTIONAL-CODES; BLOCK;
D O I
10.1109/isit.2019.8849384
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we present a new class of spatially coupled low-density parity-check (SC-LDPC) codes, which are constructed by sending codewords of LDPC block code (LDPC-BC) in a block Markov superposition transmission (BMST) manner. Different from the conventional SC-LDPC codes, the proposed SC-LDPC codes can have encoder/decoder implemented with the basis of the hardware components of the corresponding LDPC-BCs. The proposed SC-LDPC codes are also a special class of BMST-LDPC codes. Distinguished from other types of BMST codes, BMST-LDPC codes have lower error floors even with an encoding memory of one and hence have lower decoding latency. Also different from the original BMST codes, partial superposition is implemented to alleviate error propagation. To analyze the bit error rate (BER) performance, we present the genie-aided (GA) bounds, which can be obtained by simulation or estimated from the performance of the basic code. Numerical results are presented to validate our analysis and demonstrate the performance advantage of the BMST-LDPC codes over the LDPC-BCs.
引用
收藏
页码:2614 / 2618
页数:5
相关论文
共 14 条
[1]  
Chen L, 2017, IEEE INT SYMP INFO, P1683, DOI 10.1109/ISIT.2017.8006816
[2]   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
[3]   Codes on graphs: Normal realizations [J].
Forney, GD .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :520-548
[4]   Windowed Decoding of Protograph-Based LDPC Convolutional Codes Over Erasure Channels [J].
Iyengar, Aravind R. ;
Papaleo, Marco ;
Siegel, Paul H. ;
Wolf, Jack Keil ;
Vanelli-Coralli, Alessandro ;
Corazza, Giovanni E. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (04) :2303-2320
[5]  
Kudekar Shrinivas, 2010, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing (ISTC 2010), P309, DOI 10.1109/ISTC.2010.5613887
[6]   Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation [J].
Kudekar, Shrinivas ;
Richardson, Tom ;
Urbanke, Ruediger L. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (12) :7761-7813
[7]   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
[8]   Iterative Decoding Threshold Analysis for LDPC Convolutional Codes [J].
Lentmaier, Michael ;
Sridharan, Arvind ;
Costello, Daniel J., Jr. ;
Zigangirov, Kamil Sh. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (10) :5274-5289
[9]   Finite-Length Algebraic Spatially-Coupled Quasi-Cyclic LDPC Codes [J].
Liu, Keke ;
El-Khamy, Mostafa ;
Lee, Jungwon .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2016, 34 (02) :329-344
[10]   Block Markov Superposition Transmission: Construction of Big Convolutional Codes From Short Codes [J].
Ma, Xiao ;
Liang, Chulong ;
Huang, Kechao ;
Zhuang, Qiutao .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (06) :3150-3163