Re:The Goertzel Algorithm
by colanderman on Saturday October 22, 2011 @10:39AM
(#3143589)
You are correct. The title is very misleading.
My apologies, this stuff is still pretty new to me.
Thanks for changing the title.
Indeed, a faster multi-frequency fourier transform would be a huge deal. It would speed up everything that involves multiplying large numbers (encryption, but also lots of biology and other scientific problems), due to FFT multiplication.
I don't see how to perform a convolution with this algorithm, which I would be able to do if it was an FFT.
There are many algorithms for FFT that are faster, e.g. the split radix FFT, Gentleman and Sande's approach, the Matrix Fourier Algorithm and scores of variations on a theme. The article doesn't make clear whether this is one of them.