The techniques of the generalized fast Fourier transform algorithm

From MaRDI portal





An idea of generating efficient algorithms for computing the discrete Fourier transform (DFT) is presented. The method is based on the convolution theorem. A special case of the method is equivalent to nesting of the fast Fourier transform algorithms (FFT's). The application of the method to the case where \(N\) has mutually prime factors results in a new interpretation of the permutations characteristic of this class of algorithms. It is shown that the formulae of the method may be easily adapted for deriving algorithms for the cosine/sine DFT. A set of new FFT's is presented that has smaller arithmetical and/or memory complexities than any algorithms known so far.











This page was built for publication: The techniques of the generalized fast Fourier transform algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3985190)