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
基金
中国国家自然科学基金;
关键词
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
相关论文
共 50 条
  • [1] Design of Protograph-Based Quasi-Cyclic Spatially Coupled LDPC Codes
    Wang, Shuoshuo
    Wu, Zhanji
    Wu, Qihao
    [J]. 2020 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE WORKSHOPS (WCNCW), 2020,
  • [2] Designing Protograph-Based Quasi-Cyclic Spatially Coupled LDPC Codes With Large Girth
    Mo, Shiyuan
    Chen, Li
    Costello, Daniel J., Jr.
    Mitchell, David G. M.
    Smarandache, Roxana
    Qiu, Jie
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2020, 68 (09) : 5326 - 5337
  • [3] Partially Quasi-Cyclic Protograph-Based LDPC Codes
    Smarandache, Roxana
    Mitchell, David G. M.
    Costello, Daniel J., Jr.
    [J]. 2011 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2011,
  • [4] On Distance Properties of Quasi-Cyclic Protograph-Based LDPC Codes
    Butler, Brian K.
    Siegel, Paul H.
    [J]. 2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 809 - 813
  • [5] Protograph-based Quasi-Cyclic MDPC Codes for McEliece Cryptosystems
    Liva, Gianluigi
    Bartz, Hannes
    [J]. PROCEEDINGS OF 2018 IEEE 10TH INTERNATIONAL SYMPOSIUM ON TURBO CODES & ITERATIVE INFORMATION PROCESSING (ISTC), 2018,
  • [6] On the Girth of Quasi-Cyclic Protograph LDPC Codes
    Karimi, Mehdi
    Banihashemi, Amir H.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (07) : 4542 - 4552
  • [7] Spatially Coupled Quasi-Cyclic Quantum LDPC Codes
    Hagiwara, Manabu
    Kasai, Kenta
    Imai, Hideki
    Sakaniwa, Kohichi
    [J]. 2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 638 - 642
  • [8] Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes for Short Block-Lengths
    Ranganathan, Sudarsan V. S.
    Divsalar, Dariush
    Wesel, Richard D.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (06) : 3758 - 3777
  • [9] Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes With Girth 6 and Shortest Length
    Amirzade, Farzane
    Sadeghi, Mohammad-Reza
    Panario, Daniel
    [J]. 2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 368 - 373
  • [10] Design of Improved Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes for Short Block-Lengths
    Ranganathan, Sudarsan V. S.
    Divsalar, Dariush
    Wesel, Richard D.
    [J]. 2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 1207 - 1211