A low-latency and high-reliability polar code fast decoding method and decoder

Abstract

The invention discloses a polar code fast decoding method and a decoder with low delay and high reliability; step 1, according to the distribution of polar code information bits and frozen bits, the node meeting the condition is regarded as a Rate-1 node; step 2 , according to the traditional SC decoding butterfly graph f, g node calculation sequence, update the logarithmic likelihood ratio information layer by layer; Step 3, for the length of the code group, f, g nodes calculate to m i layer, judge the type of the code group, if it is a Rate-1 node, go to step 4; otherwise go to step 5; step 4, select the bits at relatively unreliable positions in the node to perform path extension; step 5, perform path extension on all information bits in the code group Carry out path expansion; Step 6, sort the path metrics from small to large, select the L corresponding paths with the smallest path metrics to keep; Step 7, update the part and calculate; Step 8, return to Step 2, until all bit decoding is completed. The invention reduces the decoding time delay and proposes a hardware platform with low logic resource consumption.

Description

technical field [0001] The invention belongs to the communication field, and in particular relates to a polar code fast decoding method and a decoder with low delay and high reliability. Background technique [0002] In 2009, E. Arikan proposed a new channel coding method - polar code, that is, polar code. Polar codes are currently the only channel coding that has been proven to achieve channel capacity. Compared with traditional LDPC codes, polar codes have lower coding and decoding complexity and better coding and decoding performance. Therefore, polar codes have great research value and practical value, and in the 3GPP meeting, polar codes have been determined as the control channel coding scheme for eMBB (enhanced mobile broadband) scenarios in 5G. It can be seen that the application prospect of polar codes is very broad and has the potential for further research. [0003] Since the polar code was proposed in 2009, many scholars at home and abroad have carried out rese...

AI Technical Summary

Problems solved by technology

[0004] However, the SCL decoding algorithm is a bit-by-bit serial output algorithm, so the decoding delay is relatively large. In order to reduce the time complexity of the algorithm, some scholars have made further improvements and proposed a simplified multi-bit continuous list deletion ( Simplified Multi-bit Successive Cancellation List (SMSCL)) algorithm [Han J., Liu R, Wang R. Simplified multi-bit SC list decoding for polar codes [C]. IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE, 2016, 996 –1000.], but for a higher code rate, when there are more continuous information bits, the degree of decoding delay reduction will be greatly reduced

Images