欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
针对对数域和积LDPC（Low Density Parity Check Codes）译码算法复杂度高和译码采用的SMP（Standard Message Passing）调度算法收敛速度慢的问题，提出基于RMP（Row Message Passing）调度的简化差分域LDPC译码算法.用RMP调度优化变量节点信息更新使收敛速度提高一倍.由于在Tanner图上传递的是概率的差分值，并且在校验节点信息更新时选择w个绝对值最小的差分值进行，降低了算法复杂度.实验表明本文算法在不降低译码性能条件下降低了算法复杂度，提高了算法收敛速度．
英文摘要：
As for the problems of the high complexity of LogDomain sumproduct LDPC decoding algorithm and the slow convergence rate based on SMP scheduling, this paper propose the simplified differencedomain LDPC decoding algorithm based on RMP scheduling.The update of variablenodes are optimized by RMP scheduling,which can accelerate the convergence rate one time. Due to that the messages pass on the Tanner graph are probability differences and the update of checknodes are carried out by w minimum absolute values, which can further reduce the complexity of computation.In contrast with decoding algorithm by experiment show that the proposed algorithm can reduce the complexity of computation and accelerate the convergence rate, while it has no obvious loss of decoding performance.
同期刊论文项目
同项目期刊论文
Deterministic Process Based Generative Models for Characterizing Packet-Level Bursty Error Sequences
期刊信息
位置：