Low complexity spherical decoding algorithm for polar code based on cyclic redundancy check
Spherical decoding is an effective decoding algorithm to achieve the maximum likelihood decoding performance of polar codes.This paper proposes a scheme using cyclic redundancy check(CRC)to reduce the complexity of the sphere decoding algorithm of polar codes.The proposed algorithm uses the decoding result of SC decoding and then employs CRC check to fix some root nodes in the front position of the decoding order of spherical decoding,greatly reducing the number of search nodes and thereby lowering the complexity of the algorithm.The theoretical analysis of reduced complexity is con-ducted.The theoretical derivation and analysis of the proposed algorithm's complexity yield an analytical expression for the reduction in complexity,along with the relationship between the length of information bits and the length of fixed bits in re-lation to the complexity reduction.Simulation results demonstrate that the proposed algorithm can significantly reduce the complexity of sphere decoding while ensuring good performance.
万方数据
维普
