Prime-factor FFT algorithm

About: Prime-factor FFT algorithm is a research topic. Over the lifetime, 2346 publications have been published within this topic receiving 65147 citations. The topic is also known as: Prime Factor Algorithm.

Selective deconvolution: A new approach to extrapolation and spectral analysis of discrete signals

Abstract: This paper describes a new algorithm useful for extrapolation and Fourier analysis of discrete signals that are given by a relative small number of samples. The extrapolation is based on the assumption that the discrete Fourier spectrum shows dominant spectral lines. Involving only FFT, the iterative algorithm is not restricted to one-dimensional signals but can also be applied to higher-dimensional problems. Additional knowledge on the signal like band-limitedness or positivity can easily be taken into account.

A fast Fourier transform algorithm for symmetric real-valued series

Abstract: A new algorithm is presented for calculating the real discrete Fourier transform of a real-valued input series with even symmetry. The algorithm is based on the fast Fourier transform algorithm for arbitrary real-valued input series (FTRVI) [1], [2]. By eliminating all unnecessary steps and storage locations, and by rearranging the intermediate results and the operation sequence, it is possible to reduce the computation time and the required core storage by a factor of 2 as compared to the case of arbitrary real input or by a factor of 4 as compared to the general fast Fourier transform for complex inputs.

An algorithm for fast Hilbert transform of real functions

Abstract: A simple and accurate algorithm to evaluate the Hilbert transform of a real function is proposed using interpolations with piecewise---linear functions. An appropriate matrix representation reduces the complexity of this algorithm to the complexity of matrix-vector multiplication. Since the core matrix is an antisymmetric Toeplitz matrix, the discrete trigonometric transform can be exploited to calculate the matrix---vector multiplication with a reduction of the complexity to O(N log N), with N being the dimension of the core matrix. This algorithm has been originally envisaged for self-consistent simulations of radio-frequency wave propagation and absorption in fusion plasmas.

A fast frequency domain filter bank realization algorithm

Abstract: This paper proposes a new and efficient algorithm for the computation of filter banks. The algorithm performs the filtering in frequency domain to utilize the advantage of FFT. By combining FFT with decimation filter, more than 80% computation power can be saved.