Proceedings of 13th International Conference on Pattern Recognition 1996
DOI: 10.1109/icpr.1996.546906
|View full text |Cite
|
Sign up to set email alerts
|

A metric unified treatment of two-dimensional FFT

Abstract: A unification of fast algorithms for the discrete Fourier transform is discussed. A relationship is established with the coverings of sets of input data indices and their metric properties with respect to the families of non-Archimedean metrics. A n explicit analogy is given between the basic relations f o r the FFT-2 decomposition and the Stokes theorem on manifolds. Fast Fourier Transforms with reduced computational complexity are synrhesized.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

1997
1997
2019
2019

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
references
References 6 publications
0
0
0
Order By: Relevance