Method and device for decoding dynamic Viterbi

Abstract

The invention discloses a method for decoding dynamic Viterbi, comprising the following steps: using set parameter values to decode an existing receiving sequence based on a Viterbi algorithm to acquire decoding, wherein the parameter values comprise memory depth and / memory width, and the memory depth represents backtracking span of arrow diagrams in the Viterbi algorithm and / or the memory width represents branch metric of the arrow diagrams in the Viterbi algorithm; adjusting the parameter values in the range of adjustment lower limit and adjustment upper limit; and using the Viterbi algorithm which is used for adjusting the parameter values to decode the next receiving sequence. The invention also discloses a device for decoding dynamic Viterbi. According to the invention, decoding parameters can be adjusted dynamically in accordance with the condition of existing interchannel noise, the decoding performance of the Viterbi can be exerted maximally, the error rate is reduced effectively, and the effective utilization of the resources can be ensured at the same time.

Description

Technical field [0001] The invention relates to a digital signal processing technology, in particular to a dynamic Viterbi decoding method and device. Background technique [0002] In modern digital communication, in order to reduce the error rate of data transmission and improve the quality and reliability of communication, error correction coding technology is often used in communication systems. Among them, convolutional codes are a kind of error correction ability with strong error correction ability. Wrong code. Because the Viterbi algorithm, the decoding algorithm of convolutional codes, is easier to implement and can obtain larger coding gains, convolutional codes based on the Viterbi decoding algorithm have been widely used. [0003] Convolutional code was proposed by Ellis in 1955. It is different from linear block code. In convolutional code encoding, the nk check elements of this group are not only related to the k information elements of this group, but also related to...

AI Technical Summary

Problems solved by technology

[0006] The traditional Viterbi algorithm has to wait for all the receiving sequences to develop on the grid vector graph to the last moment Tn before starting to backtrack. Its disadvantage is that the complexity of the algorithm will increase with the increase of the constraint length. rapidly increase

However, since the source sequence using convolutional coding in the actual communication system may be very long, if you have to wait for all the receiving sequences to develop on the grid vector graph to the last moment Tn before you can start backtracking, it will cause The delay is very large; the existing technology usually uses a truncated backtracking method, which fixes a backtracking length, and starts backtracking when the backtracking length is reached

However, backtracking with a fixed backtracking length cannot be adjusted according to channel interference and actual transmission quality, which will lead to waste of decoding resources or decoding errors, making it difficult to adapt to the current increasingly higher transmission rate requirements.

Images