Method for reducing decoding time delay of polarization code

Abstract

The invention discloses a method for reducing decoding time delay of a polarization code. The method comprises that an initial value of a logarithm likelihood ratio is calculated; recursive traversal is carried out on a decoding tree; special nodes carry out decoding in the traversal process; non-special nodes use a verification matrix to reduce decoding time delay in the traversal process; and a final decoding result is selected according to cyclic redundancy check. In the process of recursive traversal of the decoding tree in polarization code decoding, the verification matrix of the polarization code is used for verification, recursive traversal is not carried out on sub-nodes any more when verification fails, the decoding time delay is reduced effectively, and determination via the verification matrix can be carried out with other steps simultaneously, so no extra decoding time delay is caused. The method of the invention can be used to reduce decoding time delay of a successive cancel method substantially; compared with a classic low-time-delay brief propagation decoding method, the time delay characteristic of the method in the invention can approach that of brief propagation decoding, and the method of the invention is better than brief propagation decoding in the aspects of error rate performance and computing complexity; and the higher the signal to noise ratio is, the more obviously the decoding time delay is reduced.

Description

technical field [0001] The invention belongs to the technical field of channel coding and decoding, and in particular relates to a low-time-delay improvement method of a polar code based on serial cancellation list decoding in a channel decoder of a communication system. Background technique [0002] Polar code is a new type of coding method. It is currently the only channel coding technology that can theoretically prove that it can reach the Shannon limit under binary discrete memoryless channels, and has practical linear complexity coding and decoding capabilities. It will become the next generation communication system (5G ) are strong candidates for channel coding schemes. Serial cancellation (SC, Successive Cancellation) decoding is a low-complexity decoding method, and serial cancellation list (SCL, Successive Cancellation List) decoding method can achieve better bit error rate performance. Serial cancellation decoding starts from the root node of the decoding tree, g...

AI Technical Summary

Problems solved by technology

However, compared with the classical low-latency Belief Propagation (BP, Belief Propagation) decoding method, there is still a big gap between the decoding method based on the serial cancellation list, and the decoding delay and computational complexity are high.

Images