scispace - formally typeset
Search or ask a question
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
More filters
01 Dec 2011
TL;DR: A lossy Fourier-transform-based compression algorithm for implementation on field programmable gate arrays in the space environment that computes the fast Fourier transform of a real input signal, determines the energy in user-defined time and frequency ranges of interest, and transmits only those frequency domain portions of the signal that exceed the predefined thresholds.
Abstract: : The focus of this thesis is a lossy Fourier-transform-based compression algorithm for implementation on field programmable gate arrays in the space environment. The algorithm computes the fast Fourier transform (FFT) of a real input signal, determines the energy in user-defined time and frequency ranges of interest, and transmits only those frequency domain portions of the signal that exceed the predefined thresholds. Error detection against single event upsets for the FFT is implemented by comparing the sum of the squares of the input to the scaled sum of the squares of the FFT output, which should be equal according to Parseval's Theorem. Error correction is implemented by duplicating the FFT calculation and error detection and choosing the output of the FFT that is not in error.

2 citations

Proceedings ArticleDOI
27 Aug 1999
TL;DR: In this paper, the PSR far from its maximum was calculated in the case of a F/3 system working at 4000 nm, in focus and in presence of small defocusing.
Abstract: We are interested in calculating precisely the PSR far from its maximum, where the maxima of the irradiance are falling to 1E-06, or less. The first and most used method consist in calculating the Fourier transform of the wavefront using the Fast Fourier Transform algorithm (FFT). Another method is using the beam superposition technique (BST) to decompose the wavefront in Gaussian beams, propagate those beams, and recompose to obtain the result. The third method is to apply the exact equations derived at the end of last century and described in reference books like Born and Wolf or Marechel and Francon. We shall compare the result obtained with the three methods, FFT, BST, and exact calculation in the case of a F/3 system working at 4000 nm, in focus and in presence of small defocusing.

2 citations

Journal ArticleDOI
E.A. Hashish1
TL;DR: In this paper, the performance of the FFT inversion method is investigated for the case of band limited scattered field data and a modification of the inversion algorithm is presented to increase the accuracy of the method in this case.
Abstract: The inverse scattering techniques have become widely used in many applications. These techniques are based on either continuous profile inversion or discrete multi-layer models. The FFT inversion method has been newly introduced for the detection of discrete multi-layer models. In this paper, the performance of the FFT inversion method is investigated for the case of band limited scattered field data. A modification of the inversion algorithm is presented to increase the accuracy of the method in this case. The proposed algorithm exhibits much better accuracy than the directly applied FFT inversion method.

2 citations

Proceedings ArticleDOI
16 Jul 2000
TL;DR: An FFT algorithm for piecewise smooth functions by using a double interpolation procedure and Gaussian quadrature is developed, based on the method of Sorets (1995).
Abstract: In this paper, based on the method of Sorets (1995), we develop an FFT algorithm for piecewise smooth functions by using a double interpolation procedure. With the help of the double interpolation and Gaussian quadrature, the algorithm can be applied to both uniformly and nonuniformly sampled data. The formulation of this algorithm is developed, followed by the implementation procedures and complexity analysis. Finally, we show the numerical results to demonstrate the performance of the algorithm.

2 citations

Journal ArticleDOI
TL;DR: In this paper, a new method of harmonic analysis algorithm based on Kaiser windowed FFT combing with Daubechies wavelet transform is proposed, which possesses high accuracy and flexibility in harmonic detection.
Abstract: Traditional FFT show good trait in steady-state harmonic testing, while it turn low accuracy when testing harmonic with voltage sag or transient, and can not illustrates the information on amplitude-time plane. The discrete wavelet transform is suitable for transient harmonic signals. However it is not intuitive and has more computing than FFT. Since both steady-state and transient components exist in power system, a new method of harmonic analysis algorithm based on Kaiser windowed FFT combing with Daubechies wavelet transform is proposed. The simulation results demonstrate this method possesses high accuracy and flexibility in harmonic detection.

2 citations


Network Information
Related Topics (5)
Wavelet
78K papers, 1.3M citations
81% related
Robustness (computer science)
94.7K papers, 1.6M citations
78% related
Feature extraction
111.8K papers, 2.1M citations
77% related
Support vector machine
73.6K papers, 1.7M citations
76% related
Optimization problem
96.4K papers, 2.1M citations
76% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20235
202224
20211
20188
201757
201692