计算机与数字工程2025，Vol.53Issue(1)：11-14,20,5.DOI:10.3969/j.issn.1672-9722.2025.01.003
LDPC码自适应量化最小和算法
Adaptive Quantization Minimum-sum Algorithm for LDPC Codes
摘要
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.关键词
LDPC码/最小和译码/自适应量化Key words
LDPC codes/min-sum decoding/adaptive quantization分类
信息技术与安全科学引用本文复制引用
周华,马凌峻,李文杰..LDPC码自适应量化最小和算法[J].计算机与数字工程,2025,53(1):11-14,20,5.基金项目
国家自然科学基金项目(编号:61771248)资助. （编号:61771248）
