The multiplicative complexity of the discrete Fourier transform (Q1060552): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:04, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The multiplicative complexity of the discrete Fourier transform |
scientific article |
Statements
The multiplicative complexity of the discrete Fourier transform (English)
0 references
1984
0 references
We show how to compute the multiplicative complexity of the discrete Fourier transform on any set of data points.
0 references
minimal algorithms
0 references
multiplicative complexity
0 references
discrete Fourier transform
0 references
