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
07 Apr 1986
TL;DR: A considerable increase in accuracy can be obtained with only a small penalty in execution time, by applying an alternating form of rounding rather than truncation to the discrete Fourier transform calculation.
Abstract: The calculation of the discrete Fourier transform using a fast Fourier transform (FFT) algorithm with fixed-point arithmetic is considered. The input data is scaled to prevent overflow and to maintain accuracy. The implementation uses 16-bit fixed-point representation for the data and provides for double precision accumulation of sums and products. Algorithm variants as well as different rounding options are compared. Execution times for implementations based on a single chip signal processor are given. These show that a considerable increase in accuracy can be obtained with only a small penalty in execution time, by applying an alternating form of rounding rather than truncation.
21 citations
Patent•
15 Aug 2003TL;DR: In this article, the received vector versions are extended and approximated as block circulant matrices, and a diagonal matrix of each of the extended and approximate system and covariance matrices are determined by prime factor algorithm -fast Fourier transform (PFA-FFT) without division of the matrix.
Abstract: K data signals, or bursts, are transmitted over a shared spectrum in a code division multiple access communication format. A combined signal is received and sampled over the shared spectrum, as a plurality of received vector versions. The combined signal includes the K transmitted data signals. A plurality of system matrices and an associated covariance matrix using codes and estimated impulse responses of the K data signals is produced. Each system matrix corresponds to a received vector version. The system and covariance matrices are extended and approximated as block circulant matrices. A diagonal matrix of each of the extended and approximated system and covariance matrices are determined by prime factor algorithm - fast Fourier transform (PFA-FFT) without division of the matrix. The received vector versions are extended. A product of the diagonal matrices and the extended received vector versions is taken. An inverse block discrete Fourier transform is performed by a PFA-FFT on a result of the product to produce the estimated data of the K data signals.
21 citations
TL;DR: A high-performance parallel three-dimensional fast Fourier transform (FFT) algorithm on clusters of PCs is proposed and it is shown that the block three- dimensional FFT algorithm improves performance by utilizing the cache memory effectively.
21 citations
TL;DR: In this paper, the problems of applying the FFT algorithm to the method of Gardner et al. for analysing multicomponent exponential decay curves are discussed, and improvements on Schlesinger's approach are indicated.
21 citations
TL;DR: A new parallel FFT algorithm is proposed that removes the complex multiplier between the two pipeline stages and simplifies the address generation of twiddle factors and reduces the number of twiddles to a minimum.
Abstract: Usually, parallel pipelined FFT processors are used to compute long FFTs due to high processing rate and easy implementation. The efficient VLSI implementation of each FFT processor at the pipelines is a critical problem to be considered. We propose a new parallel FFT algorithm that removes the complex multiplier between the two pipeline stages. The new algorithm also simplifies the address generation of twiddle factors and reduces the number of twiddle factors to a minimum. With the new algorithm, each FFT processor at the pipelines can be integrated easily onto a single chip.
21 citations