A Protograph-Based Design of Quasi-Cyclic Spatially Coupled LDPC Codes

被引：0

作者：

Chen, Li ^{[1
]}

Mo, Shiyuan ^{[1
]}

Costello, Daniel J., Jr. ^{[2
]}

Mitchell, David G. M. ^{[3
]}

Smarandache, Roxana ^{[2
]}

机构：

[1] Sun Yat Sen Univ, Sch Elect & Informat Technol, Guangzhou, Guangdong, Peoples R China

[2] Univ Notre Dame, Dept Elect Engn, Notre Dame, IN 46556 USA

[3] New Mexico State Univ, Klipsch Sch Elect & Comp Engn, Las Cruces, NM 88003 USA

来源：

2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2017年

基金：

中国国家自然科学基金;

关键词：

Cycles; LDPC codes; protographs; spatially coupled codes; sliding window decoding; CONVOLUTIONAL-CODES;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Spatially coupled (SC) low-density parity-check (LDPC) codes can achieve capacity approaching performance with low message recovery latency when using sliding window (SW) decoding. An SC-LDPC code constructed from a protograph can be generated by first coupling a chain of block protographs and then lifting the coupled protograph using permutation matrices. This paper introduces a systematic design of SC-LDPC codes to eliminate 4-cycles in the coupled protograph. Using a quasi-cyclic (QC) lifting, we obtain QC-SC-LDPC codes of girth at least eight. Coupling a chain of block protographs implies spreading edges from one protograph to the others. Our protograph-based design can be viewed as guiding the edge spreading and also the graph-lifting process. Simulation results show the design leads to improved decoding performance, particularly in the error floor, compared to random designs.

引用

页码：1683 / 1687

页数：5

共 11 条

[1] Cho J., 2015, P IEEE ICC
[2] Capacity-Approaching Protograph Codes
Divsalar, Dariush
Dolinar, Sam
Jones, Christopher R.
Andrews, Kenneth
[J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2009, 27 (06) : 876 - 888
[3] Quasi-cyclic low-density parity-check codes from circulant permutation matrices
Fossorier, MPC
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (08) : 1788 - 1793
[4] Windowed Decoding of Protograph-Based LDPC Convolutional Codes Over Erasure Channels
Iyengar, Aravind R.
Papaleo, Marco
Siegel, Paul H.
Wolf, Jack Keil
Vanelli-Coralli, Alessandro
Corazza, Giovanni E.
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (04) : 2303 - 2320
[5] Iterative Decoding Threshold Analysis for LDPC Convolutional Codes
Lentmaier, Michael
Sridharan, Arvind
Costello, Daniel J., Jr.
Zigangirov, Kamil Sh.
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (10) : 5274 - 5289
[6] Li J., 2016, LDPC Code Designs, Constructions, Unification
[7] Finite-Length Algebraic Spatially-Coupled Quasi-Cyclic LDPC Codes
Liu, Keke
El-Khamy, Mostafa
Lee, Jungwon
[J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2016, 34 (02) : 329 - 344
[8] Spatially Coupled LDPC Codes Constructed From Protographs
Mitchell, David G. M.
Lentmaier, Michael
Costello, Daniel J., Jr.
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (09) : 4866 - 4889
[9] Deriving Good LDPC Convolutional Codes from LDPC Block Codes
Pusane, Ali E.
Smarandache, Roxana
Vontobel, Pascal O.
Costello, Daniel J., Jr.
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (02) : 835 - 857
[10] Thorpe J., 2003, 42154 JET PROP LAB I

← 1 2 →