Multi-parameter configurable Viterbi decoder with low resource consumption

Abstract

The invention relates to a multi-parameter configurable Viterbi decoder with low resource consumption. The multi-parameter configurable Viterbi decoder comprises an input configuration unit used for standardizing decoding inputs, a standard code calculation unit used for calculating standard recurrent codes, a branch metric calculation unit used for calculating branch metric values, a grid computation unit used for reconstructing a grid chart and calculating survival paths, a status metric storage and comparison unit, a survival path storage unit, and a backtracking unit used for reconstructing a decoding sequence according to the survival paths and the grid chart. The invention provides a recursive reuse method for the standard code calculation unit. The method comprises the following steps: enumerating four groups of status codes as standard code elements, calculating the standard recurrent codes of the standard code elements, sequentially overturning the highest five digits and the lowest digit of each standard code element, carrying out iterative computation of the standard recurrent codes of the standard code elements and the overturned bits, and obtaining the standard recurrent codes of all the status codes after the iterative computation has been carried out for six times. The method has the advantages that the standard code elements are reused for calculation, so that resource consumption is reduced.

Description

Technical field [0001] The present invention relates to channel decoding technology for wireless communication, in particular to a multi-parameter configurable Viterbi decoder with low resource consumption. Background technique [0002] In the channel decoding technology of wireless communication, probabilistic decoding is the best way to analyze the code sequence as the receiving end. In probabilistic decoding, the Viterbi decoding algorithm is the best probabilistic decoding algorithm for convolutional codes under additive Gaussian white noise channels. Since the Viterbi decoding algorithm was proposed, it has been widely used in channel error correction systems, such as mobile communications, satellite communications, digital TV, high-speed hard drives, etc. [0003] For different communication standards, the constraint length, code rate, and constraint polynomial of convolutional codes are different, and the corresponding Viterbi decoding algorithm parameters are also differen...

AI Technical Summary

Problems solved by technology

[0010] The technical problem to be solved by the present invention is: when the constraint length changes from small to large, the circuit complexity of the Viterbi decoder increases exponentially; in order to realize multi-parameter configurability, the state code and grid that can adapt to multiple constraint lengths are adopted Graph is the best solution; in order to achieve high throughput, adopting a fully parallel structure can greatly reduce path delay and improve decoding rate; but the problem brought by

Images