Fast generalized Fourier transforms (Q1123578)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4110058
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast generalized Fourier transforms |
scientific article; zbMATH DE number 4110058 |
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
0 references
0.93378377
0 references
0.9303228
0 references
0 references
0 references
