A Generalized Prime Factor FFT Algorithm for any $N = 2^p 3^q 5^r $ (Q3992213)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Generalized Prime Factor FFT Algorithm for any $N = 2^p 3^q 5^r $ |
scientific article; zbMATH DE number 39241
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Generalized Prime Factor FFT Algorithm for any $N = 2^p 3^q 5^r $ |
scientific article; zbMATH DE number 39241 |
Statements
A Generalized Prime Factor FFT Algorithm for any $N = 2^p 3^q 5^r $ (English)
0 references
13 August 1992
0 references
prime factor fast Fourier transform
0 references
self-sorting
0 references
in-place
0 references
Cooley-Tukey algorithm
0 references
prime factor algorithm
0 references
0.88932264
0 references
0.8769668
0 references
0.85529727
0 references
0.84682226
0 references
0.8422426
0 references
0.8415538
0 references
0.84110725
0 references
