DocumentCode
3398643
Title
2-D signal interpolation using subsequence FFT
Author
Chan, S.C. ; Ho, K.L.
Author_Institution
Dept. of Electron. Eng., City Polytech. of Hong Kong, Kowloon, Hong Kong
fYear
1991
fDate
14-17 May 1991
Firstpage
700
Abstract
An efficient 2-D interpolation algorithm is presented which is a 2-D extension of the subsequence approach for 1-D interpolation introduced by K. Prasad and P. Satyanarayana (1986), which avoids the redundant operations in the inverse transform. An improved intermediate sequence is introduced to preserve the Hermitian symmetry when interpolating a real-valued signal. The resulting algorithm is significantly more efficient than the 2-D FFT method of J.W. Adams (1987). It is also more convenient, since it permits the use of the IFFT with a size that is the same as that of the original FFT
Keywords
fast Fourier transforms; interpolation; two-dimensional digital filters; 2D signal interpolation; Hermitian symmetry; IFFT; intermediate sequence; interpolation algorithm; inverse transform; real-valued signal; subsequence FFT; Cities and towns; Digital signal processing; Discrete Fourier transforms; Discrete transforms; Fast Fourier transforms; Interpolation; Signal processing algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1991., Proceedings of the 34th Midwest Symposium on
Conference_Location
Monterey, CA
Print_ISBN
0-7803-0620-1
Type
conf
DOI
10.1109/MWSCAS.1991.252016
Filename
252016
Link To Document