A Modified Optimally Quantized Offset Min-Sum Decoding Algorithm for Low-Complexity LDPC Decoder

被引:13
|
作者
Roberts, Michaelraj Kingston [1 ]
Jayabalan, Ramesh [1 ]
机构
[1] PSG Coll Technol, Dept Elect & Commun Engn, Coimbatore 641004, Tamil Nadu, India
关键词
Coding gain; Finite word length; Low-density parity-check (LDPC) codes; Min-Sum algorithm (MSA); Quantization scheme; PARITY-CHECK CODES;
D O I
10.1007/s11277-014-2026-2
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
In this paper, A Modified Optimally Quantized Offset Min-Sum Decoding Algorithm for low complexity, low-density parity-check decoder is proposed. In the proposed algorithm, more effective adjustment for the check node and variable node updating process is achieved by introducing optimally quantized adaptive offset correction factors. Unlike the conventional Offset Min-Sum algorithm and its variants, the offset correction factor of the proposed algorithm can self adapt itself according to the state of both the check node and variable node during each iteration. Simulation results show that the proposed decoding algorithm achieves significant coding gain improvement over other Min-Sum algorithms without additional hardware complexity. In addition to the coding gain improvement, the proposed algorithm can reducing up to 8-14 % of the decoding iterations required to correct the channel errors at relatively low Signal-to-noise ratio. Furthermore, in the proposed algorithm the finite word length effects are reduced by utilizing a 6-bit non-uniform quantization scheme. The proposed algorithm with a 6-bit non-uniform quantization scheme is shown to achieve about 21.6 % reduction in the total number of memory bits required to store the processed data without degradation in the decoding performance.
引用
收藏
页码:561 / 570
页数:10
相关论文
共 50 条
  • [1] A Modified Optimally Quantized Offset Min-Sum Decoding Algorithm for Low-Complexity LDPC Decoder
    Michaelraj Kingston Roberts
    Ramesh Jayabalan
    Wireless Personal Communications, 2015, 80 : 561 - 570
  • [2] OPTIMALLY QUANTIZED OFFSET MIN-SUM ALGORITHM FOR FLEXIBLE LDPC DECODER
    Oh, Daesun
    Parhi, Keshab K.
    2008 42ND ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, VOLS 1-4, 2008, : 1886 - 1891
  • [3] A Modified Offset Min-Sum Decoding Algorithm for LDPC Codes
    Xu, Meng
    Wu, Jianhui
    Zhang, Meng
    ICCSIT 2010 - 3RD IEEE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY, VOL 3, 2010, : 19 - 22
  • [4] A Modified Min-Sum Algorithm for Quantized LDPC Decoders
    Hatami, Homayoon
    Mitchell, David G. M.
    Costello, Daniel J., Jr.
    Fuja, Thomas
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 2434 - 2438
  • [5] An Improved Low Complex Offset Min-Sum Based Decoding Algorithm for LDPC Codes
    Michaelraj Kingston Roberts
    S. Sudha Mohanram
    N. Shanmugasundaram
    Mobile Networks and Applications, 2019, 24 : 1848 - 1852
  • [6] An Improved Low Complex Offset Min-Sum Based Decoding Algorithm for LDPC Codes
    Roberts, Michaelraj Kingston
    Mohanram, S. Sudha
    Shanmugasundaram, N.
    MOBILE NETWORKS & APPLICATIONS, 2019, 24 (06): : 1848 - 1852
  • [7] Improved algorithm based on offset min-sum decoding for LDPC codes
    Chen F.
    Li H.
    Li P.
    Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics, 2022, 44 (07): : 2350 - 2356
  • [8] A Low-Complexity Neural Normalized Min-Sum LDPC Decoding Algorithm Using Tensor-Train Decomposition
    Liang, Yuanhui
    Lam, Chan-Tong
    Ng, Benjamin K.
    IEEE COMMUNICATIONS LETTERS, 2022, 26 (12) : 2914 - 2918
  • [9] Design of Turbo Decoder Based on Min-Sum Decoding Algorithm of LDPC Code
    Wang, Pengjun
    Yi, Fanglong
    PROCEEDINGS OF THE 2010 IEEE ASIA PACIFIC CONFERENCE ON CIRCUIT AND SYSTEM (APCCAS), 2010, : 430 - 433
  • [10] An Enhanced Offset Min-Sum decoder for 50 LDPC Codes
    Cui, Hangxuan
    Khoa Le Trung
    Ghaffari, Fakhreddine
    Declercq, David
    Lin, Jun
    Wang, Zhongfeng
    PROCEEDINGS OF 2019 25TH ASIA-PACIFIC CONFERENCE ON COMMUNICATIONS (APCC), 2019, : 490 - 495