scispace - formally typeset
Search or ask a question
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
More filters
Journal ArticleDOI
TL;DR: An algorithm is proposed for computing the Fourier Transform (FT) of a uniformly sampled signal at arbitrary frequencies and its computational aspects and its error behavior with typical signals have been critically examined.
Abstract: An algorithm is proposed for computing the Fourier Transform (FT) of a uniformly sampled signal at arbitrary frequencies. In most of the applications, the algorithm retains the computational efficiency of the Fast Fourier Transform (FFT) algorithm. The method is based on the fact that the FT at an arbitrary frequency can be expressed as a weighted sum of its Discrete Fourier Transform (DFT) coefficients. In the proposed method, these weights are suitably approximated so that the desired FT is very nearly the sum of (i) a few dominant terms of the sum of the DFT which are computed directly, and (ii) the DFT of a new sequence obtained by multiplying the original sequence with a sawtooth function. The number of directly computed terms is so chosen that the error of approximation does not exceed the specified limits. The computational aspects of the algorithm and its error behavior with typical signals have been critically examined.

14 citations

Journal ArticleDOI
TL;DR: A simple modification of the FFT algorithm that results in an efficient method for calculating the transform only at evenly spaced frequencies on a logarithmic scale is proposed.
Abstract: A standard fast Fourier transform (FFT) computes the transform at evenly spaced points on a linear scale. A simple modification of the FFT algorithm that results in an efficient method for calculating the transform only at evenly spaced frequencies on a logarithmic scale is proposed. The saving in the number of operations, compared with a standard FFT, is approximately 60% for typical values. >

14 citations

Journal ArticleDOI
01 Jul 1990
TL;DR: The paper presents the in-place implementation of the multidimensional radix 2 fast Fourier transform (FFT), along with the corresponding algorithm for data shuffling (bit-reversal) on SIMD hypercube computers.
Abstract: The paper presents the in-place implementation of the multidimensional radix 2 fast Fourier transform (FFT), along with the corresponding algorithm for data shuffling (bit-reversal) on SIMD hypercube computers. Each processor possesses its own non-shared memory, the number of processors being less than or equal to the number of data. The flexibility of the proposed algorithm is based on the scheme of information storage that has been chosen and in the decomposition/configuration of the hypercube in subhypercubes that allow the parallel processing of multiple one-dimensional FFTs. This parallel FFT algorithm has an optimum performance, since the data redundancy is null and the algorithmic complexity is optimum. >

14 citations

Journal ArticleDOI
TL;DR: This correspondence describes a new bit-reversal permutation algorithm based on a trivial symmetry that has not been exploited until now that outperforms the fastest algorithms known to the author.
Abstract: This correspondence describes a new bit-reversal permutation algorithm based on a trivial symmetry that has not been exploited until now. According to timing experiments, this algorithm outperforms the fastest algorithms known to the author. This is of interest for applications using intensive fast Fourier transforms (or fast Hartley transforms) of constant length, such as transform domain adaptive filtering.

14 citations

Journal ArticleDOI
TL;DR: A decimation-in-frequency vector split-radix algorithm that possesses the in-place property and needs no matrix transpose to decompose an N*N 2D discrete Hartley transform into one and twelve DHTs.
Abstract: A decimation-in-frequency vector split-radix algorithm is proposed to decompose an N*N 2D discrete Hartley transform (DHT) into one (N/2)*(N/2) DHT and twelve (N/4) DHTs. The proposed algorithm possesses the in-place property and needs no matrix transpose. Its computational structure is very regular and is simpler than those of all existing nonseparable 2D DHTs. >

14 citations


Network Information
Related Topics (5)
Wavelet
78K papers, 1.3M citations
81% related
Robustness (computer science)
94.7K papers, 1.6M citations
78% related
Feature extraction
111.8K papers, 2.1M citations
77% related
Support vector machine
73.6K papers, 1.7M citations
76% related
Optimization problem
96.4K papers, 2.1M citations
76% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20235
202224
20211
20188
201757
201692