A cache-friendly truncated FFT

Details A cache-friendly truncated FFT A cache-friendly truncated FFT

2008-10-17

arxiv.org/abs/0810.3203v1

Computer Science

Symbolic Computation

14 pages, 11 figures, uses algorithm2e package

Scientific paper

We describe a cache-friendly version of van der Hoeven's truncated FFT and
inverse truncated FFT, focusing on the case of `large' coefficients, such as
those arising in the Schonhage--Strassen algorithm for multiplication in Z[x].
We describe two implementations and examine their performance.

Affiliated with

Also associated with

No associations

Rating

A cache-friendly truncated FFT 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 A cache-friendly truncated FFT, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A cache-friendly truncated FFT will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-352848