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.

Parallel Computing of the FFT and of Spectral Filtering with Few to No Complex-Valued Operations

Abstract: Accurate and faster computation of the Fast Fourier Transform (FFT) using parallel computing is the result of a novel algorithm called FFTpc described in this paper. As opposed to the Cooley-Tukey FFT, the FFTpc uses only real-valued operations until the very last step. Filtering in parallel in the frequency domain is done on data subsets that are processed simultaneously with no data interchange between processors through the main parts of the filtering process. In addition, if the user only requires the magnitude of the transform, the algorithm involves no complex-valued operations at all. Many other novel aspects of the FFTpc and both estimated and actual speedups are reported.

An Approximating Twiddle Factor Coefficient Based Multiplier for Fixed-Point FFT

Abstract: Fast Fourier Transform (FFT) is playing an important role in signal processing. This paper proposes a FFT -specific approximate multiplier design to improve the energy efficiency. The approximate multiplier is based on the approximated twiddle factor and compressor to reduce the energy during partial product accumulation. Instead of complex arithmetic operations, the design can achieve reduced power consumption and hardware cost with limited error.

A Review of On-Chip Spectral Analysis for Built-In Testing Using FFT Engine

Abstract: On chip Built in testing of electronic equipment is very much necessary because customers are demanding more value for their money spent on electronic gadgets. The accurate and efficient analysis requires use of a very precise hardware and software. Also full understanding of test signals and system is required to perform spectrum analysis. FFT (Fast Fourier Transform algorithm) is the technique which is used to perform built in test and calibration with the help of test signals with certain inter modulation component and harmonic component. In this paper we have reviewed advancements in on chip testing algorithms using FFT as a test engine.

Singular value decomposition transform with an FFT-based algorithm on the connection machine CM5

Abstract: We describe in this paper the parallel implementation of a modified, high radix fast Fourier transform (FFT) together with a Jacobi-based algorithm for matrix factorization to compute the singular value decomposition (SVD) of a 16384/spl times/16384 projection normal matrix arising from probability measure estimation in positron emission tomography (PET) We simplify the analysis significantly by working with block matrices and the Kronecker products because the symmetries built into the orthogonal decompositions allow the computation of the various factorizations of interest