By Topic

Fast interpolation algorithm using FFT

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Prasad, K.P. ; SVU College of Engineering, Department of Electrical & Electronics Engineering, Tirupati, India ; Satyanarayana, P.

An interpolation algorithm for finite-duration real sequences using the discrete Fourier transform is presented. The proposed method is shown to result in a significant saving of computational labour over the discrete version of the time-domain classical interpolation formula. Estimation of inbetween samples for large sequences is possible within a mean square error of 0.00114 with this method. Some considerations with regard to the computation of FFTs are also discussed.

Published in:

Electronics Letters  (Volume:22 ,  Issue: 4 )