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
Proceedings ArticleDOI
27 Apr 1993
TL;DR: An algorithm for fast adaptive filtering that applies a FFT (fast Fourier transform)-based iterative method and uses sliding data windows involving block updating and downdating computations and computes the tap weight filter vector in O(L log N) operations.
Abstract: An algorithm for fast adaptive filtering is proposed. The algorithm applies a FFT (fast Fourier transform)-based iterative method and uses sliding data windows involving block updating and downdating computations. The method is stable and robust, and computes the tap weight filter vector in O(L log N) operations, where the sliding window Toeplitz data matrix X is L-by-N. The complexity thus generally lies between those of the family of unstable but fast, O(N), methods and the stable but slow O(N/sup 2/) Cholesky factor updating methods. >

14 citations

Proceedings ArticleDOI
01 Dec 2006
TL;DR: A low multiplier and multiplication complexities 256-point fast Fourier transform (FFT) architecture, especially for WiMAX 802.16a systems, based on the radix-16 FFT algorithm, which needs less complexity than both complexities of the previous FFT structures in 256- point FFT applications.
Abstract: In this paper, we propose a low multiplier and multiplication complexities 256-point fast Fourier transform (FFT) architecture, especially for WiMAX 802.16a systems. Based on the radix-16 FFT algorithm, the proposed FFT architecture utilizes cascaded simplified radix-24 single-path delay feedback (SDF) structures. The control circuit of the proposed simplified radix-24 SDF FFT architecture is simple. The hardware requirement of the proposed FFT architecture only needs 1 complex multiplier and 56 complex adders for supporting 256-point computations. The computation complexity of multiplications and the hardware complexity of the proposed FFT architecture need less complexity than both complexities of the previous FFT structures in 256-point FFT applications. In hardware verifications, the output throughput rate of our FFT design processes up to 35.5M samples/sec with Xilinx Virtex2 1500 FPGA, and it processes up to 51.5M samples/sec with UIMC 0.18?m standard cell technology. The throughput rate of this implementation is suitable for WiMLAX 802.16a application, whose maximum sample rate is 32MHz.

14 citations

Journal ArticleDOI
TL;DR: An efficient algorithm (involving real arithmetic only) for N-point DFT is developed and used as the basic building block for developing the real valued fast Fourier transform (FFT).
Abstract: The authors earlier developed a fast recursive algorithm for the discrete sine transform (see IEEE Trans. Acoust. Speech Signal Process., vol.38, no.3, p.553-7, 1990). This algorithm is used as the basic building block for developing the real valued fast Fourier transform (FFT). It is assumed that the input sequence is real and of length N, an integer power of 2. The N-point discrete Fourier transform (DFT) of a real sequence can be implemented via the real (cos DFT) and imaginary (sin DFT) components. The N-point cos DFT in turn can be developed from N/2-point cos DFT and N/4-point discrete sine transform (DST). Similarly, the N-point sin DFT can be developed from N2-point sin DFT and N/4-point DST. Using this approach, an efficient algorithm (involving real arithmetic only) for N-point DFT is developed. >

14 citations

Journal ArticleDOI
01 Aug 1997
TL;DR: A new pruning method for an FFT type of transform structure is proposed, whose novelty lies in the fact that it is able to complete a previously pruned transform or to progress from one level of pruning to another.
Abstract: A new pruning method for an FFT type of transform structure is proposed. Its novelty lies in the fact that, besides being able to prune the transform, it is able to complete a previously pruned transform or to progress from one level of pruning to another. The method can be directly applied to fast progressive image coding.

14 citations

Proceedings ArticleDOI
O.K. Ersoy1, N.C. Hu1
11 Apr 1988
TL;DR: The fast real Fourier transform (FRFT) algorithms discussed are the radix-2 decimation-in-time (DIT), theRadix-4 DIT, the split-radix DIF, the prime factor, and the Winograd FRFT algorithm.
Abstract: Fast algorithms for the computation of the real discrete Fourier transform (RDFT) are discussed. Implementations based on the RDFT are always efficient, whereas the implementations based on the DFT are efficient only when signals to be processed are complex. The fast real Fourier transform (FRFT) algorithms discussed are the radix-2 decimation-in-time (DIT), the radix-4 DIT, the split-radix DIT, the split-radix DIF, the prime factor, and the Winograd FRFT algorithm. >

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