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
Patent•
27 Aug 2009TL;DR: In this article, the optimal pad size of a two-dimensional array of data can be used to increase the processing speed of a signal processor by optimizing run-time for a 2D fast Fourier transform (FFT) operation.
Abstract: Padding or adding data to a data signal can increase the speed with which a signal processor can process the data. Methods are provided herein that can accurately predict the optimal pad size of a two dimensional array of data, which can be used to increase the processing speed of a signal processor by optimizing run-time for a two-dimensional (2-D) fast Fourier transform (FFT) operation.
6 citations
TL;DR: A sublinear randomized algorithm to compute a sparse Fourier transform for nonequispaced data of a special type that already outperforms the INFFT for large but realistic size N and works well even in the situation of a large percentage of missing data and in the presence of large noise.
6 citations
17 Dec 2010
TL;DR: A 3780-point FFT algorithm combining of Good-Thomas, Cooley-Tukey, and WFTA algorithm is presented and its hardware implementation by using shift rules based on the analysis of the finite word length effect shows that the output SNR meets the requirement of TDS-OFDM system.
Abstract: In this paper, a 3780-point FFT algorithm combining of Good-Thomas, Cooley-Tukey, and WFTA algorithm is presented and its hardware implementation by using shift rules based on the analysis of the finite word length effect is described. The simulation results show that the output SNR meets the requirement of TDS-OFDM system.
6 citations
22 Jun 1970
TL;DR: This report serves as documentation for a collection of basic time-series analysis programs written for the CDC 3200 digital computers and is constructed around the fast Fourier transform (FFT) ALGORITHM.
Abstract: : The report serves as documentation for a collection of basic time-series analysis programs written for the CDC 3200 digital computers. These programs are predominantly written in FORTRAN and can be easily adapted to other digital computers. These programs are constructed around the fast Fourier transform (FFT) ALGORITHM. Rather than rediscuss the theory of the FFT algorithm, which is adequately described in the existing literature, this report deals with the practical aspects of the use of the FFT. The problems that can and in many instances do occur in computing spectral estimates are also addressed on the basis of an extensive literature review. (Author)
6 citations
TL;DR: This paper is part 3 of this series of papers, demonstrates the computation of the PSD (Power Spectral Density) and applications of the DFT and IDFT, which include filtering, windowing, pitch shifting and the spectral analysis of re-sampling.
Abstract: This paper is part 2 in a series of papers about the Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT). The focus of this paper is on a fast implementation of the DFT, called the FFT (Fast Fourier Transform) and the IFFT (Inverse Fast Fourier Transform). The implementation is based on a wellknown algorithm, called the Radix 2 FFT, and requires that its’ input data be an integral power of two in length. Part 3 of this series of papers, demonstrates the computation of the PSD (Power Spectral Density) and applications of the DFT and IDFT. The applications include filtering, windowing, pitch shifting and the spectral analysis of re-sampling.
6 citations