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: An algorithm for striking method of system frequency changes based on Fourier that can accurately measure the power system fundamental frequency and is able to meet the powerSystem frequency measurement accuracy and real-time requirements is proposed.
Abstract: The information of the sine signal filtered by Fourier algorithm is analyzed and the conclusion is achieved that the real part and imaginary part of the phasor gained by Fourier algorithm satisfy an identical equation with the shifting of the data window. Based on which,this paper proposes an algorithm for striking method of system frequency changes based on Fourier that can accurately measure the power system fundamental frequency.In order to verify the effectiveness of the algorithm,signals of non-harmonic,signals containing harmonics, and frequency of dynamic changes are simulated respectively. The test results prove that the method is simple,accurate,and is able to meet the power system frequency measurement accuracy and real-time requirements.

1 citations

Journal ArticleDOI
TL;DR: A fast algorithm is proposed for computing a length-N=6m DFT that is a blend of radix-3 and radIX-6 FFT, and shows that its implementation requires less real operations as compared with the published algorithms.
Abstract: Discrete Fourier transform (DFT) is widespread used in many fields of science and engineering. DFT is implemented with efficient algorithms categorized as Fast Fourier Transform. A fast algorithm is proposed for computing a length-N=6m DFT. The proposed algorithm is a blend of radix-3 and radix-6 FFT. It is 2rx3m variant of split radix and can be flexibly implemented a length DFT. Novel order permutation of sub-DFTs and reduction of the number of arithmetic operations enhance the practicability of the proposed algorithm. It inherently provides a wider choice of accessible FFT’s lengths. The proposed algorithm shows that its implementation requires less real operations as compared with the published algorithms. The pending update to system Verilog contains several new packages and functions. The new packages include support for both fixed-point and floating-point binary math. These fully Non-synthesizable packages will raise the level of abstraction in System Verilog. DSP applications, which previously needed an independent processor core, or required very difficult manual translation, can now be performed within your system Verilog source code. In addition, Schematic-based DSP algorithms can now be translated directly to System Verilog.

1 citations

01 Jan 2014
TL;DR: In the proposed ESPRIT algorithm, the FFT is applied to a signal sample and the harmonic coefficients with larger modulus are selected to construct two new data arrays with a retational invariant.
Abstract: The performance of ESPRIT(estimated signal parameters via rotational invariance technique) algorithm about frequency estimation is obviously declined when the SNR(signal to niose ratio) of signal is relatively low.Aiming at this problem,an ESPRIT algorithm based on FFT rotational invariance is presented.In the proposed algorithm,firstly,the FFT(fast Fourier transform) is applied to a signal sample.Then the harmonic coefficients with larger modulus are selected to construct two new data arrays with a retational invariant.Finally,ESPRIT algorithm is used to estimate harmonic frequencies.Theoretical analysis and simulation results show that the proposed algorithm is effective and feasible.

1 citations

Proceedings ArticleDOI
01 Apr 1983
TL;DR: A new architecture for a DFT processor, based on the prime factor algorithm (PFA) is proposed, which offers very high throughput rates and is well matched to present LSI implementation capabilities.
Abstract: A new architecture for a DFT processor, based on the prime factor algorithm (PFA) is proposed. This processor offers very high throughput rates and is well matched to present LSI implementation capabilities. A new indexing scheme for the PFA is also presented, which results in an in-place and in-order flexible algorithm.

1 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