[Elecraft] Faster FFT...off topic but relevant

Does anyone know any details about the new ultra-fast Katabi FFT, its coding, etc. as reported in the most recent New Scientist? John Ragle -- W1ZI -- Sent from my lovely old Dell XPS 420 __ Elecraft mailing list Home:

Re: [Elecraft] Faster FFT...off topic but relevant

Is this what you are looking for? http://arxiv.org/pdf/1201.2501v1.pdf 73 - Mike WA8BXN __ Elecraft mailing list Home: http://mailman.qth.net/mailman/listinfo/elecraft Help: http://mailman.qth.net/mmfaq.htm Post:

Re: [Elecraft] Faster FFT...off topic but relevant

I only glanced at the academic paper when it went by a few weeks ago, but IIRC, it offers improved performance for low [dominant] information content samples. It's been 15+ years since I did the math, but I thought the original function series did this well. The FFT optimizations,

Re: [Elecraft] Faster FFT...off topic but relevant

I should note that it didn't catch my interest because the domains /I/ generally throw FFTs against contain large numbers of signals with a lot of dynamic range between them, and I really do need most of the data. OTOH, there are almost certainly a HUGE number of domains for which

Re: [Elecraft] Faster FFT...off topic but relevant

On Tue, Jan 31, 2012 at 2:32 PM, Jessie Oberreuter joberreu-elecr...@moselle.com wrote: ... it isn't going to change the world... I remember about 30 years ago when the Karmarkar algorithm for linear optimization appeared. On certain problems, it appeared that it would be about 10x as

Re: [Elecraft] Faster FFT...off topic but relevant

You can download the original MIT paper from http://arxiv.org/abs/1201.2501v1. On 31 Jan 2012 20:18, John Ragle wrote: Does anyone know any details about the new ultra-fast Katabi FFT, its coding, etc. as reported in the most recent New Scientist? John Ragle -- W1ZI