Improved upper complexity bounds for the discrete Fourier transform
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.
scientific article; zbMATH DE number 4215337
scientific article