Adaptive Quantization Minimum-sum Algorithm for LDPC Codes
ZHOU Hua
MA Lingjun
LI Wenjie
Abstract：In the decoding method of LDPC codes,the sum-product decoding algorithm is difficult to be practically applied due to its high complexity.As a simplification of sum-product decoding,min-sum decoding is the main algorithm in the design of LDPC decoders at present.The quantization process converts floating-point data to fixed-point data which is an important step in de-coder design.However,the use of traditional quantization methods will lead to the appearance of erroneous levels due to the limita-tion of quantization bits.To this end,an adaptive quantization minimum-sum algorithm is proposed.After each iterative decoding,the result of parity check is used to adaptively increase the quantization step size so that the quantizer can better adapt to the charac-teristics of iterative decoding.The simulation results show that the algorithm can effectively suppress the error leveling phenomenon.The decoding performance is improved by about 0.2 dB at medium and high SNR compared with the traditional quantization algo-rithm and the storage space of 1 bit is saved.
Keywords：LDPC codesmin-sum decodingadaptive quantization
Publication Date：2025-01-19
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：5( 11-14,20 )