Fast Fourier converter, reverse fast Fourier converter and method thereof
A converter and fast technology, applied in the field of fast Fourier converters, can solve the problems of large hardware overhead and achieve the effects of less processing time delay, high computing efficiency, and less hardware resource overhead
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0047] Reference will now be made in detail to the disclosed exemplary embodiments, many of which are shown in the accompanying drawings, in which case it should be noted that like reference numerals are used throughout to designate like or like elements.
[0048] According to an exemplary embodiment of the present invention, the present invention provides a FFT and an inverse FFT for a 3,780-point FFT operation and a method thereof. The FFT decomposes the 3,780-point FFT operation into fewer FFT operations, and reorders the results of the transformation calculation and multiplies them by appropriate twiddle factors at appropriate positions in the transformation calculation process to efficiently Complete 3,780-point Fast Fourier Transform operations. Accordingly, the provided FFT with 3,780 points of FFT operation has a full pipeline structure and can realize full pipeline processing, so it has higher computing efficiency, less processing time delay and less hardware resource...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 