Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,017,888 papers from all fields of science
Search
Sign In
Create Free Account
Cooley–Tukey FFT algorithm
Known as:
Cooley-Tukey FFT algorithm
, Danielson-Lanczos lemma
, Cooley Tukey Algorithm
Expand
The Cooley–Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re-expresses the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
36 relations
Adding machine
Analog-to-digital converter
Array data structure
Bit-reversal permutation
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Acquisition of GPS L1 signals using Cooley-tukey FFT algorithm
D. Ratnam
,
Ashish Pasha
,
P. Swathi
,
M. Rao
IEEE International Conference on Signal…
2013
Corpus ID: 17888981
The development of software based GNSS receivers is being rapidly revolutionized in satellite based navigation applications. In…
Expand
2012
2012
Code acquisition method of GPS signals based on WFTA, PFA and Cooley-Tukey FFT
Chunyu Li
,
Jianfeng Guan
IEEE International Conference on Intelligent…
2012
Corpus ID: 18614598
An acquisition method of GPS signals based on fast Fourier transform (FFT) is proposed. The method applies Winograd Fourier…
Expand
2006
2006
Design of Application Specific Processors for the Cached FFT Algorithm
Oguzhan Atak
,
A. Atalar
,
+6 authors
G. Masera
IEEE International Conference on Acoustics Speech…
2006
Corpus ID: 739689
Orthogonal frequency division multiplexing (OFDM) is a data transmission technique which is used in wired and wireless digital…
Expand
2005
2005
A 3.33Gb/s (1200,720) low-density parity check code decoder
Chien-Ching Lin
,
Kai-Li Lin
,
Hsie-Chia Chang
,
Chen-Yi Lee
Proceedings of the 31st European Solid-State…
2005
Corpus ID: 14702947
In this paper, a (1200,720) LDPC decoder based on an irregular parity check matrix is presented. For achieving higher chip…
Expand
2004
2004
Cooley-Tukey FFT like algorithm for the discrete triangle transform
M. Puschel
,
M. Rotteler
3rd IEEE Signal Processing Education Workshop…
2004
Corpus ID: 16974202
The discrete triangle transform (DTT) was recently introduced (Pu/spl uml/schel, M. and Ro/spl uml/tteler, M., Proc. ICASSP, 2004…
Expand
2004
2004
Cooley-Tukey FFT like algorithm for the discrete triangle transform
Markus Püschel
,
M. Rötteler
2004
Corpus ID: 31216577
The discrete triangle transform (DTT) was recently introduced (Pu/spl uml/schel, M. and Ro/spl uml/tteler, M., Proc. ICASSP, 2004…
Expand
1999
1999
Efficient VLSI implementation of radix-8 FFT algorithm
L. Jia
,
Y. Gao
,
H. Tenhunen
IEEE Pacific Rim Conference on Communications…
1999
Corpus ID: 60825016
High-radix Cooley-Turkey FFT algorithms have obvious advantages: less multiplications and reduced memory accesses so power…
Expand
1997
1997
Introduction to Cooley and Tukey (1965) An Algorithm for the Machine Calculation of Complex Fourier Series
I. Good
1997
Corpus ID: 61054748
Fourier (frequency) analysis is important in statistics, mathematics, and all the hard sciences (as in x-ray crystallography…
Expand
1987
1987
Specification of the Fast Fourier Transform algorithm as a term rewriting system
P. Rodenburg
,
D. Hoekzema
1987
Corpus ID: 116894225
We specify an algorithm for multiplying polynomials with complex coefficients incorporating, the Fast Fourier Transform algorithm…
Expand
1978
1978
A comparative study of time efficient FFT and WFTA programs for general purpose computers
L. Morris
1978
Corpus ID: 61860373
Time efficient autogen software implementations of the fast Fourier transform (FFT) and the Winograd Fourier transform algorithm…
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