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
07 Jul 2013
TL;DR: An out-of-core algorithm that reduces the main memory requirement of FFT-accelerated time-marching methods is proposed.
Abstract: An out-of-core algorithm that reduces the main memory requirement of FFT-accelerated time-marching methods is proposed.

2 citations

Proceedings ArticleDOI
01 Dec 2007
TL;DR: A 2K/8K point FFT (Fast Fourier Transform) for OFDM (Orthogonal Frequency Division Multiplexing) of DVB-T (Digital Video Broadcast Terrestrial) Receiver is proposed based on the Radix-2/Radix-4 FFT algorithm and uses block floating point scaling technique in order to increase SQNR.
Abstract: We propose a 2K/8K point FFT (Fast Fourier Transform) for OFDM (Orthogonal Frequency Division Multiplexing) of DVB-T (Digital Video Broadcast Terrestrial) Receiver. The proposed FFT architecture utilizes cascaded radix-4 Single Path Feedback (SDF) structure based on the Radix-2/Radix-4 FFT algorithm. We use block floating point scaling technique in order to increase SQNR. The 2K/8K FFT consists of 5 cascaded stages of radix-4 and 3 stages of radix-2 butterfly units. The SQNR of 58 dB is achieved with 10-bit data input, 14-bit internal data and twiddle factors, and 18-bit data output. The core has 91800 gates with 184284 bits of Ram and 33572 bits of ROM using 0.18 um CMOS technology.

2 citations

Journal ArticleDOI
TL;DR: This paper presents a new method of implementing the fast Fourier transform (FFT) algorithm that efficiently utilizes computer time to perform the FFT computation while data acquisition proceeds so that local butterfly modules are built using the data points that are already available.
Abstract: On-line running spectral analysis is of considerable interest in many electrophysiological signals, such as the EEG (electroencephalograph). This paper presents a new method of implementing the fast Fourier transform (FFT) algorithm. Our "real-time FFT algorithm" efficiently utilizes computer time to perform the FFT computation while data acquisition proceeds so that local butterfly modules are built using the data points that are already available. The real-time FFT algorithm is developed using the decimation-in-time split-radix FFT (DIT sr-FFT) butterfly structure. In order to demonstate the synchronization ability of the proposed algorithm, the authors develop a method of evaluating the number of arithmetic operations that it requires. Both the derivation and the experimental result show that the real-time FFT algorithm is superior to the conventional whole-block FFT algorithm in synchronizing with the data acquisition process. Given that the FFT sizeN=2 r , real-time implementation of the FFT algorithm requires only 2/r the computational time required by the whole-block FFT algorithm.

2 citations

Proceedings ArticleDOI
14 Dec 2015
TL;DR: A novel sliding window algorithm is presented for fast computing 2D DFT when sliding window shifts more than one-point and the theoretical analysis shows that the computational complexity is equal to 2D SDFT when one sample comes into current window.
Abstract: Discrete Fourier transform (DFT) is one of the most wildly used tools for signal processing. In this paper, a novel sliding window algorithm is presented for fast computing 2D DFT when sliding window shifts more than one-point. The propose algorithm computing the DFT of the current window using that of the previous window. For fast computation, we take advantage of the recursive process of 2D SDFT and butterfly-based algorithm. So it can be directly applied to 2D signal processing. The theoretical analysis shows that the computational complexity is equal to 2D SDFT when one sample comes into current window. As well, the number of additions and multiplications of our proposed algorithm are less than those of 2D vector radix FFT when sliding window shifts mutiple-point.

2 citations

Posted Content
TL;DR: A Fast algorithm for the Discrete Hartley Transform (DHT) is presented, which resembles radix-2 fast Fourier Transform (FFT) and brings some light about the deep relationship between fast DHT algorithms and a multiplication-free fast algorithm forThe Hadamard Transform.
Abstract: A Fast algorithm for the Discrete Hartley Transform (DHT) is presented, which resembles radix-2 fast Fourier Transform (FFT). Although fast DHTs are already known, this new approach bring some light about the deep relationship between fast DHT algorithms and a multiplication-free fast algorithm for the Hadamard Transform.

2 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