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.

Pipeline optimizations of the prime factor algorithm

Abstract: The prime factor algorithm (PFA) is an efficient discrete Fourier transform (DFT) computation algorithm used when the sequence length can be decomposed into mutually prime factors. Following our previous results on PFA decomposition carried out at Caltech on hypercube machines, we present in the paper a pipeline PFA implementation suitable for multiprocessor systems with distributed memory. This implementation achieves high values of efficiency and speed-up when processing multiple sequences of data. The paper shows how an optimized structure can be obtained when the concurrency among computation and communications is exploited at each node of the pipe. Experimental results obtained on transputer-based structures and on the Intel Touchstone Delta system are also reported.

Prime factor FFT for modern computers

Abstract: In the paper construction of efficient prime factor FFT algorithms for computers with hierarchical memory and possibly more than one processor is addressed Accordingly to observations done for FFTW, FFTs constructed of 32-point or similar-sized butterflies are the best, hence, it is postulated to implement highly efficient 15-, 31-, and 63-point DFT algorithms for the prime factor FFTs The novel form of arithmetical complexity criterion is proposed, and applied in optimization of small-N DFT modules The data transfer count analysis show that prime factor FFTs are much better from this point of view than common factor FFTs It is then shown that indeed, prime factor FFTs containing 15-point, and especially 63-point modules may easily outperform FFTs for data sizes being powers of number 2

Performance comparison of fourier algorithm to minimum square algorithm in protection

Abstract: According to the formula of Fourier algorithm and minimum square algorithm,the impact of attenuated DC fraction on both algorithm was simulated by Fortran77 program.The measurement accuracy of fundamental fraction and noises fraction in both algorithm were simulated when the input signal including noises.The influence of waving frequency of the grid on both algorithm was compared.The influence of sampling frequency on both algorithm was analyzed.

A fast algorithm for determining the linear complexity of periodic sequences

Abstract: A fast algorithm is presented for determining the linear complexity and the minimal polynomial of periodic sequences over GF(q) with period q n p m, where p is a prime, q is a prime and a primitive root modulo p2. The algorithm presented here generalizes both the algorithm in [4] where the period of a sequence over GF(q) is p m and the algorithm in [5] where the period of a binary sequence is 2 n p m . When m=0, the algorithm simplifies the generalized Games-Chan algorithm.

Anti-aliasing nonstationary signals detecion algorithm based on interpolation in the frequency domain using the short time Fourier transform

Abstract: To eliminate the aliasing that appeared during the measurement of multi-components nonstationary signals, a novel kind of anti-aliasing algorithm based on the short time Fourier transform (STFT) is brought forward. First the physical essence of aliasing that occurs is analyzed; second the interpolation algorithm model is setup based on the Hamming window; then the fast implementation of the algorithm using the Newton iteration method is given. Using the numerical simulation the feasibility of algorithm is validated. Finally, the electrical circuit experiment shows the practicality of the algorithm in the electrical engineering.