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
24 Jun 2011
TL;DR: This work proposes a novel algorithm using 2-bit to store the GPS data, and using 2 the quantization of the local carrier frequency, then, the floating-point calculations has been replaced by bit-wise calculation, and the twiddle factors has been pre-stored using 16-bit 2's complement integer.
Abstract: In a GPS system, the process of acquisition costs most time of the whole, which is due to the large number of required operations in the correlators. Common methods usually use FFT or PFA(Prime Factor Algorithm)to calculate the correlation, choosing float as the data type of the operation, which will obviously increase computational complexity. In consideration of the specific storage mode of GPS data, we propose a novel algorithm using 2-bit to store the GPS data, and using 2-bit to store the quantization of the local carrier frequency, then, the floating-point calculations has been replaced by bit-wise calculation, and the twiddle factors has been pre-stored using 16-bit 2's complement integer. In this method, FFT will be performed only with integer arithmetic. Experiments show the significant performance and efficiency improvements of the proposed algorithm
1 citations
TL;DR: In this article, the relative coordinate vectors of the lines were extracted from 2D engineering graphics for constructing a 1D complex signal, and watermark was embedded into the module of fractional Fourier transform coefficients of the complex signal based on the relationship between the values of watermark and transform coefficients.
Abstract: A new method of digital watermarking for two-dimensional engineering graphics was proposed,In this method,the relative coordinate vectors of the lines were extracted from 2D engineering graphics for constructing a 1D complex signal.Watermark was embedded into the module of fractional Fourier transform coefficients of the complex signal based on the relationship between the values of watermark and transform coefficients.It is a blind watermarking algorithm due to the fact that watermark can be extracted without original engineering graphic.Experimental results show that the proposed algorithm is robust against the attacks such as moving,rotation,scaling,and is also safe towards illegal information extraction.
1 citations
03 Apr 1990
TL;DR: A nesting scheme type of prime factor algorithm (PFA) is introduced that takes advantage of both the PFA and the Winograd Fourier transform algorithm (WFTA) by developing a new nesting scheme and modifying the small-N discrete Fouriertransform (DFT) algorithms.
Abstract: A nesting scheme type of prime factor algorithm (PFA) is introduced. It takes advantage of both the PFA and the Winograd Fourier transform algorithm (WFTA) by developing a new nesting scheme and modifying the small-N discrete Fourier transform (DFT) algorithms. This new nesting scheme will not expand the data in the nesting multiplication part. It requires far fewer multiplications and fewer additions than the PFA. In addition, data transfer between the main array and the temporary array, which is needed by the WFTA, is avoided, and it can be implemented in place and in order. >
1 citations
03 May 1993
TL;DR: The approach brings a new technique for the computation of the twiddle-factor free multidimensional FFT which is applicable to a range of situations considerably broader than that allowed by the multiddimensional prime factor FFT of Guessoum and Merserau.
Abstract: Twiddle-factors elimination in the multidimensional fast Fourier transform (FFT) is approached using changes of basis, either in the signal or in the transform domain, as tools for generating FFT algorithms. The approach brings a new technique for the computation of the twiddle-factor free multidimensional FFT which is applicable to a range of situations considerably broader than that allowed by the multidimensional prime factor FFT of Guessoum and Merserau. The approach allows the determination of a family of FFT algorithms with computational complexity intermediate between that of the M-D Cooley-tukey FFT and that of the M-D prime factor FFT. >
1 citations
Journal Article•
TL;DR: An algorithm computing the inverse of matrix for Joint Detection base on improved Block-FFT algorithm is investigated according to the character of the TD-SCDMA system and to the flexible application of the property of the block-circulant matrix.
Abstract: Joint Detection is one of crucial techniques of TD-SCDMA system.The design of the computation of the inverse of the matrix algorithm is a substantial factor affecting the complexity of Joint Detection.An algorithm computing the inverse of matrix for Joint Detection base on improved Block-FFT algorithm is investigated according to the character of the TD-SCDMA system and to the flexible application of the property of the block-circulant matrix.Simulation results indicate that the proposed algorithm exhibits same BER performance with the widely used standard Cholesky decomposition algorithm and approximate Cholesky decomposition algorithm,while its time complexity and space complexity are sharply decreased,thus enhancing implement possibility of the proposed algorithm.
1 citations