Key points are not available for this paper at this time.
Based on the (m, N, q)-regular Fourier matrix, a new algorithm is proposed for fast Fourier transform (FFT) of nonuniform (unequally spaced) data. Numerical results show that the accuracy of this algorithm is much better than previously reported results with the same computation complexity of O(N log/sub 2/ N). Numerical examples are shown for the applications in computational electromagnetics.
Qing Liu (1998) studied this question.