Answers are grounded in this paper and cite their sources.
An interpolation algorithm for finite-duration real sequences using the discrete Fourier transform is presented. The proposed method is shown to result in a significant saving of computational labour over the discrete version of the time-domain classical interpolation formula. Estimation of inbetween samples for large sequences is possible within a mean square error of 0.00114 with this method. Some considerations with regard to the computation of FFTs are also discussed.
No takes yet. Share an insight, caveat, or question.
Prasad et al. (1986) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: