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
相关论文
共 15 条
  • [1] Anastasopoulos A, 2001, GLOB TELECOMM CONF, P1021, DOI 10.1109/GLOCOM.2001.965572
  • [2] Reduced-complexity decoding of LDPC codes
    Chen, JH
    Dholakia, A
    Eleftheriou, E
    Fossorier, MRC
    Hu, XY
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2005, 53 (08) : 1288 - 1299
  • [3] Near optimum universal belief propagation based decoding of low-density parity check codes
    Chen, JH
    Fossorier, MPC
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2002, 50 (03) : 406 - 414
  • [4] Design of Protograph LDPC Codes for Partial Response Channels
    Fang, Yi
    Chen, Pingping
    Wang, Lin
    Lau, Francis C. M.
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2012, 60 (10) : 2809 - 2819
  • [5] Reduced complexity iterative decoding of low-density parity check codes based on belief propagation
    Fossorier, MPC
    Mihaljevic, M
    Imai, H
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1999, 47 (05) : 673 - 680
  • [6] LOW-DENSITY PARITY-CHECK CODES
    GALLAGER, RG
    [J]. IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (01): : 21 - &
  • [7] Howard SL, 2005, 2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2, P1131
  • [8] *IEEE, 2005, 1104088906000N IEEE
  • [9] Adaptive offset Min-Sum algorithm for Low-Density Parity Check codes
    Jiang, Ming
    Zhao, Chunming
    Zhang, Li
    Xu, Enyang
    [J]. IEEE COMMUNICATIONS LETTERS, 2006, 10 (06) : 483 - 485
  • [10] Improved low-density parity-check codes using irregular graphs
    Luby, MG
    Mitzenmacher, M
    Shokrollahi, MA
    Spielman, DA
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) : 585 - 598