64-point fast fourier transform (FFT) calculator

Abstract

The invention discloses a 64-point fast Fourier transform (FFT) calculator, which comprises a data input module for inputting cache of data and preparing required data for the next module, a first-stage 8-point FFT operation sub module for sequentially performing 8-point FFT operation on the data output by the data input module for the first time, a multiplication functional module for multiplying a processed result of the first-stage 8-point FFT operation with a corresponding rotation factor, an inner data cache module for caching the data operated by the multiplication functional module, adjusting the sequence and preparing the required data for the next module, a second-stage 8-point FFT operation sub module for performing 8-point FFT operation on the data output by the inner data cache module again, a data output module for adjusting the sequence of the data output by the second-stage 8-point FFT operation sub module and outputting the data, and a main control module for generating enabling signal of the functional modules and controlling data transmission and signal transmission of the functional modules.

Description

technical field [0001] The invention relates to a digital signal processing technology, in particular to a multiplication-free 64-point FFT calculator. Background technique [0002] Discrete Fourier Transform (DFT) is a basic transformation in the field of digital signal processing, which has very important theoretical significance and practical application value. However, due to its large amount of calculation, it has not been really applied for a long time. Until 1965, J.W.Cooley and J.W.Tukey proposed a high-speed and effective algorithm for calculating DFT - Fast Fourier Transform (FFT), which greatly reduced the amount of DFT calculations. Only then has DFT been widely used in practice. At present, FFT technology has been widely used in communication, image processing, information system, control and instrumentation, geological exploration, aerospace, biomedicine and other fields. Among them, in the field of wireless communication, FFT, as a solution for modulation a...

AI Technical Summary

Problems solved by technology

At present, there are many implementation methods for FFT calculation devices for OFDM systems, but most of them use the traditional radix-2 or radix-4 FFT algorithm, which not only has a large number of cascaded butterfly units, but also consumes a large number of multipliers. As a result, the designed FFT computing device has shortcomings in terms of computing speed and hardware resource utilization, and there are still some gaps with the requirements of high-performance OFDM systems.

Images