论文部分内容阅读
提出了改进Polar码的最小和译码算法,修正了最小和译码算法中的节点更新公式,即利用分段线性函数来逼近置信度传播译码算法中的函数lncosh(x).相比于最小和译码算法,改进的算法在增加少许复杂度的情况下,增强了译码性能.相比于置信度传播译码算法,该算法在几乎不损失性能的情况下,大大降低了算法的计算复杂度,更易于硬件实现.该算法是基于最小和算法和置信度传播算法提出的,是在复杂度和性能上的一种折中.仿真结果表明,改进的最小和译码算法与置信度传播译码算法的性能几乎相同,比最小和译码算法的性能好.
The minimum and decoding algorithms for improving Polar codes are proposed, and the node update formula in minimum and decoding algorithms is modified, ie, the function lncosh (x) in the belief propagation propagation algorithm is approximated by piecewise linear functions. Minimum and decoding algorithms, the improved algorithm enhances the decoding performance under the condition of adding a little complexity.Compared with the belief propagation decoding algorithm, the algorithm greatly reduces the performance of the algorithm with little loss of performance Which makes it easy to implement in hardware.It is a compromise between complexity and performance based on minimum and algorithm and confidence propagation algorithm.The simulation results show that the improved algorithm of minimum and decoding and confidence Propagation-decoding algorithms have almost the same performance and perform better than the smallest decoding algorithm.