Improved polar code serial elimination list bit flipping decoding method and improved polar code serial elimination list bit flipping decoding system

Abstract

The invention relates to the technical field of mobile communication, in particular to an improved polar code serial elimination list bit flipping decoding method and system, and the method comprisesthe steps: inputting an initialized log likelihood ratio LLR into a decoder for decoder path selection, and screening out L paths for CRC verification; determining a fixed key flipping index set SCSS,and determining an improved key flipping index set ICSS according to a threshold of simulation statistics; if the bit index in the decoding process belongs to the ICSS, performing bit flipping to obtain L paths after bit flipping; performing CRC (cyclic redundancy check) on the L paths after bit flipping, and if the L paths pass the CRC, determining that decoding succeeds; and if the CRC is not passed, changing the bit flipping index, and returning to the decoding iteration process. According to the method, the number of elements in the key flipping index set is reduced in a threshold segmentation mode, and the key flipping index set is optimized.

Description

technical field [0001] The invention relates to the technical field of mobile communication, in particular to an improved polar code serial elimination list bit flip decoding method and system. Background technique [0002] In a communication transmission system, the information to be transmitted is usually encoded to improve the reliability of data transmission and ensure the quality of communication. In 2009, the polar code proposed by E.Arikan became another major theoretical breakthrough in the field of channel coding. It is the first kind of polar code with a definite construction method that has been proven to work under the binary discrete memoryless channel (Binary Discrete Memoryless Channel, BDMC). A channel coding method that reaches the Shannon limit, and a serial elimination (Successive Cancellation, SC) decoding scheme is proposed. The SC decoding scheme proposed by E. Arikan has good performance in long codes, but in short and medium codes, its performance is...

AI Technical Summary

Problems solved by technology

The above decoding schemes are all based on SC decoding. The SC decoding scheme can be regarded as a recursive process of the leaf nodes of a tree. When the SC decoding fails, it is because one or more of the leaf nodes are incorrect. bit estimates, which are actually due to the serial decoding nature of the SC decoding scheme, leading to more incorrect estimates

Images