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
DOI
01 Dec 1987
TL;DR: The described transform method, a link between an FFT and a single DFT sum, is compared with the use of separate DFT sums and offers improved accuracy and applicability relative to the existing type of zoom transform.
Abstract: After a brief review of discrete Fourier transformation (DFT) — and fast Fourier transformation (FFT) — properties, two representatives of partial (narrowband) spectrum computation methods, the zoom FFT and a specific type of zoom transform, are introduced. With respect to the FFT, only the zoom transform sufficiently fits demands concerning memory space and computional speed. Moreover, it offers improved accuracy and applicability relative to the existing type of zoom transform. The described transform method, a link between an FFT and a single DFT sum, is compared with the use of separate DFT sums.

12 citations

Proceedings ArticleDOI
26 Apr 1985
TL;DR: A new multidimensional Hartley transform is defined and a vector-radix algorithm for fast computation of the transform is developed that is shown to be faster (in terms of multiplication and addition count) compared to other related algorithms.
Abstract: A new multidimensional Hartley Transform is defined and a vector-radix algorithm for fast computation of the transform is developed. The algorithm is shown to be faster (in terms of multiplication and addition count) compared to other related algorithms.

11 citations

Journal ArticleDOI
TL;DR: The proposed algorithm has a structure similar to the split-radix algorithm used for the computation of the FFT, the same computational complexity as the direct fast cosine algorithms and a high regularity which facilitates its implementation in VLSI technology.
Abstract: An extension of an existing fast algorithm for the computation of the discrete cosine transform is presented. The proposed algorithm has a structure similar to the split-radix algorithm used for the computation of the FFT, the same computational complexity as the direct fast cosine algorithms and a high regularity which facilitates its implementation in VLSI technology. A comparison on different computer architectures shows that the proposed algorithm is superior to existing algorithms in terms of execution time.

11 citations

Journal ArticleDOI
TL;DR: An algorithm for computing the discrete Fourier transform of data with threefold symmetry axes is presented, which reduces the computational complexity of such a Fouriertransform by a factor of 3.
Abstract: An algorithm for computing the discrete Fourier transform of data with threefold symmetry axes is presented. This algorithm is straightforward and easily implemented. It reduces the computational complexity of such a Fourier transform by a factor of 3. There are no restrictive requirements imposed on the initial data. Explicit formulae and a scheme of computing the Fourier transform are given. The algorithm has been tested and benchmarked against FFT on the unit cell, revealing the expected increase in speed. This is a non-trivial example of a more general approach developed recently by the authors.

11 citations

Journal ArticleDOI
TL;DR: A new relationship between the IDCT and the discrete Fourier transform (DFT) is established that allows the evaluation of two simultaneous N-point IDCTs by computing a single FFT of the same dimension.
Abstract: This paper reconsiders the discrete cosine transform (DCT) algorithm of Narashima and Peterson (1978) in order to reduce the computational cost of the evaluation of N-point inverse discrete cosine transform (IDCT) through an N-point FFT. A new relationship between the IDCT and the discrete Fourier transform (DFT) is established. It allows the evaluation of two simultaneous N-point IDCTs by computing a single FFT of the same dimension. This IDCT implementation technique reduces by half the number of operations.

11 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