Improved upper complexity bounds for the discrete Fourier transform (Q811112)
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 4215337
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved upper complexity bounds for the discrete Fourier transform |
scientific article; zbMATH DE number 4215337 |
Statements
Improved upper complexity bounds for the discrete Fourier transform (English)
0 references
1991
0 references
By investigating several classical fast Fourier transform algorithms, this paper evaluates the upper bounds \(L_ 2(G)|_{\max}\), such that \(L_ 2(G)|_{\max}\leq 8| G| \log_ 2| G|\) in the discrete Fourier transform on any finite metabelian group G.
0 references
group algebra
0 references
linear complexity
0 references
fast Fourier transform
0 references
discrete Fourier transform
0 references
0 references
0.8325066566467285
0 references
0.8146277070045471
0 references
0.814449667930603
0 references
0.7731844186782837
0 references
0.7609655261039734
0 references
