By Topic

DFT time-domain 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 $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

1 Author(s)
Cavicchi, T.J. ; Dept. of Electr. Eng., Akron Univ., OH, USA

The paper puts into perspective two computational approaches to discrete-time interpolation. The exact interpolation kernel for the so-called `FFT method' is derived and compared with that for the `zero-interlace' method associated with `unsampling'. Both yield precisely the same result, but the FFT method produces it using a finite-length sum, whereas the sum for the other method is infinite-length. The identity responsible for this characteristic is derived. Truncation of the sinc sum in attempts to emulate the efficiency of the FFT method can lead to significant error in reconstruction, especially at the end where the magnitudes of the omitted terms are largest. The FFT method can be used to reconstruct periodic, bandlimited functions without error (excepting roundoff), provided the window contains an integral number of periods and the sampling rate exceeds the Nyquist rate. If it does not, there will be erroneous end effects in the reconstruction. If used in a downsampling-upsampling scheme, one must ensure sufficient oversampling to avoid aliasing, as is the case for the zero-interlace method. Numerical examples illustrate the conclusions

Published in:

Radar and Signal Processing, IEE Proceedings F  (Volume:139 ,  Issue: 3 )