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 published on a yearly basis
Papers
More filters
01 Jun 2016
TL;DR: The butterfly of analog Cooley-Tukey algorithm is provided, which requires less complex operations of additional and multiplication than the standard method, and runs 1.5 times faster than analogue in Matlab.
Abstract: One- and two-dimensional (2D) fast Fourier transform (FFT) algorithms has been widely used in digital processing. 2D discrete Fourier transform is reduced to a combination of one-dimensional FFT for all coordinates due to the increased complexity and the large amount of computation by increasing dimension of the signal. This article provides the butterfly of analog Cooley-Tukey algorithm, which requires less complex operations of additional and multiplication than the standard method, and runs 1.5 times faster than analogue in Matlab.
6 citations
TL;DR: The proposed OTD-FFT technique, the FFT computation of an online sampled data sequence is optimally distributed among all the sampling periods without increasing the total computational complexity, arriving at the minimal per-sampling-period computational complexity.
6 citations
03 Jul 2014
TL;DR: Split-radix algorithm is an appropriate algorithm for the implementation of FFT among all the effective algorithms of F FT, because it reduces number of arithmetic operations to great extent and satisfies the requirement of high speed.
Abstract: Mathematical applications such as DFT and convolution are two main and common operations in signal processing applications. Many other Signal processing algorithms such as filter, spectrum estimation and OFDM can be transformed into DFT to implement in hardware. FFT is the collection of group of algorithms that performs the DFT at higher speed. FFT is indispensable in most signal processing applications, so the designing of an appropriate algorithm for the implementation of FFT can be most important in Most of the digital signal processing. The techniques such as pipelining and parallel calculations have potential impacts on VLSI implementation of FFT algorithm. By theoretical observations Split-radix algorithm is an appropriate algorithm for the implementation of FFT among all the effective algorithms of FFT, because it reduces number of arithmetic operations to great extent. At the requirement of high speed, an algorithm that is best for high speed implementation is to be found. This algorithm performs well in the implementation of FPGA and ASIC, satisfies the requirement of high speed.
6 citations
26 Jun 2013
TL;DR: A fast Fourier transform algorithm over symmetric group S-sub-n, which consists of O(n)>(n) multiplications of unitary matrices, and then transform it into a quantum circuit form.
Abstract: This paper proposes an O(n4) quantum Fourier transform (QFT) algorithm over symmetric group Sn, the fastest QFT algorithm of its kind. We propose a fast Fourier transform algorithm over symmetric group Sn, which consists of O(n3) multiplications of unitary matrices, and then transform it into a quantum circuit form. The QFT algorithm can be applied to constructing the standard algorithm of the hidden subgroup problem.
6 citations
TL;DR: A simple fast Fourier transformation (FFT) algorithm has been specifically adapted to calculate the experimental radial distribution function and its greatest advantage is its internal consistency—the ability to exactly transform back to the original domain.
Abstract: A simple fast Fourier transformation (FFT) algorithm has been specifically adapted to calculate the experimental radial distribution function. The number of equi-spaced data points must be a power of two [N = 2n for integer n] and must be greater than the Nyquist frequency [N = 2(rmax) (smax)/2π]. When properly defined, the data set is expanded as an odd function. The greatest advantage of the FFT algorithm is its internal consistency—the ability to exactly transform back to the original domain.
6 citations