Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,162,939 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.
2005
2005
Linear MIMO equalization for CDMA downlink signals with code reuse
L. Mailaender
IEEE Transactions on Wireless Communications
2005
Corpus ID: 20802884
We consider a code-division multiple-access downlink using multiple-input multiple-output (MIMO) transmission/reception and…
Expand
2005
2005
Comparison of Two Approaches for GNSS Receiver Algorithms: Batch Processing and Sequential Processing Considerations
F. van Graas
,
A. Soloviev
,
M. U. de Haag
,
S. Gunawardena
,
M. Braasch
2005
Corpus ID: 9325058
Receiver design implementations are considered in terms of batch vs. sequential processing strategies. It is shown that the batch…
Expand
Highly Cited
2004
Highly Cited
2004
Confounded Expectations: Informedia at TRECVID 2004
Alexander Hauptmann
,
Ming-yu Chen
,
+9 authors
H. Wactlar
TREC Video Retrieval Evaluation
2004
Corpus ID: 8006586
For TRECVID 2004, CMU participated in the semantic feature extraction task, and the manual, interactive and automatic search…
Expand
2002
2002
USING FOURIER DESCRIPTORS TO RECOGNIZE OBJECT'S SHAPE
Tao Wang
2002
Corpus ID: 63947634
Fourier descriptor is an important method used in shape analysis and recognition. In this paper, an efficient and accurate method…
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
1998
1998
Synthesis and Morphological Behavior of Silicon-Containing Triblock Copolymers for Nanostructure Applications
Apostolos Avgeropoulos
,
V. Z. 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
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
1977
1977
On Interframe Transform Coding
T. Natarajan
,
N. Ahmed
IEEE Transactions on Communications
1977
Corpus ID: 62588853
This paper is concerned with interframe coding of monochrome pictures using 3-dimensional transforms. First, an algorithm which…
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