How to perform belief propagation, computer program products, non-temporary information storage media, and polar code decoders

摘要

To perform belief propagation within the scope of decoding the polar code, the polar code is based on the structure of L partial polarization stages of N / 2 parallel kernels _{Ki, j} , and the kernel at each partial polarization stage. is the shuffler, is separated from the vicinity of the kernel, the decoder is to calculate the kernel _{K i,} the value of the improved performance index M for each _j M (i, j) and (S501), the kernel, M ( Sorting in the list L in descending order of i, j) (S502) is executed. The decoder then updates the output beliefs for the W higher kernels in the list L (S503) and uses these output beliefs as the input beliefs of the neighboring kernels of the W higher kernels as follows: Propagation, updating the output beliefs of each neighboring kernel of W higher kernels following the update of those input beliefs (S504), and the performance improvement index value M (i, j) for each neighboring kernel. ) Is recalculated (S505), the performance improvement index M is set to a null value for W higher kernels (S505), and the kernels are rearranged in the list L (S506). Perform a belief propagation iterative process. The decoder then repeats the belief propagation iterative process until the stop condition is met.