Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,794,577 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
2008
Highly Cited
2008
Room temperature ferromagnetism in Mn-doped CdS nanorods
Savas Delikanli
,
Shuli He
,
+4 authors
M. Swihart
2008
Corpus ID: 121670073
Mn-doped CdS nanorods synthesized by solution phase chemistry demonstrate robust ferromagnetic properties at and above room…
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
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
1998
Highly Cited
1998
Filtered decision feedback channel estimation for OFDM-based DTV terrestrial broadcasting system
A. Chini
,
Yiyan Wu
,
M. El-Tanany
,
S. Mahmoud
IEEE transactions on broadcasting
1998
Corpus ID: 62144574
Orthogonal frequency division multiplexing (OFDM) is one of the transmission techniques used for digital television (DTV…
Expand
1998
1998
Synthesis and Morphological Behavior of Silicon-Containing Triblock Copolymers for Nanostructure Applications
Apostolos Avgeropoulos
,
V. Chan
,
+4 authors
E. Thomas
1998
Corpus ID: 56575046
We report the synthesis of high molecular weight triblock copolymers of the type ABA and BAB, where A is polyisoprene (PI) and B…
Expand
Highly Cited
1995
Highly Cited
1995
A fast approximate algorithm for scaling down digital images in the DCT domain
B. Natarajan
,
V. Bhaskaran
Proceedings., International Conference on Image…
1995
Corpus ID: 26735080
We present a fast approximate algorithm for scaling down an image by a factor of two, when the input and output streams are both…
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