ICASSP '77. IEEE International Conference on Acoustics, Speech, and Signal Processing
DOI: 10.1109/icassp.1977.1170190
|View full text |Cite
|
Sign up to set email alerts
|

An algorithm for the two dimensional FFT

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(1 citation statement)
references
References 5 publications
0
1
0
Order By: Relevance
“…With this in mind, we can, for instance, convert the classical Cooley-Tukey algorithms [4] into relatively new split-algorithms (see [13]). Such a recasting is especially topical in dealing with multidimensional transforms [note that the reduction to one-dimensional transforms is known to be not the best way (see [7,8,12])]. Some approaches to the reconstruction of multidimensional Fourier transforms are demonstrated in [12].…”
Section: Pa(n+ir(n+i)) \)mentioning
confidence: 98%
“…With this in mind, we can, for instance, convert the classical Cooley-Tukey algorithms [4] into relatively new split-algorithms (see [13]). Such a recasting is especially topical in dealing with multidimensional transforms [note that the reduction to one-dimensional transforms is known to be not the best way (see [7,8,12])]. Some approaches to the reconstruction of multidimensional Fourier transforms are demonstrated in [12].…”
Section: Pa(n+ir(n+i)) \)mentioning
confidence: 98%