Five-step FFT algorithm with reduced computational complexity (Q845949): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An Algorithm for the Machine Calculation of Complex Fourier Series / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Fourier transforms: A tutorial review and a state of the art / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2778805 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multiprocessor FFTs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A comparison of optimal FFTs on torus and hypercube multicomputers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A parallel 1-D FFT algorithm for the Hitachi SR8000 / rank | |||
Normal rank | |||
Latest revision as of 10:59, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Five-step FFT algorithm with reduced computational complexity |
scientific article |
Statements
Five-step FFT algorithm with reduced computational complexity (English)
0 references
29 January 2010
0 references
five-step fast Fourier transform
0 references
computational complexity
0 references
