A fast algorithm is proposed for recursively computing the DFTs of prime length. Only (N-1)/2 real multiplications are required to compute all N frequency components in terms of permuting the input data.
Fast DFT Algorithm with [N–1]/2 Multiplications
Footprints in Cambridge and Aviation Industries of China ; Kapitel : 1 ; 3-12
2021-09-20
10 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
The group of multiplications for an almost completely decomposable group
DOAJ | 2016
|Fast spherical search algorithm
IEEE | 2004
|