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.

Phase measurement of three-phase power based on all-phase FFT 1

Abstract: When the Three-phase power signal containing multiple harmonics signal, there is a clear error that FFT algorithm is used directly to measure the phase, even with the various correction methods such as ratio method, center of energy gravity method etc. precision is severely constrained by harmonic signal. To solve these problems, a modified FFT algorithm, which is all-phase FFT, is used to measure the phase difference of three-phase power. The algorithm makes phase measurement accuracy significantly improve. More importantly, the way is almost free from harmonic noise, and easily implements in hardware to meet real-time measurement of power system requirements.

A new discrete wavelet transform fast algorithm with rational dilation factor

Abstract: While in the process of decomposition of the Mallat discrete wavelet transform (DWT) fast algorithm, the algorithm has a drawback, that is, there is frequency distortion in the high frequency subband. In this paper, a new algorithm of decomposition and reconstruction in the discrete wavelet is presented. The algorithm can solve the frequency distortion in the high frequency subband in the process of decimation in each level. The simulation of numerical value example tests the validity of the algorithm.

Variants of the Winograd multiplicative FFT algorithms and their implementation on IBM RS/6000

Abstract: Variants of the Winograd (1976, 1980) multiplicative FFT (fast Fourier transform) algorithm for transform sizes of primes and product of primes are derived, which take advantage of a computer architecture with a multiply-add feature For processors which perform floating-point addition, floating-point multiplication, and the floating-point multiply-add in one computer clock cycle, FFT algorithms can be designed such that all the floating-point multiplications can be overlapped by using multiply-adds Implementation of multiply-add algorithms on an IBM RS/6000 is discussed The use of a tensor product formulation throughout gives a means for producing variants of algorithms matching computer architectures >

Implementation of 'multiply-add' FFT algorithms for complex and real data sequences

Abstract: Multiply-add FFT algorithms are FFT algorithms that take advantage of computer architectures with a multiply-add feature. Various FFT algorithms can be implemented on this type of architecture to give the multiplications for free. In the present work, some of these FFT algorithms are reviewed: the split-radix FFT algorithm for 2/sup k/ transform sizes, the multiplicative algorithms for prime transform sizes, and the prime factor algorithm for transform sizes with relatively prime factors. Both complex and real data sequences are considered, and operational counts are evaluated in terms of total floating-point operations. Tensor product formulation is used throughout for producing variants of algorithms matching to computer architecture. >

Fast interpolation of n-dimensional signal by subsequence FFT

Abstract: Based on the differential property of Fourier transform and the Taylor expansion of a n-variables function, the subsequence interpolating algorithm is extended to a general n-dimensional signal. As the interpolating process is consisted of a few parallel inverse FFT with the same size as the forward FFT, it is very efficient and is suitable for parallel processing.