Spectral transformations for two-dimensional filters via FFT

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.