By Topic

An Algorithm of Fast Interpolation

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 $13
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)
Yechao Bai ; Dept. Of ESE., Nanjing Univ., Nanjing, China ; Xinggan Zhang

There are many approaches to realize interpolation. Padding zeros in the high frequency band of a real sequence results in interpolation in time domain. For the discrete frequency spectrum with high frequency band being zeros, this paper proposes a fast implementation method of inverse fast Fourier transform to reduce the computational cost. The proposed algorithm has a computational cost of (IN/2)(log2 N- 1/2), while the computational cost of IFFT is (IN/2)(log2 lN )(where N is the length of the original sequence, and l is the interpolation multiple). The stage of butterflies of the proposed method just depends on the length of the original sequence, and has nothing to do with the number of padded zeros.

Published in:

Computer Science and Information Engineering, 2009 WRI World Congress on  (Volume:6 )

Date of Conference:

March 31 2009-April 2 2009