U Oberst - SIAM journal on control and optimization, 2007 - SIAM
Fast Fourier transforms (FFTs) are fast algorithms, ie, of low complexity, for the computation
of the discrete Fourier transform (DFT) on a finite abelian group. They are among the most …