Topic
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.
Papers published on a yearly basis
Papers
More filters
24 Apr 1995
TL;DR: This paper proposes a new algorithm which draws on the strength of the 4-parameter estimation algorithm and a modified FFT method and can easily automate the process without worrying about various constraints imposed by the previously published algorithms.
Abstract: One of the most important performance indicators of an A/D
converter is the effective bit. The effective bit of an A/D converter
measures the average power of the noise generated in the process of
analog to digital conversion. Three major methods for estimating A/D
effective bit are minimum mean square error sine fitting algorithm,
4-parameter estimation algorithm, and the FFT method. Each method has
its own strength and weakness. In this paper we propose a new algorithm
which draws on the strength of the 4-parameter estimation algorithm and
a modified FFT method. With this new algorithm, user can easily automate
the process without worrying about various constraints imposed by the
previously published algorithms. Extensive simulations have shown that
the new algorithm is fast, robust, and gives accurate results
1 citations
TL;DR: In this article , an efficient real-coefficient fitting both Green's function and its gradient with Fast Fourier Transform (RFGG-FG-FFT) with cube polynomial inter/extrapolation method (CPIE) was established for the analysis of scattering from antenna over a wide frequency.
Abstract: This paper presents an efficient real-coefficient fitting both Green’s function and its gradient with Fast Fourier Transform (RFGG-FG-FFT) with cube polynomial inter/extrapolation method (CPIE), which is established for the analysis of scattering from antenna over a wide frequency. To improve the computation efficiency, the CPIE is utilized. In order to reduce memory requirements and accelerate matrix vector multiplication, the RFGG-FG-FFT is adopted. The accuracy, correctness and efficiency of the new method are researched on some examples. Compared with the direct method, the examples show that the new method is superior in broadband without loss of accuracy.
1 citations
25 Jun 2010
TL;DR: An improved algorithm based on fast Fourier transform and wavelet transform for the harmonics analysis in the power quality monitoring device has perfect practicability and flexibility, especially under the condition of singularities and perturbations.
Abstract: Based on IEC61850, a framework of power quality monitoring device is constructed in this paper. In the meantime, an improved algorithm is proposed based on fast Fourier transform and wavelet transform for the harmonics analysis in the power quality monitoring device. In the improved algorithm, fast Fourier transform algorithm is used for steady harmonic to make the real-time analysis, and wavelet transform is used to identify transient harmonic. The simulations with ATP and MATLAB reveal that wavelet transform has double resolutions in both time & frequency domains, which can effectively avoid the drawback caused by a single FFT algorithm. The results obtained show that the improved algorithm has perfect practicability and flexibility, especially under the condition of singularities and perturbations.
1 citations
TL;DR: It is demonstrated that the compared approach is the best among the compared approaches when sampling is close (but not equal) to the coherent condition.
Abstract: For eliminating the picket fence effect innate to the fast Fourier transform (FFT), several schemes of the interpolated FFT (IpFFT) have been developed. Most IpFFTs are biased significantly for a short sine wave, which is due to the interference from the negative frequency component. In this paper, five approaches are compared, including one recently proposed by authors that can take into account the negative frequency component. It is demonstrated that our approach is the best among the compared approaches when sampling is close (but not equal) to the coherent condition.
1 citations
27 Jun 1994
TL;DR: In the paper efficient computation of used in Reed-Solomon code decoders p-point discrete Fourier transforms in finite fields for p being a prime number is considered.
Abstract: In the paper efficient computation of used in Reed-Solomon code decoders p-point discrete Fourier transforms (DFTs) in finite fields for p being a prime number is considered. >
1 citations