Method for efficiently computing a fast fourier transform
US7062523B1 · kind B1 · utility
22Cited by
13References
9Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Aug 1, 2000 |
| Grant date | Jun 13, 2006 |
| Priority date | — |
| Expiry date | May 26, 2022 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F17/142
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method for computing an out of place FFT in which each stage of the FFT has an identical signal flow geometry. In each stage of the presently disclosed FFT method the group loop has been eliminated, the twiddle factor data is stored in bit-reversed manner, and the output data values are stored with a unity stride.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.