An interpolation technique for computing the DFT of a sparse sequence

An interpolation technique for the approximate computation of the DFT of a sparse sequence is presented. This new method is more efficient than FFT pruning, particularly for long sequences where the effectiveness of FFT pruning diminishes. This interpolation method for computing the DFT of a sparse sequence is very useful in filter design and spectrum analysis.