The Community for Technology Leaders
RSS Icon
Los Angeles, California USA
Mar. 31, 2009 to Apr. 2, 2009
ISBN: 978-0-7695-3507-4
pp: 588-590
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
Zero padding, Interpolation, Fast Fourier transform, Computational cost, Fault location
Yechao Bai, Xinggan Zhang, "An Algorithm of Fast Interpolation", CSIE, 2009, Computer Science and Information Engineering, World Congress on, Computer Science and Information Engineering, World Congress on 2009, pp. 588-590, doi:10.1109/CSIE.2009.209
345 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool