Non-uniform sampling fast Fourier transform(NFFT) is a method for efficient spectrum calculation of nonequispaced data.

The first step of the algorithm calculates the reconstruction data by Shepp and Logan,and the kernel matrix obtained in the least squares nonuniform fast Fourier transform(LS-NUFFT) algorithm is used for the convolution kernel.

Then the fast Fourier transform (FFT) is adopted to calculate the Fourier coefficients of the fundamental.

The Fast Fourier Transform (FFT), developed originally by Cooley and Tukey , is one of the Discrete Fourier Transform (DFT) algorithms .

A CGFFT algorithm for transformation from the near-field to the aperture-field;

The N = 2￣M FFT Algorithm for Decimation in Time;

PRECISE LASER WAVELENGTH DETERMINED BY FFT;

The Fast Fourier Transform Identifies the Frequency Responses of Mathematical Models in Discrete Time Domain;

The numerical simulation of diffraction based on fast Fourier transform;

The Realization of Fast Fourier Transform Based on FPGA in Laser Spectrum Detection;

The near field coupling can be computed by the traditional method of moments(MoM);while the impedance elements of far field coupling are characterized as a Toeplitz matrix by interpolating Green\'s function on a regular Cartesian grid,and the matrix-vector products are accelerated by fast Fourier transforms.