Nesting strategies for prime factor FFT algorithms (Q1825020)
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: Nesting strategies for prime factor FFT algorithms |
scientific article; zbMATH DE number 4119586
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nesting strategies for prime factor FFT algorithms |
scientific article; zbMATH DE number 4119586 |
Statements
Nesting strategies for prime factor FFT algorithms (English)
0 references
1989
0 references
The author points out that the use of nesting techniques can perform the prime factor FFT in-place and is able to implement by a minimum number of floating-point operations.
0 references
prime factor FFT algorithm
0 references
minimum operation count
0 references
nesting techniques
0 references
in-place
0 references
