Windowed Decoding of Protograph-Based LDPC Convolutional Codes Over Erasure Channels

被引:170
|
作者
Iyengar, Aravind R. [1 ,2 ]
Papaleo, Marco [3 ]
Siegel, Paul H. [1 ,2 ]
Wolf, Jack Keil [1 ,2 ]
Vanelli-Coralli, Alessandro [4 ]
Corazza, Giovanni E. [4 ]
机构
[1] Univ Calif San Diego, Dept Elect & Comp Engn, La Jolla, CA 92093 USA
[2] Univ Calif San Diego, Ctr Magnet Recording Res, La Jolla, CA 92093 USA
[3] Qualcomm Inc, Corp Res & Dev Dept, San Diego, CA USA
[4] Univ Bologna, I-40136 Bologna, Italy
基金
美国国家科学基金会;
关键词
Belief propagation; convolutional codes; decoding thresholds; erasure channels; iterative decoding; low-density parity-check codes; stopping sets; windowed decoding; PARITY-CHECK CODES; DENSITY; CAPACITY; BOUNDS;
D O I
10.1109/TIT.2011.2177439
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We consider a windowed decoding scheme for LDPC convolutional codes that is based on the belief-propagation (BP) algorithm. We discuss the advantages of this decoding scheme and identify certain characteristics of LDPC convolutional code ensembles that exhibit good performance with the windowed decoder. We will consider the performance of these ensembles and codes over erasure channels with and without memory. We show that the structure of LDPC convolutional code ensembles is suitable to obtain performance close to the theoretical limits over the memoryless erasure channel, both for the BP decoder and windowed decoding. However, the same structure imposes limitations on the performance over erasure channels with memory.
引用
收藏
页码:2303 / 2320
页数:18
相关论文
共 50 条
  • [31] Rate-Compatible Protograph-Based LDPC Codes for Inter-Symbol Interference Channels
    Thuy Van Nguyen
    Nosratinia, Aria
    Divsalar, Dariush
    IEEE COMMUNICATIONS LETTERS, 2013, 17 (08) : 1632 - 1635
  • [32] Ensemble weight enumerators for protograph-based generalized LDPC codes
    Abu-Surra, Shadi
    Ryan, William E.
    Divsalar, Dariush
    2007 INFORMATION THEORY AND APPLICATIONS WORKSHOP, 2007, : 340 - +
  • [33] Partially Quasi-Cyclic Protograph-Based LDPC Codes
    Smarandache, Roxana
    Mitchell, David G. M.
    Costello, Daniel J., Jr.
    2011 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2011,
  • [34] On the existence of typical minimum distance for protograph-based LDPC Codes
    Abu-Surra, Shadi
    Divsalar, Dariush
    Ryan, William E.
    2010 INFORMATION THEORY AND APPLICATIONS WORKSHOP (ITA), 2010, : 100 - 106
  • [35] Protograph-Based LDPC Code Design for Bit-Metric Decoding
    Steiner, Fabian
    Boecherer, Georg
    Liva, Gianluigi
    2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 1089 - 1093
  • [36] Pivoting Algorithms for Maximum Likelihood Decoding of LDPC Codes over Erasure Channels
    Liva, Gianluigi
    Matuz, Balazs
    Paolini, Enrico
    Chiani, Marco
    GLOBECOM 2009 - 2009 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-8, 2009, : 2408 - 2413
  • [37] Protograph-Based Globally-Coupled LDPC Codes Over the Gaussian Channel With Burst Erasures
    Zhang, Ji
    Bai, Baoming
    Zhu, Min
    Li, Shuangyang
    Li, Huaan
    IEEE ACCESS, 2019, 7 : 153853 - 153868
  • [38] Ensemble Pseudocodeword Weight Enumerators for Protograph-Based Generalized LDPC Codes
    Abu-Surra, Shadi
    Divsalar, Dariush
    Ryan, William E.
    GLOBECOM 2009 - 2009 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-8, 2009, : 4530 - +
  • [39] On Distance Properties of Quasi-Cyclic Protograph-Based LDPC Codes
    Butler, Brian K.
    Siegel, Paul H.
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 809 - 813
  • [40] Decoding LDPC Convolutional Codes on Markov Channels
    Manohar Kashyap
    Chris Winstead
    EURASIP Journal on Wireless Communications and Networking, 2008