Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,215,008 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.
Highly Cited
2013
Highly Cited
2013
Chemical Signals in Vertebrates 6
R. Doty
,
D. Müller-Schwarze
Springer US
2013
Corpus ID: 27325278
ANATOMY AND PHYSIOLOGY OF CHEMOSENSORY SYSTEMS: Action of Sucrose on the Salty Taste Response (K. Tonosaki). BODY FLUIDS AND…
Expand
1999
1999
Area-efficient architecture for Fast Fourier transform
Jose Antonio 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
1999
Highly Cited
1999
Efficient algorithms for burst error recovery using FFT and other transform kernels
F. Marvasti
,
M. Hasan
,
M. Echhart
,
S. Talebi
IEEE Transactions on Signal Processing
1999
Corpus ID: 27788910
We show that the problem of signal reconstruction from missing samples can be handled by using reconstruction algorithms similar…
Expand
Highly Cited
1990
Highly Cited
1990
Efficient parallel receive beam forming for phased array imaging using phase rotation (medical US application)
Michael J. O'donnell
IEEE Symposium on Ultrasonics
1990
Corpus ID: 62678311
A method for multiple beam formation in the near field using phase rotation (i.e., Fourier inversion) is presented. This method…
Expand
Highly Cited
1989
Highly Cited
1989
Stabilizing the fast Kalman algorithms
Jean-Luc botto
,
G. Moustakides
IEEE Transactions on Acoustics Speech and Signal…
1989
Corpus ID: 638825
The fast Kalman algorithms are stabilized by introducing a quantity that measures the accumulation of the roundoff errors. This…
Expand
Highly Cited
1986
Highly Cited
1986
Recursive Block Coding - A New Approach to Transform Coding
P. Farrelle
,
A. Jain
IEEE Transactions on Communications
1986
Corpus ID: 206637725
The concept of fast KL transform coding introduced earlier [7], [8] for first-order Markov processes and certain random fields…
Expand
1985
1985
A comparison of the time involved in computing fast Hartley and fast Fourier transforms
G. Bold
Proceedings of the IEEE
1985
Corpus ID: 25815127
It is shown that the DFT of a real sequence, formed via the Fast Hartley Transform, can be computed at most only 2 times faster…
Expand
1984
1984
A Speech Scrambler Using the Fast Fourier Transform Technique
K. Sakurai
,
K. Koga
,
T. Muratani
IEEE Journal on Selected Areas in Communications
1984
Corpus ID: 24247879
This paper describes an analog speech scrambler using the FFT technique (FFT scrambler). The FFT scrambler provides highly…
Expand
1972
1972
Dynamic Analysis by Extra Fast Fourier Transform
J. W. Meek
,
Anestis S. Velestos
1972
Corpus ID: 119905564
A method based on the Discrete Fourier Transform (DFT) is presented for evaluating the dynamic response of any discrete, time…
Expand
Review
1969
Review
1969
Fast Fourier Transform Hardware Implementations—An Overview
Mit Press
1969
Corpus ID: 67077766
This discussion served as an introduction to the Hardware Implementations session of the IEEE Workshop on Fast Fourier Transform…
Expand