Fast generalized Fourier transforms (Q1123578): 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 03:18, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast generalized Fourier transforms |
scientific article |
Statements
Fast generalized Fourier transforms (English)
0 references
1989
0 references
Computational complexity of the fast generalized Fourier transforms is discussed on the basis of the Wedderburn's structure theorem. In the sequel, the upper bound of the linear complexity is confidently estimated.
0 references
fast Fourier transforms
0 references
discrete Fourier transform
0 references
discrete Hadamard- Walsh transform
0 references
Computational complexity
0 references
Wedderburn's structure theorem
0 references
linear complexity
0 references
