Cooley–Tukey FFT algorithm

Known as: Cooley-Tukey FFT algorithm, Danielson-Lanczos lemma, Cooley Tukey Algorithm 
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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
The development of software based GNSS receivers is being rapidly revolutionized in satellite based navigation applications. In… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 3
Is this relevant?
2010
2010
Given that many-core architectures are becoming the mainstream framework for high performance computing, it is important to… (More)
  • figure 1
  • table 1
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
2009
2009
The discrete triangle transform (DTT) was recently introduced [1] as an example of a non-separable transform for signal… (More)
  • figure 1
  • figure 2
Is this relevant?
2005
2005
The classical Cooley-Tukey fast Fourier transform (FFT) algorithm has the computational cost of O(Nlog2N) where N is the length… (More)
  • figure 1
Is this relevant?
2004
2004
The discrete triangle transform (DTT) was recently introduced (Pu/spl uml/schel, M. and Ro/spl uml/tteler, M., Proc. ICASSP, 2004… (More)
  • figure 1
  • figure 2
Is this relevant?
2003
2003
The Cooley-Tukey FFT algorithm decomposes a discrete Fourier transform (DFT) of size n = km into smaller DFTs of size k and m. In… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper presents a novel split-radix fast Fourier transform (SRFFT) pipeline architecture design. A mapping methodology has… (More)
  • table I
  • figure 2
  • figure 1
  • figure 3
  • table II
Is this relevant?
Highly Cited
1993
Highly Cited
1993
In this paper, we present the scalability analysis of parallel Fast Fourier Transform algorithm on mesh and hypercube connected… (More)
  • figure 2
  • figure 3
  • figure 4
  • table 1
  • table 2
Is this relevant?
1992
1992
We describe an implementation of the Cooley Tukey complex-to-complex FFT on the Connection Machine. The implementation is… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
1979
1979
Pure and Applied Mathematics—Two Sides of a Coin In November of 1979 there appeared in the Bulletin of the AMS a paper by L… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?