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 efficient algorithm for computing radix-3/9 discrete Hartley transforms (DHTs) is presented and it is shown that the Radix- 3/9 fast Hartley transform (FHT) algorithm reduces the number of multiplications required by a radIX-3 FHT algorithm for nearly 50%.
Abstract: An efficient algorithm for computing radix-3/9 discrete Hartley transforms (DHTs) is presented. It is shown that the radix-3/9 fast Hartley transform (FHT) algorithm reduces the number of multiplications required by a radix-3 FHT algorithm for nearly 50%. For the computation of real-valued discrete Fourier transforms (DFTs) with sequence lengths that are powers of 3, it is shown that the radix-3/9 FHT algorithm reduces the number of multiplications by 16.2% over the fastest real-valued radix-3/9 fast Fourier transform (FFT) algorithm. >

9 citations

Proceedings ArticleDOI
04 Dec 2007
TL;DR: A hardware interpretation to design a highly parallel and parameterized architecture of the cyclotomic FFT based on four stages and modular structure of last stage which allows to reach a very high throughput rate which, for 256-point FFT, can get hold of 8.5 fc.
Abstract: The hardware design and implementation of cyclotomic Fast Fourier Transform (FFT) over finite fields GF(2m) is described. By reformulating the algorithm presented in [8], we introduce a hardware interpretation to design a highly parallel and parameterized architecture of the cyclotomic FFT. Based on four stages and modular structure of last stage, this architecture can operate at different throughput rates. Compared to another implemented algorithm [9] which operates at fc (the system clock frequency), the proposed architecture allows to reach a very high throughput rate which, for 256-point FFT, can get hold of 8.5 fc. An FPGA implementation of the proposed architecture is given where the critical path delay and the hardware complexity are evaluated.

9 citations

01 Jan 2016
TL;DR: This tutorial describes how to accurately measure signal power using the FFT and the different effects that introduce errors during FFT processing are described and how they can be avoided or compensated.
Abstract: This tutorial describes how to accurately measure signal power using the FFT. The different effects that introduce errors during FFT processing are described and it is explained how they can be avoided or compensated.

9 citations

Proceedings ArticleDOI
01 Dec 2015
TL;DR: A new extended-OFDM transceiver is designed by modifying the modulation, encoding-decoding and FFT techniques by applying QAM, Optimum Frequency domain response encoding and 64 lines FFT with Radix4 Decimation in Time (DIT) by prime factor algorithm respectively.
Abstract: In order to increase the quality of the real time application it is essential to improve the throughput, capability of the network in new generation of WLAN. In recent days, the wide local area networks are combined with MIMO and OFDM wireless technologies. It is well known that OFDM provides a high data rate with low complexity. The robustness of the OFDM provides high data rates. It comprises multiplexing in modulations, so that OFDM can able to increase the interference of the channel. In this paper is focused to improve the quality of service on 802.11n standard MIMO-OFDM wireless systems. To do this, a new extended-OFDM transceiver is designed by modifying the modulation, encoding-decoding and FFT techniques by applying QAM, Optimum Frequency domain response encoding and 64 lines FFT with Radix4 Decimation in Time (DIT) by prime factor algorithm respectively. The main unit of OFDM is FFT. Optimizing FFT requires high attention. Hence by generalizing FFT algorithm the performance of the system is improved in terms of high throughput and low complexity. The simulation results shows that the proposed transceiver is efficient than the existing system.

9 citations

Patent
22 Feb 2007
TL;DR: In one embodiment, the present invention relates to an interleaved method for computing a Fast Fourier Transform (FFT), and in another embodiment, the authors relates to a method for parallel filter via Fast FFT.
Abstract: The present invention generally relates to a method for computing a Fast Fourier Transform (FFT). In one embodiment, the present invention relates to an interleaved method for computing a Fast Fourier Transform (FFT). In another embodiment, the present invention relates to a method for parallel filter via Fast Fourier Transform (FFT).

9 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