DocumentCode
2416417
Title
A metric unified treatment of two-dimensional FFT
Author
Chernov, Vladimir M.
Author_Institution
Image Process Syst. Inst., Samara, Russia
Volume
2
fYear
1996
fDate
25-29 Aug 1996
Firstpage
662
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. An explicit analogy is given between the basic relations for the FFT-2 decomposition and the Stokes theorem on manifolds. Fast Fourier transforms with reduced computational complexity are synthesized
Keywords
algebra; computational complexity; discrete Fourier transforms; iterative methods; signal processing; FFT-2 decomposition; Stokes theorem; computational complexity; coverings; discrete Fourier transform; input data indices; metric properties; metric unified treatment; nonArchimedean metrics; two-dimensional FFT; Arithmetic; Computational complexity; Discrete Fourier transforms; Fast Fourier transforms; Flexible printed circuits; Fourier transforms; Image processing; Pattern recognition; Polynomials; Tensile stress;
fLanguage
English
Publisher
ieee
Conference_Titel
Pattern Recognition, 1996., Proceedings of the 13th International Conference on
Conference_Location
Vienna
ISSN
1051-4651
Print_ISBN
0-8186-7282-X
Type
conf
DOI
10.1109/ICPR.1996.546906
Filename
546906
Link To Document