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.

Fast algorithms for computing the powers of a primitive element in GF(q 2 )

Abstract: In this correspondence a new algorithm for computing efficiently multiplications by powers of a primitive element in the finite field GF(q2), where q is a Mersenne prime, is described. This algorithm is applicable to transforms over GF(q2) which is used to implement fast circular convolutions without roundoff error.

Floating point error bound in the prime factor FFT

Abstract: The prime factor FFT

3-D vector radix algorithm for the 3-D discrete Hartley transform

Abstract: The three-dimensional discrete Hartley transform (3-D DHT) has been proposed as an alternative tool to the 3-D discrete Fourier transform (3-D DFT) for 3-D applications when the data is real The 3-D DHT has been applied in many three-dimensional image and multidimensional signal processing applications This paper presents a fast three-dimensional algorithm for computing the 3-D DHT The mathematical development of this algorithm is introduced and the arithmetic complexity is analysed and compared to related algorithms Based on a single butterfly implementation, this algorithm is found to offer substantial savings in the total number of multiplications and additions over the familiar row-column approach

Design of a High Speed FFT Processor

Abstract: The Discrete Fourier Transform (DFT) is used to transform the samples in time domain into frequency domain coefficients. The Fast Fourier Transform (FFT) is a widely used algorithm that computes the Discrete Fourier Transform (DFT) using much less operations than a direct realization of the DFT. FFTs is of great significance to a wide variety of applications such as data compression, spectral analysis etc. This paper proposes a design that implements a Fast Fourier transform (FFT). The module is developing by Radix- 2, Radix-4 decimation in time algorithm structure. The operation of the FFT processor performs three main processes i.e. data load, compute and result unload. The processing cycle starts with the data load process. In this process sampled data is read in and stored in memory. During the compute process computation of FFT on the stored data is performed and result unloaded process makes the FFT results available at its output. This paper also compares the performance of Radix-2 algorithm with Radix-4 algorithm.

Spectral Analysis of Signals by Using the Z-Transform Algorithm

Abstract: : A Z-transform algorithm, developed for the spectral analysis of signals, allows one to get closer to the poles of a signal and effectively reduces the signal's bandwidth and sharpens its peak point. It can give a high resolution, narrow-band frequency analysis with frequency spacing delta f or = 1/T, where T = total length of the analysis interval. This algorithm also enhances the signal poles that lie on circular or spiral contours that begin at almost any point in the Z-plane and the angular spacing of points in an arbitrary constant. Since this algorithm takes advantage of high-speed convolution, it is almost as fast and more flexible than the Fast Fourier Transform (FFT).