摘要
多进制LDPC码是将二进制LDPC码推广到有限域GF(q),其校验矩阵的元素不再是(0,1),而是集合(0,1,…,q-1),译码仍然采用高效的基于置信度传播的迭代译码算法。这里主要推导了多进制译码算法的迭代公式,分析证明了基于快速傅里叶变换(FFT)理论的改进算法,最后通过仿真手段验证和分析了基于FFT的多进制译码算法的优越性能。
Non-binary LDPC codes are obtained by generalizing binary LDPC coeds from finite field GF(2) to finite field GF(q).Its elements of parity check matrix are not(0,1),but ensemble(0,1,…,q-1),and its decoding method still employs belief propagation and iterative algorithm.This paper mainly derives the iterative formulas of decoding algorithm for Non-Binary LDPC codes and analyzes an improved algorithm based on FFT.Finally,the predominant performance of FFT decoding algorithm is verified by simulation.
出处
《通信技术》
2011年第5期21-23,共3页
Communications Technology