First moment-based convolver

Abstract

The invention discloses a first moment-based convolver, and belongs to the field of processing a digital signal. A convolution kernel sequence data value and a sequence number are counted in advance and are used as a control signal of the subsequent calculation; the cyclic convolution calculation is converted into the operation containing little displacement and add operation; and a high-efficiency digital signal convolution calculator which is simple in structure and is suitable for any length and data distribution range can be designed. In the convolution calculation, the introduction of trigonometric function and complex number calculation is avoided, and the calculation precision is improved; the requirements of the existing rapid convolver on a multiplier or large capacity storage resources can be conquered; the limit on the length when the convolution is calculated is eliminated; and the hardware resource occupancy is reduced, the power consumption is reduced, and higher calculation speed can be kept.

Description

technical field [0001] The invention relates to the field of convolution and related calculation of digital signal processing, especially for the field of finite-length circular convolution and related non-multiplication calculation and its VLSI (Very Large Scale Integrated Circuit) design. Background technique [0002] Convolution operations and correlation function operations are the most basic and commonly used calculations in digital signal processing. Due to their high computational complexity, they affect the performance of real-time signal processing to a certain extent. Therefore, how to improve its operation speed and reduce hardware resource requirements while maintaining low power consumption has very important theoretical and practical values ​​in digital signal processing. Existing efficient algorithms and hardware structures can be roughly divided into the following four categories: [0003] (1) Calculation method based on fast Fourier transform [0004] Sinc...

AI Technical Summary

Problems solved by technology

[0005] Disadvantages: After adding the Fourier transform link, the calculation of trigonometric functions and complex numbers is introduced, and the truncation error of the data after two positive and negative Fourier transforms reduces the accuracy of the final result; there are still a lot of multiplications in the calculation process, High complexity; various fast Fourier transform algorithms have corresponding requirements for convolution length, lack of versatility

[0008] Disadvantages: There are still a large number of multiplication operations in these calculations; the calculation structure is complex; most structures can only be used for situations where the data length can be decomposed into specific value products, lacking versatility

[0011] Disadvantages: using this structure to directly calculate the convolution, the amount of calculation is large; combined with the fast convolution algorithm, there is also a complex structure, length restrictions on convolution and related calculations, lack of versatility, and large hardware resource consumption

[0016] Disadvantage: The memory size required to store the processed convolution kernel sequence and related kernel sequence increases exponentially with the number of calculation points

[0018] Disadvantages: When the convolution length is large, the required many-to-one address decoder design is more complicated, and the storage resource requirement is still huge

[0020] Disadvantages: This algorithm can only be applied when the convolution length is a non-prime number, and when the convolution length is the product of large prime numbers, the storage resource requirement is large

Images