This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
An Algorithm of Fast Interpolation
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
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 21(log )22N lN− , while the computational cost of IFFT is 2 log2lN lN
Index Terms:
Zero padding, Interpolation, Fast Fourier transform, Computational cost, Fault location
Citation:
Yechao Bai, Xinggan Zhang, "An Algorithm of Fast Interpolation," csie, vol. 6, pp.588-590, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.