FFT Interpolation From Nonuniform Samples Lying in a Regular Grid

DOI10.1109/TSP.2015.2419178MaRDI QIDQ4580596zbMATH OpenOpenAlexFDO

Authors Jesus Selva

Publication date 22 August 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1408.3717

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)

Abstract: This paper presents a method to interpolate a periodic band-limited signal from its samples lying at nonuniform positions in a regular grid, which is based on the FFT and has the same complexity order as this last algorithm. This kind of interpolation is usually termed "the missing samples problem" in the literature, and there exists a wide variety of iterative and direct methods for its solution. The one presented in this paper is a direct method that exploits the properties of the so-called erasure polynomial, and it provides a significant improvement on the most efficient method in the literature, which seems to be the burst error recovery (BER) technique of Marvasti's et al. The numerical stability and complexity of the method are evaluated numerically and compared with the pseudo-inverse and BER solutions.

Cited in

(2)

• Multichannel interpolation of nonuniform samples with application to image recovery
• Combining the Hanning windowed interpolated FFT in both directions

This page was built for publication: FFT Interpolation From Nonuniform Samples Lying in a Regular Grid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580596)