欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
为了减少置信度传播译码算法的计算复杂度,提出了一种改进的置信度传播译码算法.该算法在节点更新时,利用等误差的线性近似函数来代替算法中的双曲函数,相比于原始的置信度传播译码算法,改进的算法仅仅需要乘法和加法运算,因此大大降低了算法的计算复杂度,更易于硬件实现.仿真结果表明,在低信噪比时,改进的置信度传播译码算法的性能与原始BP译码算法的性能几乎相同,在高信噪比时,改进的置信度传播译码算法的性能比原始置信度传播译码算法的性能略差,在码长为256,误码率是10-6时,改进的置信度传播译码算法的误码率性能比原始的置信度传播译码算法退化了0.1dB.
英文摘要：
In the decoding algorithm for Polar codes, the belief propagation （BP） decoding algorithm in the log- likelihood ratio domain incurs high computation complexity due to the computation of the hyperbolic functions Motivated by this observation we propose an improved BP decoding algorithm. In the node update rules, our method replaces the hyperbolic functions with the linear approximation functions based on the principle of equal error. Compared with the original BP decoding algorithm, the modified BP decoding algorithm is only implemented by addition and multiplication operations, which greatly reduces computation complexity, and simplifies hardware implementation. Simulation results show that the performance of the modified BP decoding algorithm is almost the same as that of the original BP decoding algorithm in the low Signal to Noise Ratio （SNR） region, and in the high SNR region the performance of our method is slightly worse. Compared with the original BP decoding algorithm, the bit error rate （BER） performance of the modified BP decoding algorithm has about 0. 1 dB degradation when the length of Polar codes is 256 and the BER is 10-6 .
同期刊论文项目
同项目期刊论文
期刊信息
位置：