1990
DOI: 10.1016/0165-1684(90)90158-u
|View full text |Cite
|
Sign up to set email alerts
|

Fast fourier transforms: A tutorial review and a state of the art

Abstract: Rrsum4. La publication de l'algorithme de Cooley-Tukey pour la transformation de Fourier rapide a ouvert une nouvelle ~re dans le traitement num6rique des signaux, en r4duisant l'ordre de complexit6 de probl~mes cruciaux, comme la transformation de Fourier ou la convolution, de N 2 ~ N log2 N (oh N est la taille du probl~me). Le drvelopment des algorithmes principaux (Cooley-Tukey, split-radix FFT, algorithmes des facteurs premiers, et transform6e rapide de Winograd) est drcrit. Ensuite, l'&at de l'art est don… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
361
0
8

Year Published

1999
1999
2017
2017

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 811 publications
(393 citation statements)
references
References 98 publications
2
361
0
8
Order By: Relevance
“…Although one row direction appears to dominate the image, the adsorbed layer in fact has hexagonal symmetry (indicated by the blue lines on the image) with a repeat spacing of ~0.5 nm, confirmed by fast Fourier transform (FFT), 45 shown as an inset. This repeat spacing is consistent with the lattice spacing of the underlying mica (0.52 nm) 46 , within experimental error, and with previous studies of the protic IL-mica interface.…”
Section: Resultsmentioning
confidence: 94%
“…Although one row direction appears to dominate the image, the adsorbed layer in fact has hexagonal symmetry (indicated by the blue lines on the image) with a repeat spacing of ~0.5 nm, confirmed by fast Fourier transform (FFT), 45 shown as an inset. This repeat spacing is consistent with the lattice spacing of the underlying mica (0.52 nm) 46 , within experimental error, and with previous studies of the protic IL-mica interface.…”
Section: Resultsmentioning
confidence: 94%
“…, L being the FFT length [17]. However, they have different performance depending on the value of L. The most common algorithm is the Cooley-Tukey algorithm, which requires that L be a composite number [18].…”
Section: Fft Lengthmentioning
confidence: 99%
“…There are also algorithms that can perform the FFT when L is a prime number, less efficiently however [19], [20]. A state of the art of FFT algorithms can be found in [17].…”
Section: Fft Lengthmentioning
confidence: 99%
“…The power spectrum density(PSD) represented on a logarithmic scale was obtained after Fast Fourier Transform(FFT) for arc sound signals [30,31], as shown in Fig. 2(c).…”
Section: Arc Sound Signals Pretreatment and Characteristics Analysismentioning
confidence: 99%