An in-place truncated Fourier transform and applications to polynomial multiplication

Details An in-place truncated Fourier transform and applications to polynomial multiplication An in-place truncated Fourier transform and applications to polynomial multiplication

2010-01-28

arxiv.org/abs/1001.5272v1

Computer Science

Data Structures and Algorithms

5 pages, 1 figure, pdflatex

Scientific paper

The truncated Fourier transform (TFT) was introduced by van der Hoeven in 2004 as a means of smoothing the "jumps" in running time of the ordinary FFT algorithm that occur at power-of-two input sizes. However, the TFT still introduces these jumps in memory usage. We describe in-place variants of the forward and inverse TFT algorithms, achieving time complexity O(n log n) with only O(1) auxiliary space. As an application, we extend the second author's results on space-restricted FFT-based polynomial multiplication to polynomials of arbitrary degree.

Affiliated with

Also associated with

No associations

Rating

An in-place truncated Fourier transform and applications to polynomial multiplication does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An in-place truncated Fourier transform and applications to polynomial multiplication, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An in-place truncated Fourier transform and applications to polynomial multiplication will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-675354