J
Jon Harrop
I just implemented a decent FFT algorithm that works for all "n" (not just
powers of two!) in C# and made it available as a DLL:
http://www.ffconsultancy.com/products/signal_processing_net/
Perhaps surprisingly, there are some very expensive .NET implementations
that are O(n^2)!
powers of two!) in C# and made it available as a DLL:
http://www.ffconsultancy.com/products/signal_processing_net/
Perhaps surprisingly, there are some very expensive .NET implementations
that are O(n^2)!