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 FPGA implementation of highly modular universal discrete transforms based on the unified discrete Fourier Hartley transform (UDFHT) that employs a reconfigurable, scalable and modular architecture that consists of a memory-based FFT processor equipped with pre- and post-processing units.
Abstract: SUMMARY This paper presents an FPGA implementation of highly modular universal discrete transforms. The implementation relies upon the unified discrete Fourier Hartley transform (UDFHT), based on which essential sinusoidal transforms including discrete Fourier transform (DFT), discrete Hartley transform (DHT), discrete cosine transform (DCT) and discrete sine transform (DST) can be realized. It employs a reconfigurable, scalable and modular architecture that consists of a memory-based FFT processor equipped with pre- and post-processing units. Besides, a pipelining technique is exploited to seamlessly harmonize the operation between each sub-module. Experimental results based on Xilinx Virtex-II Pro are given to examine the performance of the proposed UDFHT implementation. Two practical applications are also shown to demonstrate the flexibility and modularity of the proposed work.

1 citations

01 Jan 2014
TL;DR: A novel “alpha max-beta min” algorithm for magnitude estimation whose hardware implementation is very simple and the time executes proposed algorithm in only one clock cycle, and average error of less than 1%.
Abstract: In speech recognition system, speech signal is preprocessed, and then will be transferred to the frequency domain by Fast Fourier Transform (FFT). The output of FFT block is the complex numbers that will be estimated in magnitude to prepare for the calculation of Mel-frequency filter bank block. This paper proposes a novel “alpha max-beta min” algorithm for magnitude estimation whose hardware implementation is very simple. The time executes proposed algorithm in only one clock cycle, and average error of less than 1%. The influences of proposed algorithm on the whole speech recognition system are also given in calculation speed and recognition accuracy. Trong h» thng nh“n d⁄ng ti‚ng noi, tin hi»u ti‚ng noi

1 citations

Proceedings ArticleDOI
15 Mar 1999
TL;DR: This algorithm achieves a reduction of complexity with regard to the IIR-QR algorithm by using a block reduction transformation and derives a fast version of the algorithm from the rotation-based lattice algorithm (QR-LSL).
Abstract: In this paper, we present a new QR based algorithm for IIR adaptive filtering. This algorithm achieves a reduction of complexity with regard to the IIR-QR algorithm by using a block reduction transformation. Moreover, this new approach makes it possible to directly transform the fast FIR algorithm into fast O(N) versions of the IIR algorithm. Therefore, we derive a fast version of the algorithm from the rotation-based lattice algorithm (QR-LSL). Simulations, have proven the fast convergence and the good numerical properties of both algorithms for systems satisfying the strictly positive real (SPR) condition.

1 citations

Proceedings ArticleDOI
28 Jun 1993
TL;DR: In this article, the authors present a systematic approach to the design of a mode-forming network for feeding an antenna with N terminals in any combination of the N modes of the antenna.
Abstract: The authors present a systematic approach to the design of a mode-forming network for feeding an antenna with N terminals in any combination of the N modes of the antenna In a first step, they show that the mode number and the terminal number are related through a discrete Fourier transform (DFT) They then present a systematic approach for designing a mode-forming network by drawing on the powerful fast Fourier transform (FFT) implementations of the DFT >

1 citations

Proceedings ArticleDOI
01 Jan 1989
TL;DR: The authors present a method to efficiently implement the recursive instrumental variable (RIV) algorithm, which is often encountered in many practical applications, and its fast Fourier transform (FFT) implementation is discussed.
Abstract: The authors present a method to efficiently implement the recursive instrumental variable (RIV) algorithm, which is often encountered in many practical applications. A sequential block-processing algorithm is derived, and its fast Fourier transform (FFT) implementation is discussed. Under several easily met conditions, this method can offer a remarkable computational advantage over the previous fast-RIV. To accommodate the slowly time-varying input situations, an exponentially windowed extension of the result is also given. >

1 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