Scheduled System Maintenance:
On May 6th, system maintenance will take place from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). During this time, there may be intermittent impact on performance. We apologize for the inconvenience.
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.

The purchase and pricing options are temporarily unavailable. Please try again later.
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