Page 2 of 2

Re: Fast Fourier Transform

PostPosted: Mon Jun 02, 2014 12:40 pm
by timpart
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

Re: Fast Fourier Transform

PostPosted: Mon Jun 02, 2014 3:01 pm
by Bikeman
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