Premium
The CGFFT method with a discontinuous FFT algorithm
Author(s) -
Fan GuoXin,
Liu Qing Huo
Publication year - 2001
Publication title -
microwave and optical technology letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.304
H-Index - 76
eISSN - 1098-2760
pISSN - 0895-2477
DOI - 10.1002/mop.1079
Subject(s) - fast fourier transform , split radix fft algorithm , prime factor fft algorithm , rader's fft algorithm , classification of discontinuities , algorithm , interpolation (computer graphics) , convolution (computer science) , conjugate gradient method , mathematics , computer science , sampling (signal processing) , fourier transform , mathematical analysis , telecommunications , fourier analysis , artificial intelligence , short time fourier transform , frame (networking) , artificial neural network , detector
In the conjugate gradient–fast Fourier transform (CGFFT) method, the FFT is used to evaluate the convolution integrals. When the function to be transformed has discontinuities, the accuracy of the FFT results, and thus the CGFFT results, will degrade. In this letter, an efficient FFT algorithm is developed for discontinuous functions with both uniform and nonuniform sampled data, with O ( Np + N log N ) complexity, where N is the number of sampling points and p is the interpolation order. The algorithm is incorporated into the CGFFT method. Numerical results for slabs demonstrate the efficiency and accuracy of the new FFT and CGFFT algorithms. © 2001 John Wiley & Sons, Inc. Microwave Opt Technol Lett 29: 47–49, 2001.