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.

A large pair of twin primes

Abstract: We describe an efficient integer squaring algorithm (involving the fast Fourier transform modulo F 8 ) that was used on a 486 computer to discover a large pair of twin primes.

Implementation of Fast Fourier Transforms on Digital Signal Processors

Abstract: Based on the features of digital signal processors, the fast Fourier transform algorithms, including radix-2, radix-4, split-radix and the Bruun FFT, and their implementation on the TMS320C30 are investigated in this paper Efficient FFT algorithms and programs are developed

О модификации быстрого одномерного преобразования Фурье по алгоритму Кули-Тьюки

Abstract: In the present paper we give the description a method of finding the discrete Fourier Transform, which allows to reduce the cost of computer time to calculate compared to the classical algorithm. Fast algorithms for calculating the Fourier transform are very relevant and actual, they have many applications in problems of digital processing of one-dimensional and multi-dimensional signal and processing of different images, for example, satellite images. A common algorithm is a sequential calculation of the one-dimensional Discrete Fourier Transform by rows and columns. There are various methods of acceleration of the algorithm, one of which is implemented in this article. It is presented the software implementation of the modified algorithm of Cooley-Tukey analog for the Discrete Fourier Transform for the one-dimensional signal with the number of counts p · 2 s, p, s N. For this algorithm, we developed a program in the computer algebra system MATLAB. It has been tested on a set consisting of a 16384 counts of one-dimensional signal. The time of calculations for the classical algorithm and for modified algorithm of Fast Fourier Transform is carried out. As a result, the average computer time for the modified algorithm gives about 20 % time reduction. In addition, in the article it is provided a general description of the Discrete Fourier Transform algorithm and indicated opportunities for increasing of the speed of computing. Also, it is considered a modified algorithm of Cooley-Tukey analog for the Fast Fourier Transform of one-dimensional and multidimensional signals.

Power system fraction harmonic analysis based on prony algorithm

Abstract: The conventional harmonic measurement algorithm fast Fourier transform (FFT) can't be used to accurately analyze fraction harmonics due to its leakage and picket {ence effects.This paper introduces Prony algorithm to analyze the fraction harmonics of power networks.The algorithm can be used to accurately ana- lyze the phase,amplitude and frequency of fraction harmonics,so the algorithm gives a new method for the fraction harmonics analysis of power system.Numerical example is provided to demonstrate the feasibility of the proposed algorithm.

Design and Implementation of WFTA based on FPGA

Abstract: Winograd Fourier Transform algorithm(WFTA),reducing the multiplications with decomposition of the twiddle factors,is an efficient implementation of FFT processor.With 256 point FFT as an example,this paper gives the FPGA realization of large FFT.Simulation results indicate that the proposed FFT processor requires only half multiplications as compared to the radix-2 FFT and 2/3 multiplications to the radix-4 FFT.The processor could complete the computation of a FFT in 5.8μs with 100MHz work frequency,and satisfy the requirement of high-speed,real-time operation.