FFT accelerator based on DSP chip

Abstract

The invention discloses an FFT accelerator based on a DSP chip. The accelerator comprises a mode configuring module, an FFT computing control module, a data access control module and an FFT computing module, wherein the mode configuring module is used for receiving the configuring data of a data address, a computing scale and computing times; when the computing scale is less than the maximum computing scale which can be directly supported, the FFT computing control module is used for controlling the FFT computing module to carry out the one-dimensional FFT computing; when the computing scale is greater than the maximum computing scale which can be directly supported, the FFT computing control module is used for controlling the FFT computing module to carry out the two-dimensional FFT computing; the data access control module is used for controlling the read of the computing data from a memory in a DMA manner and writing the computing result back to the memory; the FFT computing module is used for carrying out the FFT computing according to a control signal output by the FFT computing control module. The accelerator has the advantages that various configuring modes of the computing scale, the computing times and the data format can be supported, the FFT computing from the small scale to the large scale can be realized, the implementation effect is high, and the utilization ratio of hardware resources is high.

Description

technical field [0001] The invention relates to the technical field of FFT calculation in data processing, in particular to an FFT accelerator based on a DSP chip. Background technique [0002] DFT (Discrete Fourier Transformation, Discrete Fourier Transformation) is one of the indispensable tools in the field of digital signal processing. It transforms a signal from the time domain to the frequency domain, and is widely used in acoustics, images, radar, telecommunications and wireless signals. processing and other fields. FFT (Fast Fourier Transformation, Fast Fourier Transformation) is a fast implementation method of DFT. The appearance of FFT makes DFT more widely used in practical applications. The FFT algorithm uses complex exponential constants The characteristics of the signal sequence x(n) or X(k) are rearranged and decomposed into short sequence operations, and the complexity of DFT operations is changed from O(n 2 ) down to O(nlogn). [0003] In the field of r...

AI Technical Summary

Problems solved by technology

[0004] In the prior art, although some DSP chips provide FFT acceleration schemes, the maximum calculation scale supported is only 1K, which limits the application range of FFT accelerators, and usually only supports 32-bit fixed-point calculations. For the more commonly used IEEE-754 standard Floating point format does not provide support for

Images