Author: Paul Shirkey

Modern Fast Fourier Transform

Posted on by Paul Shirkey
All variants of the original Cooley-Tukey O(n log n) fast Fourier transform fundamentally exploit different ways to factor the discrete Fourier summation of length N. For example, the split-radix FFT algorithm divides the Fourier summation of length N into three new Fourier summations: one of length N/2 and two of length N/4. The prime factor FFT, divides the Fourier summation of length N, i...
Read More

High Performance FFT in NMath 4.0

Posted on by Paul Shirkey
The next release of Center Space's NMATH .NET libraries will contain high performance, multi-core aware, fast fourier transform classes. This set of classes will elegantly support all common 1D and 2D FFT computations in a robust easy to use object-oriented interface. The following FFT classes will be available. DoubleComplexForward1DFFT DoubleComplexBackward1DFFT DoubleComplexForw...
Read More
Top