Experimental Design and Development of a Polyalgorithm for the FFT.

Experimental Design and Development of a Polyalgorithm for the FFT.September 1998

September 1998

1998 Technical Report

Publisher:

Published:01 September 1998

Bibliometrics

NONE

Cited By

Contributors

Design and Simulation of 32-Point FFT Using Radix-2 Algorithm for FPGA Implementation
ACCT '12: Proceedings of the 2012 Second International Conference on Advanced Computing & Communication Technologies

The Fast Fourier Transform (FFT) is one of the rudimentary operations in field of digital signal and image processing. Some of the very vital applications of the fast fourier transform include Signal analysis, Sound filtering, Data compression, Partial ...
Elementary Number Theory and Rader's FFT

This note provides a self-contained introduction to Rader's fast Fourier transform (FFT). We start by explaining the need for an additional type of FFT. The properties of the multiplicative group of the integers modulo a prime number are then developed and ...
The Tangent FFT
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Abstract
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just arithmetic operations on real numbers. This operation count was first announced in 1968, stood unchallenged for more than thirty years, and was widely ...