Mixed node multi-bit processing polarization code decoding method

Abstract

The present invention discloses a mixed node multi-bit processing polarization code decoding method. The method comprises the following steps of: 1) configuring decoding parameters; 2) determining themaximum order number required by decoding; 3) determining the type of each node in each decoding phase according a vector p; 4) preferentially performing hard decision of 0 rate node and 1 rate node;5) determining the type of the sub nodes of the mixed node and performing decoding; and 6) outputting a complete decoding result u:{u1, ...uN} according to decoding result of each node in the step 4)and the step 5). The method provided by the invention can improve the decoding speed of the polarization code on the premise without loss of the decoding error correction performance.

Description

technical field [0001] The invention belongs to the technical field of digital communication, and relates to channel decoding technology, in particular to a multibit decoding method (Multibit-Decoding on Simplified Successive-Cancellation, MD-SSC for short), specifically a polar code decoding method for mixed node multi-bit processing. Background technique [0002] The polar code proposed by Arikan in 2009 is the first FEC code that can achieve channel capacity. The serial cancellation (SC) decoding algorithm of polar codes has strong regularity, low complexity, and is easy to implement in hardware. It has been a research hotspot since it was proposed. Ido Tal and Alexander Vardy proposed a serial cancellation list decoding algorithm (Successive cancellation list, referred to as SCL) based on the SC decoding method, and its decoding performance is very close to the maximum likelihood decoding; Niu Kai and Chen Kai proposed based on the SCL algorithm Cyclic Redundancy Check...

AI Technical Summary

Problems solved by technology

In practical applications, in order to improve the error correction performance of coding, the length of the code word is generally more than 2 to the 10th power, and the SC decoding algorithm has the problem that the longer the code word is, the higher the decoding delay is, resulting in the throughput rate of the polar code. Low, which limits the practicability of polar codes and is difficult to promote and use

In order to reduce the decoding delay of the SC algorithm, Alamdar-Yazdi et al. proposed an SSC decoding algorithm based on the concept of partial codes. SSC classifies 0-rate nodes and 1-rate nodes according to the partial codes. These two nodes do not have to wait for the previous bit. The decoding result is directly decoded by the hard decision method. This method reduces the decoding delay and also reduces the complexity of the algorithm. However, in the decoding process of this method, there are still a large number of unclassified nodes in addition to the 0 and 1 rate nodes. , especially unclassified nodes whose leaf nodes are frozen bits and information bits respectively

In the SSC algorithm, these unclassified nodes will degrade into the SC algorithm, and there is still a large decoding delay

Images