By Topic

Truncated Fast Fourier Transform algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Mateer, T.D. ; Dept. of Math., Howard Community Coll., Columbia, MD, USA

It is well known that the convolution of two signals is equivalent to the multiplication of two polynomials. Fast polynomial multiplication can be implemented by evaluating the two input polynomials at a collection of points, multiplying the polynomial evaluations, and then interpolating the results into the product polynomial. In 2004 and 2005, van der Hoeven introduced algorithms which efficiently evaluate and interpolate a polynomial at certain collections of n <; N points which are roots of xN - 1 where N is a power of two. A finite field of characteristic two does not have the necessary properties to use this algorithm. In this paper, we present a generalization of the van der Hoeven algorithms which can also be applied to the finite field case. The generalized algorithms also improve van der Hoeven's presentation to take advantage of a slightly more efficient factorization due to Crandall and Fagin. The evaluation and interpolation problems will be viewed in terms of polynomial rings, building upon previous work by Fiduccia, Martens, and Bernstein.

Published in:

Digital Signal Processing Workshop and IEEE Signal Processing Education Workshop (DSP/SPE), 2011 IEEE

Date of Conference:

4-7 Jan. 2011