Fast fourier transform circuit having partitioned memory for minimal latency during in-place computation
A Fourier transform, fast technology, applied in calculation, complex mathematical operations, electrical digital data processing, etc., can solve the problems of reducing the performance of fast Fourier transform circuits, inefficient use of storage, and increasing circuit costs
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0024] FIG. 1 is a schematic diagram of a FFT circuit 10 configured to perform FFT or inverse FFT on a prescribed number of data values (data value) according to an embodiment of the present invention. The fast Fourier transform circuit 10 includes a base four (Radix-4) butterfly unit 12 (butterfly element), a memory controller 14 (memory controller) and several memory portions (memory portion), which can also be called a memory bank. (memorybank) 16a and 16b.
[0025] The radix-4 butterfly unit 12 is configured to simultaneously receive four inputs (A1, A2, B1, B2) and generate and simultaneously output four calculation results (A'1, A'2, B'1, B '2), which is based on the known radix-four butterfly operation to perform Fast Fourier Transform calculations.
[0026] The storage parts 16a and 16b are configured to store equal portions of a prescribed number of data values for in-place computation operations. Specifically, assuming that a 64-point FFT is generated, each sto...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 