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•
25 Apr 2007
TL;DR: In this article, a method of reducing noise in a speech signal using a fast Fourier transform (FFT) is proposed. But the method is not suitable for the frequency domain.
Abstract: A method of reducing noise in a speech signal involves converting the speech signal to the frequency domain using a fast fourier transform (FFT), creating a subset of selected spectral subbands, determining the appropriate gain for each subband, and interpolating the gains to match the number of FFT points. The converted speech signal is then filtered using the interpolated gains as filter coefficients, and an inverse FFT performed on the processed signal to recover the time domain output signal.
16 citations
TL;DR: The Temperton (1985) indexing scheme for the prime factor fast Fourier transform algorithm (PFA-FFT) is generalized to include other prime factor maps and it is found that the updating scheme forThe Ruritanian map can completely avoid the modulo operations required in indexing the data.
Abstract: The Temperton (1985) indexing scheme for the prime factor fast Fourier transform algorithm (PFA-FFT) is generalized to include other prime factor maps. In particular, it is found that the updating scheme for the Ruritanian map can completely avoid the modulo operations required in indexing the data. >
16 citations
01 Dec 2013
TL;DR: A pipeline FFT architecture is proposed, which supports FFT lengths of power-of-two multiple of three and is memory optimal as for N-point transform only N - 1 memory locations are needed.
Abstract: Modern wireless communication systems use orthogonal frequency division multiplexing (OFDM) and multiple input multiple output (MIMO) schemes, which call for fast Fourier transforms (FFT) Traditionally power-of-two FFT lengths have been exploited but recently also non-power-of-two transform lengths have been defined For example, 3GPP LTE specification defines 1536- point FFT In this paper, we propose a pipeline FFT architecture, which supports FFT lengths of power-of-two multiple of three The architecture is basically single delay feedback structure followed by radix-3 computation unit The proposed architecture is memory optimal as for N-point transform only N - 1 memory locations are needed
16 citations
TL;DR: A modeling scheme to decompose the discrete Fourier transform (DFT) matrix recursively into a set of sparse matrices and is able to obtain different FFT representations with less computation operations than state of the arts.
16 citations
09 May 1993
TL;DR: Experimental results are presented which show that using the FFT-based approach is more than an order of magnitude faster than computing the iterates explicitly, even on problems with as few as a thousand volume-filaments.
Abstract: It is noted that including non-ideal ground planes in 3-D inductance extraction programs is computationally expensive, as the ground plane must be finely discretized to ensure that the current distribution throughout the plane is accurately computed. This makes standard volume-element algorithms unsuitable because they require n/sup 2/ computation time and storage, where n is the number of filaments into which the ground plane is discretized. In the present work it is noted that, by using a preconditioned iterative method combined with an FFT (fast Fourier transform)-based algorithm to compute the iterates, one can reduce the computation time to effectively n log n, and substantially reduce required storage. Experimental results are presented which show that using the FFT-based approach is more than an order of magnitude faster than computing the iterates explicitly, even on problems with as few as a thousand volume-filaments. The FFT-based algorithm is compared with a GMRES (generalized minimal residual)-style algorithm.
16 citations