基于量化的LDPC译码算法的高效实现.PDFVIP

第33 卷第9 期 电 子 与 信 息 学 报 Vol.33No.9 2011 年9 月 Journal of Electronics Information Technology Sept. 2011 基于量化的LDPC 译码算法的高效实现 马 卓* 杜栓义 王新梅 (西安电子科技大学ISN 国家重点实验室 西安 710071) 摘 要：论文提出了一种采用2 维折线逼近的和积译码算法实现方案，避免了使用与量化比特数成指数关系增长的 查找表，降低了译码器的存储器消耗。基于上述方案提出了一种次小值修正的最小和算法。该算法通过3 个2 维折 线逼近对最小值进行修正，获得了逼近浮点和积算法的译码性能。算法的修正过程只包含简单的算术和逻辑运算， 便于FPGA 实现。 关键词：信道编码；低密度奇偶校验码；和积算法；最小和算法；量化 中图分类号：TN911.22 文献标识码： A 文章编号：1009-5896(2011)09-2273-05 DOI: 10.3724/SP.J.1146.2011.00041 Efficient Implementing of LDPC Decoding Algorithm Based on Quantization Ma Zhuo Du Shuan-yi Wang Xin-mei (The State Key Lab of Integrated Service Networks, Xidian University, Xi’an 710071, China) Abstract: An implementing scheme of sum-product algorithm is proposed based on 2-dimation broken line approach, which avoids the look-up table with size related to the exponential of the number of quantization bits and reduces the memory consumption of the decoder. Then, an algorithm called second-minimum value corrected min-sum algorithm is proposed based on the implementing scheme proposed above. The algorithm use three 2-dimension piecewise approach to correct the min-sum algorithm and its performance is very close to that of the floating point sum-product algorithm. The correction process of this algorithm just includes simple arithmetic and logic operations, which is easy to be implemented by FPGA. Key words: Channel coding; Low Density Parity-Check (LDPC) code; Sum-product algorithm; Min-sum algorithms; Quantization 1 引言 对于LDPC 译码算法的改进，一方面可以在保 低密度奇偶校验码(LDPC)码是一类由稀疏的