Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms (Q3482811)
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: Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms |
scientific article; zbMATH DE number 4153854
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms |
scientific article; zbMATH DE number 4153854 |
Statements
Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms (English)
0 references
1990
0 references
minimum number of complex multiplications
0 references
discrete Fourier transform
0 references
split-radix decompositions
0 references
multiplicative complexity
0 references
split-radix DFT- algorithms
0 references
0.8924256
0 references
0.8777579
0 references
0 references
0.86783934
0 references
0.8592624
0 references
0.85635835
0 references
0.85296184
0 references
