Improved upper complexity bounds for the discrete Fourier transform (Q811112): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:05, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved upper complexity bounds for the discrete Fourier transform |
scientific article |
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
