Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,202,434 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
2007
Highly Cited
2007
System architecture and cross-layer optimization of video broadcast over WiMAX
Jianfeng Wang
,
M. Venkatachalam
,
Yuguang Fang
IEEE Journal on Selected Areas in Communications
2007
Corpus ID: 9747208
Video broadcast and mobile TV have received significant interests from both academia and industry recently. The emerging mobile…
Expand
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
2000
2000
Speech encryption based on fast Fourier transform permutation
S. E. Borujeni
ICECS . 7th IEEE International Conference on…
2000
Corpus ID: 56709937
This paper deals with the permutation of FFT (Fast Fourier Transform) coefficients in a speech encryption system. The scrambling…
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
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
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