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.

A tms dsp processor based case study of grigoryan fft performance over cooley-tukey fft (tms320c5416, tms320c5515)

Abstract: Frequency analysis plays vital role in the applications like cryptanalysis, steganalysis [6], system identification, controller tuning, speech recognition, noise filters, etc. Discrete Fourier Transform (DFT) is a principal mathematical method for the frequency analysis. The way of splitting the DFT gives out various fast algorithms. In this paper, we present the implementation of two fast algorithms for the DFT for evaluating their performance. One of them is the popular radix-2 Cooley-Tukey fast Fourier transform algorithm (FFT) [1] and the other one is the Grigoryan FFT based on the splitting by the paired transform [2]. We evaluate the performance of these algorithms by implementing them on the TMS320C5515 and TMS320C5416 DSPs. We developed C programming for these DSP processors. Finally we show that the paired-transform based algorithm of the FFT is faster than the radix-2 FFT, consequently it is useful for higher sampling rates. Working at higher data rates is a challenge in the applications of Digital Signal Processing.

Sliding aperture Fourier transform (SAFT): a low latency continuous process

Abstract: The paper describes a new fast Fourier transform (FFT) algorithm and its implementation. The algorithm is superior to traditional FFT algorithms, requiring fewer computations and having reduced latency. A full set of accurate classical coefficients is calculated at each sample arrival. An 8-point processor was simulated in Matlab. A 64-point ASIC simulation in 0.18 /spl mu/m CMOS gave results of 16 mW, area = 1 mm/sup 2/ and sample rate = 2.5 MS/sec when clocked at 330 MHz.

Vector-radix-2 2 ×2 2 fast Fourier transform algorithm

Abstract: In this paper, a new decimation-in-time vector-radix-22×22 fast Fourier transform (VR-22×22-FFT) algorithm for computing the two dimensional discrete Fourier transform (2-D DFT) is presented. The algorithm is derived by applying a two-stage decomposition approach and by introducing an efficient technique for grouping the twiddle factors. The arithmetic complexity of the proposed algorithm is analyzed and the number of real multiplications and additions are computed for different transform sizes. Moreover, a comparison with the existing 2-D vector-radix FFT algorithms has shown that the presented algorithm can be considered as a good compromise between the structural and computational complexities.

On the efficient implementation of the split-radix FFT

Abstract: The recently developed split-radix algorithm for size 2MDFTs appears to offer the lowest combined count of multiplies and additions among known algorithms, as well as fewer multiplies than Cooley-Tukey algorithms of radix 8 or below. Thus it seems well-suited to applications where DFT computation time is limited by multiply and/or addition time. We show that the algorithm is less attractive when evaluated in terms of butterflies. Specifically, it requires 20 to 50% more butterflies than an otherwise similar radix-4 Cooley-Tukey FFT, and its relatively irregular structure complicates pipelined implementation. These considerations are important when contemplating DFT machines based on VLSI butterfly primitives.