CVA-based tail-biting convolutional code channel decoding method

Abstract

The invention claims a CVA-based tail-biting convolutional code channel decoding method, which relates to the field of mobile communication technology. In order to reduce the decoding complexity and increase the decoding efficiency, the present invention proposes a decoding algorithm based on the Circular Viterbi Algorithm (CVA). The decoding start position of the highest reliability is determinedbased on the likelihood ratio information of a received information sequence. The Viterbi decoding is modified from the start position, by adding a comparison and selection process, impossible statepositions are deleted, and after several iterations of search, less surviving states converge in surviving paths, the state of the largest measurement value is selected as the start position of the final decoding, and a decoding result is estimated according to its corresponding surviving path. The algorithm has a faster convergence speed, the decoding efficiency is further improved, and the decoding delay is reduced.

Description

technical field [0001] The invention belongs to the technical field of channel coding and decoding of mobile communication, and in particular relates to a tail-biting convolution code decoding method of PBCH decoding in LTE. Background technique [0002] With the development of communication technology, digital communication gradually replaces analog communication and becomes the mainstream of communication technology. However, when digital information is transmitted in the channel, it will be disturbed by noise, and the generation of bit errors is always inevitable. In order to achieve a certain bit error rate index under the known signal-to-noise ratio, on the basis of rationally designing the baseband signal, selecting the modulation and demodulation method, and adopting frequency domain equalization or time domain equalization measures, error control should also be adopted. Encoding and other channel coding techniques further reduce the bit error rate. Convolutional co...

AI Technical Summary

Problems solved by technology

[0005] Although tail-biting convolutional codes have many advantages, for the decoder, the optimal decoding scheme based on the Viterbi algorithm is too complicated to realize because the decoder does not know the start state and end state of the decoding. The decoding method may have detected the optimal tail-biting path before reaching the maximum number of iterations, and the redundant iterations cause the decoding delay to be prolonged and resources to be wasted

At present, there is no practical optimal decoding scheme based on cyclic Viterbi algorithm. Based on the above problems, the present invention designs a channel decoding method based on CVA for tail-biting convolutional codes, which is suitable for practical engineering applications.

Images