Near optimal reduced-complexity decoding algorithms for LDPC codes

被引:9
|
作者
Chen, J [1 ]
Dholakia, A [1 ]
Eleftheriou, E [1 ]
Fossorier, M [1 ]
Hu, XY [1 ]
机构
[1] Univ Hawaii Manoa, Dept Elect Engn, Honolulu, HI 96822 USA
关键词
D O I
10.1109/ISIT.2002.1023727
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, two families of reduced-complexity algorithms for decoding low-density parity-check (LDPC) codes based on incorporating either a normalization or a correction term in the check-node update are presented. A simplified symbol-node update can also be used. Using simulations, it is shown that these simplified belief propagation (BP) approaches provide near optimum performance with different classes of LDPC codes.
引用
收藏
页码:455 / 455
页数:1
相关论文
共 50 条
  • [41] Reduced-complexity decoding for concatenated codes based on rectangular parity-check codes and turbo codes
    Shea, JM
    Wong, TF
    [J]. GLOBECOM '01: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6, 2001, : 1031 - 1035
  • [42] Reduced-Complexity Collaborative Decoding of Interleaved Reed-Solomon and Gabidulin Codes
    Kurzweil, Hans
    Seidl, Mathis
    Huber, Johannes B.
    [J]. 2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011,
  • [43] Reduced-Complexity Decoding of 3D Product Codes for Satellite Communications
    Xu, Yue
    Jiang, Ming
    Zhu, Mingyang
    Hu, Nan
    Zhao, Chunming
    Wang, Jiangzhou
    [J]. SPACE: SCIENCE & TECHNOLOGY, 2024, 4
  • [44] On adaptive reduced-complexity iterative decoding
    Martin, PA
    Taylor, DP
    [J]. GLOBECOM '00: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1- 3, 2000, : 772 - 776
  • [45] A reduced-complexity decoding algorithm for turbo codes with odd-even interleavers
    Ma, Xiao
    Wang, Xiuni
    Zhang, Lin
    [J]. PROCEEDINGS OF 2006 IEEE INFORMATION THEORY WORKSHOP, 2006, : 100 - +
  • [46] Low-complexity decoding of LDPC codes using reduced-set WBF-based algorithms
    Sadjad Haddadi
    Mahmoud Farhang
    Mostafa Derakhtian
    [J]. EURASIP Journal on Wireless Communications and Networking, 2020
  • [47] Reduced Complexity-and-Latency Variable-to-Check Residual Belief Propagation Decoding Algorithms for LDPC Codes
    Kim, Jung-Hyun
    Song, Hong-Yeop
    [J]. IWSDA'09: PROCEEDINGS OF THE FOURTH INTERNATIONAL WORKSHOP ON SIGNAL DESIGN AND ITS APPLICATIONS IN COMMUNICATIONS, 2009, : 76 - 79
  • [48] Low-complexity decoding of LDPC codes using reduced-set WBF-based algorithms
    Haddadi, Sadjad
    Farhang, Mahmoud
    Derakhtian, Mostafa
    [J]. EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2020, 2020 (01)
  • [49] Lowered-Complexity Decoding Algorithms of LDPC Codes for Agricultural-WSNs
    Noh, Dong-Hee
    Jeong, Sung-Hwan
    Choi, Ju-Hwan
    Kim, Dong-Seong
    [J]. 2019 ELEVENTH INTERNATIONAL CONFERENCE ON UBIQUITOUS AND FUTURE NETWORKS (ICUFN 2019), 2019, : 407 - 412
  • [50] Near perfect decoding of LDPC codes
    Huang, XF
    [J]. 2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2, 2005, : 302 - 306