Fast fourier transforms: a tutorial review and a state of the art
Pierre Duhamel,Martin Vetterli +1 more
Reads0
Chats0
TLDR
Note: V. Madisetti, D. B. Williams, Eds.About:
This article is published in Signal Processing.The article was published on 1990-04-01 and is currently open access. It has received 862 citations till now. The article focuses on the topics: Prime-factor FFT algorithm & Fourier transform.read more
Citations
More filters
Journal ArticleDOI
The Design and Implementation of FFTW3
Matteo Frigo,Steven G. Johnson +1 more
TL;DR: It is shown that such an approach can yield an implementation of the discrete Fourier transform that is competitive with hand-optimized libraries, and the software structure that makes the current FFTW3 version flexible and adaptive is described.
Proceedings ArticleDOI
FFTW: an adaptive software architecture for the FFT
Matteo Frigo,Steven G. Johnson +1 more
TL;DR: An adaptive FFT program that tunes the computation automatically for any particular hardware, and tests show that FFTW's self-optimizing approach usually yields significantly better performance than all other publicly available software.
Journal ArticleDOI
Cyclic prefixing or zero padding for wireless multicarrier transmissions
TL;DR: Two novel equalizers are developed for ZP-OFDM to tradeoff performance with implementation complexity andSimulations tailored to the realistic context of the standard for wireless local area network HIPERLAN/2 illustrate the pertinent tradeoffs.
Proceedings ArticleDOI
Cache-oblivious algorithms
TL;DR: It is proved that an optimal cache-oblivious algorithm designed for two levels of memory is also optimal for multiple levels and that the assumption of optimal replacement in the ideal-cache model can be simulated efficiently by LRU replacement.
Journal ArticleDOI
Big Data Analysis with Signal Processing on Graphs: Representation and processing of massive data sets with irregular structure
TL;DR: This article considers product graphs as a graph model that helps extend the application of DSPG methods to large data sets through efficient implementation based on parallelization and vectorization and relates the presented framework to existing methods for large-scale data processing.
References
More filters
Journal ArticleDOI
An algorithm for the machine calculation of complex Fourier series
J.W. Cooley,John W. Tukey +1 more
TL;DR: Good generalized these methods and gave elegant algorithms for which one class of applications is the calculation of Fourier series, applicable to certain problems in which one must multiply an N-vector by an N X N matrix which can be factored into m sparse matrices.
Journal ArticleDOI
The use of fast Fourier transform for the estimation of power spectra: A method based on time averaging over short, modified periodograms
TL;DR: In this article, the use of the fast Fourier transform in power spectrum analysis is described, and the method involves sectioning the record and averaging modified periodograms of the sections.
Journal ArticleDOI
Discrete Cosine Transform
TL;DR: In this article, a discrete cosine transform (DCT) is defined and an algorithm to compute it using the fast Fourier transform is developed, which can be used in the area of digital processing for the purposes of pattern recognition and Wiener filtering.
Book
Theory and application of digital signal processing
TL;DR: Feyman and Wing as discussed by the authors introduced the simplicity of the invariant imbedding method to tackle various problems of interest to engineers, physicists, applied mathematicians, and numerical analysts.
The fast Fourier Transform
TL;DR: A computer algorithm that computes the discrete Fourier transform much faster than other algorithms, is explained and examples and detailed procedures are provided to assist the reader in learning how to use the algorithm.