Method for computing fast Fourier transform and inverse fast Fourier transform
US6938064B1 · kind B1 · utility
4Cited by
6References
44Claims
0Family size
Assignees
Inventors
Key dates
| Filing date | Dec 7, 1998 |
| Grant date | Aug 30, 2005 |
| Priority date | — |
| Expiry date | Dec 7, 2018 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F17/142
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method of calculating the fast Fourier transform or the inverse fast Fourier transform of a series of N real samples x(n), with N power of two, operating according to a time interleaving algorithm and providing the sample series X(n) in ascending order to index n and using limited calculating storage means. A method of calculating the fast Fourier transform or the inverse fast Fourier transform of a series of N conjugated complex samples X(n), with N power of two, operating according to a frequency interleaving algorithm.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.