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.

Optimization of an image restoration algorithm from its Fourier spectrum phase

Abstract: The modification of an iterative algorithm of image recon- struction from only the phase of its Fourier transform is described. This task is important for images distorted by the Gaussian transfer function. The results of reconstructing images of the Moon and Saturn are shown. © 1996 Society of Photo-Optical Instrumentation Engineers. Subject terms: image reconstruction; Fourier transform; Gaussian transfer func- tion; iterative algorithm.

Using single buffers and data reorganization to implement a multi-megasample fast Fourier transform

Abstract: Data ordering in large fast Fourier transforms (FFT's) is both conceptually and implementationally difficult Discribed here is a method of visualizing data orderings as vectors of address bits, which enables the engineer to use more efficient data orderings and reduce double-buffer memory designs Also detailed are the difficulties and algorithmic solutions involved in FFT lengths up to 4 megasamples (Msamples) and sample rates up to 80 MHz

Analyzing strategy for power system harmonics based on FFT and DWT using db20

Abstract: The traditional fast Fourier transform (FFT) is mainly applied to the analysis of the steady-state harmonic signals but is difficult to gain the time local information, and it shows big errors in the analysis of mutation signals or high frequency interference signals; the discrete wavelet transform (DWT) is particularly suitable for the non-stationary signals and transient signals, but shows lower accuracy than FFT in analyzing the steady-state harmonic signals One analyzing strategy of power system harmonics based on FFT and DWT using db20 is presented considering advantages of both FFT and DWT First of all, the power system harmonic signals are decomposed into low frequency part and high frequency part through the DWT, and then it is analyzed by FFT and db20 wavelet respectively The strategy is proved effective and applicable by MATLAB simulation, which achieves the desired results

Numerical Processing Method Used in MOA Monitoring

Abstract: In the paper,the quadratic polynomial function smoothing-method is used to smooth the sampling data,which is proved to be effective in filtering the high frequency noise.Two data process methods both by Discrete Fourier Transform(DFT)and by Fast Fourier Transform(FFT)are compared.An algorithm used to analyse the leakage current and the reference voltage simultaneously in frequency domain is also provided.

A Quadrature-Sampled Pre-Corrected FFT for the Analysis of Microwave Circuits in Layered Media

Abstract: This paper presents a fast iterative solution based on the quadrature sampled pre-corrected fast fourier transform (QSPCFFT) algorithm used to accelerate a method of moment discretization of the mixed potential integral equation (MPIE) for the analysis of circuits printed in a layered medium. The QSPCFFT algorithm is applied to accelerate the computation of all far interactions, and has a complexity that scales as O (N log N) and memory that scales as O(N). The algorithm is efficiently applied to broad-band analysis of printed circuits since the far-field is not constrained by the wavelength, but is determined rather by the local discretization.