Fast Fourier Transform

Generic algorithms that could be implemented in almost any language, e.g. matrix operations and FFT.

Re: Fast Fourier Transform

Postby timpart » Mon Jun 02, 2014 12:40 pm

tnchan wrote:Do we have newer FFT algorithm or codes for E16 by now? Cheers, TN


I think some kind of large FFT algorithm is under development because of the Birthday Beer Challenge. It might not be general enough for your individual requirements though.

Tim
timpart
 
Posts: 302
Joined: Mon Dec 17, 2012 3:25 am
Location: UK

Re: Fast Fourier Transform

Postby Bikeman » Mon Jun 02, 2014 3:01 pm

timpart wrote:
tnchan wrote:Do we have newer FFT algorithm or codes for E16 by now? Cheers, TN


I think some kind of large FFT algorithm is under development because of the Birthday Beer Challenge. It might not be general enough for your individual requirements though.

Tim


Interesting, the "Birthday Beer challenge" was actually inspired by a radio astronomy application as well (Einstein@Home Binary Pulsar Search). I'm pretty confident that any code that would come from this challenge should be applicable in principle to tnchan's problem as well, after some modification. I think the problem that the challenge will address is how to efficiently combine smaller FFTs (computed very fast on the Epiphany with 16 cores in parallel) to compute longer FFTs with a minimum of overhead caused by memory transfers.

HBE
Bikeman
 
Posts: 52
Joined: Wed Sep 11, 2013 8:55 pm

Previous

Return to Algorithms

Who is online

Users browsing this forum: No registered users and 1 guest

cron