Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,935,563 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
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
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
1995
Highly Cited
1995
Accurate Structural Data Demystify B-12 - High-Resolution Solid-State Structure of Aquocobalamin Perchlorate and Structure-Analysis of the Aquocobalamin Ion in Solution
C. Kratky
,
G. Färber
,
+5 authors
B. Kräutler
1995
Corpus ID: 17764639
Experiments are described to elucidate the structure and solvation of aquocobalamin (vitamin Biza, 1+) in the crystal and in…
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
A Parallel Implementation of the Fast Fourier Transform Algorithm
G. Bergland
IEEE transactions on computers
1972
Corpus ID: 3176257
For many real-time signal processing problems, correlations, convolutions, and Fourier analysis must be performed in special…
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
1971
1971
EARTHQUAKE INTERACTION BY FAST FOURIER TRANSFORM
Shih-Chi Liu
,
L. W. Fagel
1971
Corpus ID: 117789554
A simple approach using a Fast Fourier Transform (FFT) algorithm for obtaining the transient structural response to earthquakes…
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
Highly Cited
1968
Highly Cited
1968
The Fast Fourier-Hadamard Transform and Its Use in Signal Representation and Classification,
J. Whelchel
,
D. Guinn
1968
Corpus ID: 120410575
Abstract : A discrete time transform was studied and applied to the representation and discrimination of digitized signals. The…
Expand