Skip to search formSkip to main contentSkip to account menu

Fast Fourier transform

Known as: Arithmetic complexity of the discrete Fourier transform, FFT algorithm, FFT (disambiguation) 
A fast Fourier transform (FFT) algorithm computes the discrete Fourier transform (DFT) of a sequence, or its inverse. Fourier analysis converts a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Algorithmic efficiencyAmbiguity functionBit-reversal permutationCS-Cipher

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
System architecture and cross-layer optimization of video broadcast over WiMAX
Video broadcast and mobile TV have received significant interests from both academia and industry recently. The emerging mobile… 
Highly Cited
2005
Highly Cited
2005
A 1-GS/s FFT/IFFT processor for UWB applications
In this paper, we present a novel 128-point FFT/IFFT processor for ultrawideband (UWB) systems. The proposed pipelined FFT… 
1999
1999
Area-efficient architecture for Fast Fourier transform
We present an area-efficient parallel architecture that implements the constant-geometry, in-place Fast Fourier transform. It… 
1984
1984
A Speech Scrambler Using the Fast Fourier Transform Technique
This paper describes an analog speech scrambler using the FFT technique (FFT scrambler). The FFT scrambler provides highly… 
Highly Cited
1981
Highly Cited
1981
Application of Least Squares Lattice Algorithms to Adaptive Equalization
In many applications of adaptive data equalization, rapid initial convergence of the adaptive equalizer is of paramount… 
Highly Cited
1974
Highly Cited
1974
TDM-FDM Transmultiplexer: Digital Polyphase and FFT
The cascading of a discrete Fourier transform processor and a digital polyphase network is shown to reduce the computation rate… 
1972
1972
A Parallel Implementation of the Fast Fourier Transform Algorithm
For many real-time signal processing problems, correlations, convolutions, and Fourier analysis must be performed in special… 
1971
1971
A Fast Fourier Transform for High-Speed Signal Processing
An arbitrary-radix fast Fourier transform algorithm and a design of its implementing signal processing machine are introduced… 
1971
1971
The Design of a Class of Fast Fourier Transform Computers
The design of a class of special-purpose computers for time-series analysis by Fourier transformation is described. The computers… 
Highly Cited
1968
Highly Cited
1968
The Fast Fourier-Hadamard Transform and Its Use in Signal Representation and Classification,
Abstract : A discrete time transform was studied and applied to the representation and discrimination of digitized signals. The… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)