Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,843,839 papers from all fields of science
Search
Sign In
Create Free Account
Fast Fourier transform
Known as:
Arithmetic complexity of the discrete Fourier transform
, FFT algorithm
, FFT (disambiguation)
Expand
A fast Fourier transform (FFT) algorithm computes the discrete Fourier transform (DFT) of a sequence, or its inverse. Fourier analysis converts a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Algorithmic efficiency
Ambiguity function
Bit-reversal permutation
CS-Cipher
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2004
2004
Introduction to Fast Fourier Transform in Finance
A. Černý
2004
Corpus ID: 154848785
Many MBA students are daunted by the requirement that calculus is a prerequisite for the program. But those who are already…
Expand
Highly Cited
2001
Highly Cited
2001
Computation of resonant frequencies and quality factors of cavities by FDTD technique and Pade approximation
W. Guo
,
Weijun Li
,
Yongzhen Huang
2001
Corpus ID: 55729064
The finite-difference time domain (FDTD) technique and the Pade approximation with Baker's algorithm are used to calculate the…
Expand
1999
1999
Area-efficient architecture for Fast Fourier transform
J. A. Hidalgo
,
Juan López
,
Francisco Argüello
,
E. Zapata
1999
Corpus ID: 179418
We present an area-efficient parallel architecture that implements the constant-geometry, in-place Fast Fourier transform. It…
Expand
Highly Cited
1997
Highly Cited
1997
Fast algorithms for DCT-domain image downsampling and for inverse motion compensation
N. Merhav
,
V. Bhaskaran
IEEE Trans. Circuits Syst. Video Technol.
1997
Corpus ID: 20057351
Straightforward techniques for spatial domain processing of compressed video via decompression and recompression are…
Expand
Highly Cited
1985
Highly Cited
1985
Adaptive Optical Target Detection Using Correlated Images
A. Margalit
,
I. Reed
,
R. Gagliardi
IEEE Transactions on Aerospace and Electronic…
1985
Corpus ID: 22539438
A method for target detection that achieves clutter rejection by the use of multiple observations of the same target scene is…
Expand
Highly Cited
1978
Highly Cited
1978
Application of Fast Kalman Estimation to Adaptive Equalization
D. Falconer
,
L. Ljung
IEEE Transactions on Communications
1978
Corpus ID: 62371011
Very rapid initial convergence of the equalizer tap coefficients is a requirement of many data communication systems which employ…
Expand
Highly Cited
1974
Highly Cited
1974
TDM-FDM Transmultiplexer: Digital Polyphase and FFT
M. Bellanger
,
J. Daguet
IEEE Transactions on Communications
1974
Corpus ID: 62154611
The cascading of a discrete Fourier transform processor and a digital polyphase network is shown to reduce the computation rate…
Expand
1971
1971
A Fast Fourier Transform for High-Speed Signal Processing
M. Corinthios
IEEE transactions on computers
1971
Corpus ID: 87416
An arbitrary-radix fast Fourier transform algorithm and a design of its implementing signal processing machine are introduced…
Expand
1971
1971
The Design of a Class of Fast Fourier Transform Computers
M. Corinthios
IEEE transactions on computers
1971
Corpus ID: 27087441
The design of a class of special-purpose computers for time-series analysis by Fourier transformation is described. The computers…
Expand
Review
1969
Review
1969
Fast Fourier transform hardware implementations--An overview
G. Bergland
1969
Corpus ID: 62153093
This discussion served as an introduction to the Hardware Implementations Session of the IEEE Workshop on Fast Fourier Transform…
Expand
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)
ACCEPT & CONTINUE