Four easy ways to a faster FFT (Q1868495)
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 1901546
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Four easy ways to a faster FFT |
scientific article; zbMATH DE number 1901546 |
Statements
Four easy ways to a faster FFT (English)
0 references
27 April 2003
0 references
performance analysis and evaluation
0 references
signal and image processing
0 references
FFT
0 references
array algebra
0 references
linear transformations
0 references
radix n
0 references
MOA
0 references
Psi calculus
0 references
shape polymorphism
0 references
shapes
0 references
fast Fourier transform
0 references
algorithms
0 references
0.8056801557540894
0 references
0.7914179563522339
0 references
0.7898851633071899
0 references
0.7852017283439636
0 references
