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
Journal Article
TL;DR: A sliding-window iterative algorithm is applied in the computation to detect the harmonic components generated by nonlinear loads, which improves the real-time, tracing and anti-interference performances with less computation and easy implementation.
Abstract: The design and implementation of a harmonic current computation technique is presented, which is used in active power filter based on a simplified discrete Fourier transform. A sliding-window iterative algorithm is applied in the computation to detect the harmonic components generated by nonlinear loads,which improves the real-time,tracing and anti-interference performances with less computation and easy implementation. The algorithm is simulated with Matlab,and the results show that it calculates the fundamental component of load current with small errors,which satisfies the practical application.

3 citations

Proceedings ArticleDOI
01 Dec 2006
TL;DR: An alternate method to derive higher radix FFT algorithms by using a recursive approach and by appropriately combining the twiddle factors without increasing the structural complexity is proposed.
Abstract: In this paper, the authors propose an alternate method to derive higher radix FFT algorithms by using a recursive approach and by appropriately combining the twiddle factors without increasing the structural complexity. Specifically, efficient radix-8 and radix-16 FFT algorithms are designed and their arithmetic complexities shown to be slightly less than those of the corresponding existing Cooley-Tukey FFT algorithms

3 citations

Proceedings ArticleDOI
08 Jul 2001
TL;DR: The HIL-FFT algorithm is more efficient (by a constant) than plane wave decomposition based algorithms when applied to the analysis of scattering from uniformly meshed structures.
Abstract: This article presents a hierarchical FFT-based algorithm that permits the fast analysis of transient electromagnetic scattering from uniformly meshed plate-like structures. For these structures the computational complexity of the algorithm scales as O(N/sub t/N/sub s/ log/sup 2/ N/sub s/). Similar to FFT-based algorithms for accelerating frequency-domain solvers, the HIL-FFT algorithm is more efficient (by a constant) than plane wave decomposition based algorithms when applied to the analysis of scattering from uniformly meshed structures.

3 citations

Journal ArticleDOI
TL;DR: In this paper, the authors present an algorithm to evaluate a polynomial at uniformly spaced points on a circle in the complex plane using the starting point for the Jenkins-Traub algorithm.
Abstract: We present an algorithm to evaluate a polynomial at uniformly spaced points on a circle in the complex plane. As an application of this algorithm, a procedure is developed which gives a starting point for the Jenkins-Traub algorithm [5, 6] to compute the zeros of a polynomial.

3 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