摘要
针对随机构造多进制LDPC码编码复杂度高的问题,基于具有线性编码复杂度的迭代编码算法,提出一种改进的多进制LDPC码的扩展比特填充构造算法.该算法通过改进编码方案和构造校验矩阵降低系统复杂度.经计算机仿真对比采用EBF算法和采用改进EBF算法的多进制编码系统的误码率,结果表明,改进后的多进制EBF算法所构造出的LDPC码,不仅具有线性的编码复杂度,且有较强的纠错能力.
To target the problem of high encoding complexity in Q-ary LDPC codes constructed by a randomly constructed algorithm, an extended bit-filling （EBF） algorithm of Q-ary low-density parity-cheek （ LDPC ） codes based on iterative encoding algorithm with linear operation complexity is proposed. The algorithm lowered the en-coding complexity through improving the encoding scheme and the construction of the parity-check matrix. The bit error rate of coding modulation systems based EBF and the improved EBF were compared using computer simula-tion. The simulation results indicate that the Q-ary LDPC codes constructed by the improved EBF algorithm pos-sess not only linear encoding complexity but also strong error correction capability.
出处
《深圳大学学报（理工版）》
EI
CAS
北大核心
2013年第1期66-71,共6页
Journal of Shenzhen University(Science and Engineering)
基金
国防预研基金资助项目(401***102)~~
关键词
通信与信息系统
扩展比特填充算法
迭代编码
下三角结构
低密度奇偶校验码
多进制
communication and information system
extended bit-filling algorithm
iterative encoding
lowertriangular form
low-density parity-check
Q-ary
