A new set of minimum-add small-n rotated DFT modules (Q1098609)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4039242
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new set of minimum-add small-n rotated DFT modules |
scientific article; zbMATH DE number 4039242 |
Statements
A new set of minimum-add small-n rotated DFT modules (English)
0 references
1988
0 references
This self-sorting, in-place FFT (fast Fourier transform) on complex data consists of small discrete Fourier transform modules dealing with mutually prime number of data and with an optional rotation of the results. This algorithm requires almost the same number of mathematical operations as that in Winograd's algorithm, although the number of additions is reduced in some cases.
0 references
self-sorting, in-place Fourier transform
0 references
discrete Fourier transform
0 references
mutually prime number of data
0 references
algorithm
0 references
Winograd's algorithm
0 references
0.8223980069160461
0 references
0.8161497116088867
0 references
0.8132970333099365
0 references
0.7894588708877563
0 references
0.7718254923820496
0 references
