The techniques of the generalized fast Fourier transform algorithm
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.
- A new set of minimum-add small-n rotated DFT modules
- Fast generalized Fourier transforms
- Fast algorithms for DFT of composite sequence lengths
- Fast algorithms through divide- and combine-and-conquer strategies
- scientific article; zbMATH DE number 3880785 (Why is no real title available?)
- scientific article; zbMATH DE number 3907734 (Why is no real title available?)
- scientific article; zbMATH DE number 3956396 (Why is no real title available?)
- scientific article; zbMATH DE number 4024740 (Why is no real title available?)
- scientific article; zbMATH DE number 4037044 (Why is no real title available?)
- scientific article; zbMATH DE number 4066292 (Why is no real title available?)
- scientific article; zbMATH DE number 4072331 (Why is no real title available?)
- scientific article; zbMATH DE number 1217618 (Why is no real title available?)
- The differential Fourier transform method
- Realization of discrete Fourier transforms using a nesting algorithm
- Generalization of the fast Fourier transform with a constant structure
- Applications of conformal computing techniques to problems in computational physics: the fast Fourier transform
- Recursive Fourier transform using convolutions
- A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures
- Computational aspects of fast Fourier transformation
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)