DocumentCode :
763497
Title :
Spectral transformations for two-dimensional filters via FFT
Author :
Mastorakis, Nikos E. ; Swamy, M.N.S.
Author_Institution :
Dept. of Comput. Sci., Hellenic Naval Acad., Piraeus, Greece
Volume :
49
Issue :
6
fYear :
2002
fDate :
6/1/2002 12:00:00 AM
Firstpage :
827
Lastpage :
831
Abstract :
In this paper, a new fast algorithm for spectral transformations for two-dimensional digital filters is presented. The algorithm is based on the use of the fast Fourier transform. The computational complexity of this algorithm is evaluated. The simplicity and efficiency of the algorithm is illustrated by a numerical example
Keywords :
computational complexity; fast Fourier transforms; two-dimensional digital filters; FFT; computational complexity; digital filters; fast Fourier transform; spectral transformations; two-dimensional filters; Application software; Computational complexity; Digital filters; Digital signal processing; Fast Fourier transforms; Image processing; Multidimensional systems; Polynomials; Signal processing algorithms; Stability;
fLanguage :
English
Journal_Title :
Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on
Publisher :
ieee
ISSN :
1057-7122
Type :
jour
DOI :
10.1109/TCSI.2002.1010037
Filename :
1010037
Link To Document :
بازگشت