A channel decoding method and decoder

Abstract

The embodiment of the present invention discloses a new channel decoding method and decoder, which are used in the field of information technology. Aiming at the deficiencies in the decoding method of tail-biting convolutional codes in the prior art, an improved tail-biting convolutional code is proposed The product code decoding method is based on the idea of ​​Circular Viterbi Algorithm (CVA) to find the optimal decoding output through multiple iterations. During the decoding process, the method can detect whether there is a cycle, so as to end the iteration adaptively; the new algorithm greatly improves the decoding efficiency and reduces the decoding complexity. Compared with the prior art, the new decoding method and decoder of the embodiment of the present invention significantly reduce the decoding complexity, reduce the number of iterations, and save the storage space in the decoding process; the new channel decoding The method and decoder are effective not only for tail-biting convolutional codes, but also for ordinary block codes which can be represented by tail-biting trellis graphs.

Description

technical field [0001] The invention relates to the field of information technology, in particular to a channel decoding method and a decoder. Background technique [0002] In the existing and next-generation mobile communication network systems, in order to ensure the reliable transmission of data and control signaling, tail-biting convolutional codes are widely used in various mobile communication systems as a high-efficiency coding scheme. From the early IS-54 to the current EDGE, WiMax and LTE, tail-biting convolutional codes are used. The reason why tail-biting convolutional codes can be so widely used is mainly because tail-biting coding can effectively avoid the code rate loss caused by initializing the encoder with known bits, especially when the information sequence is very short , this loss is higher. For example, the broadcast channel in LTE has a total of 40 bits after the cyclic redundancy check bits are added. If the tail-biting method is not used for encodin...

AI Technical Summary

Problems solved by technology

However, this method of decoding and detection iteration has the following two disadvantages: (1) too many intermediate results need to be stored, and a large number of calculations are required to determine whether there is a cycle in decoding; (2) a special backtracking algorithm is required to get the final decoding result, which increases the decoding delay

[0005] In response to this situation, some people also proposed the WAVA algorithm (Wrap Around Viterbi Algorithm), which applies a simple termination condition (STC, Simple Termination Condition): the maximum likelihood path (MLP, Maximum Likelihood Path) is obtained in the first cycle and is also Stop iteration when tail biting path, but this algorithm mainly has the following disadvantages: (1) For the case where the algorithm finds the maximum likelihood tail biting path (MLTBP, Maximum Likelihood Tail BitingPath) in later iterations, this condition will be invalid, so A large number of invalid iterations will be generated; (1) The Sufficient Termination Condition (Sufficient Termination Condition) used in the algorithm needs to update the net increment of some states at the end of each iteration, these states are from the first iteration to A state that has not been passed by a tail-biting path so far in the current iteration

These operations increase decoding complexity and storage space

Images