Fast computation of discrete Fourier transforms using polynomial transforms (Q3886825): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:14, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast computation of discrete Fourier transforms using polynomial transforms |
scientific article |
Statements
Fast computation of discrete Fourier transforms using polynomial transforms (English)
0 references
1979
0 references
fast Fourier transform
0 references
Winograd Fourier Transform
0 references
minimum number of operations
0 references
efficient algorithms
0 references
two-dimensional discrete Fourier transform
0 references
polynomial transforms
0 references
Winograd's method
0 references
tables
0 references
flow-charts
0 references
short-length algorithms
0 references
