Modified Winograd FFT algorithm and its variants for transform size \(N=p^ k\) and their implementations (Q1823640)
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: Publication:1823640 |
scientific article; zbMATH DE number 4115911
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Modified Winograd FFT algorithm and its variants for transform size \(N=p^ k\) and their implementations |
scientific article; zbMATH DE number 4115911 |
Statements
Modified Winograd FFT algorithm and its variants for transform size \(N=p^ k\) and their implementations (English)
0 references
1989
0 references
The present paper is the continuation of a program, initiated by the authors [IEEE Trans. Acoust. Speech Signal Process (to appear)]. They propose two FFT-algorithms with highly structured data flow and transformation size \(N=p^ 2\), where p is an odd prime. One algorithm is suited for parallel computing while the other one with a better operational count is suited for conventional serial machines. The operational counts of these algorithms are close to those of Winograd's algorithm, but the better structure simplifies their implementations.
0 references
fast Fourier transform
0 references
FFT-algorithms
0 references
parallel computing
0 references
Winograd's algorithm
0 references
0.8492375612258911
0 references
0.8220930695533752
0 references
0.8021125793457031
0 references
