Abstract: Low-Density Parity-Check(LDPC) codes are typical of preeminent performance approaching Shannon’s capacity limit. This paper studies the LDPC codes min-sum decoding algorithm, and a min-sum algorithm in QPSK modulation based on integer operation is proposed for decoding LDPC codes. All the variables are fixed length integers in this algorithm, so it is very convenient for hardware implementation. Simulation results show that its performance is close to that of sum-product algorithm whose variables are high precision floating point numbers.

Key words: Low-Density Parity-Check(LDPC) codes, QPSK modulation, min-sum algorithm, integer operation

摘要： 低密度奇偶校验码(LDPC码)具有逼近香农限的优良性质。基于此，对LDPC码在QPSK调制下的最小和译码算法进行研究，提出一种基于整数运算的最小和译码算法，算法中所有变量都用固定长度的整数表示，便于硬件实现。仿真实验证明，该算法的性能与基于高精度浮点数的和积译码算法接近。

关键词: 低密度奇偶校验码, QPSK调制, 最小和算法, 整数运算

CLC Number: 

• TN911.22