Decoding method and device, decoder

Abstract

The present application provides a decoding method and device, and a decoder. The method includes: determining the information bit set according to the information bit quantity K of the information to be decoded and the target code length N, and determining the key set according to the information bit set, K and N, and the probability that the key set contains the decoding first error position bit is greater than the second A threshold value, the key set is a subset of the information bit set. The information to be decoded is polarized and decoded according to the key set and preset rules. The preset rule is: split the decoding path for the information bits in the key set, make bit-by-bit judgments for the information bits outside the key set, and generate a decoding When the total number of decoding paths exceeds the preset path width L, select the L paths with the largest PM value to save and continue to develop the decoding path. According to the decoding path of each level of decoding bits, each level The decoded result of the decoded bits. Therefore, the computational complexity and the decoding delay caused by sorting are reduced.

Description

technical field [0001] The present application relates to the technical field of communications, and in particular to a decoding method, device, and decoder. Background technique [0002] Communication systems usually use channel coding to improve the reliability of data transmission and ensure the quality of communication. Polar (polarization) codes are the first channel coding method that can be proved theoretically to "reach" the channel capacity. Polar code is a linear block code whose generator matrix is ​​G N , whose encoding process is is a binary row vector with a length of N (that is, the code length); and here B N is an N×N transposition matrix, such as a bit-reversed transposition matrix; defined as log 2 N matrix F 2 The Kronecker product of x 1 N is the coded bit (also called codeword), with generator matrix G N After multiplication, the encoded bits are obtained, and the multiplication process is the encoding process. In the encoding process...

AI Technical Summary

Problems solved by technology

[0004] In practical applications, the number of decoding bits is very large. Using the SCL decoding method, for each decoding bit, it is necessary to calculate the PM value of all paths under each decoding bit, and for all paths according to the PM value Perform a sort, its computational complexity and decoding delay due to sorting are very high

Images