Fast Fourier Transforms (FFT's)
Whether you’re using C#, Visual Basic (VB.NET) or F#, Numerics.NET makes it easy to include FFT functionality in your .NET applications. Numerics.NET is a complete math, linear algebra, data analysis, and statistics package for the Microsoft .NET platform. FFT features include:
- Real 1D and 2D Fast Fourier Transform.
- Complex 1D and 2D Fast Fourier Transform.
- Special code for factors 2, 3, 4, 5, and 7.
- Bluestein’s algorithm for arbitrary sizes.
- Real and complex convolution.
- Choice of managed and native (32bit and 64bit) implementations.
Fast Fourier Transform classes
The classes that implement the Fast Fourier Transform functionality live in the Numerics.NET.SignalProcessing namespace. The principal classes are:
- FftOperations<T> Provides access to a specific FFT implementation.
- Fft<T> Represents a one-dimensional (1D) discrete Fourier Transform implementation.
- Fft2D<T> Represents a two-dimensional (2D) discrete Fourier Transform implementation.
- ComplexConjugateSignalMatrix<T> Represents a complex matrix that is the Fourier transform of a real matrix.
- ComplexConjugateSignalVector<T> Represents a complex vector that is the Fourier transform of a real vector.
The Signal Processing section of the Mathematics Library User’s Guide explains their use in detail.
Fast Fourier Transforms QuickStart Samples
Our library comes with a large number of QuickStart samples that help you to get started in minutes. The following samples illustrate how to use the FFT functionality:
| Project | Description | View source | ||
|---|---|---|---|---|
| FourierTransforms | Illustrates how to compute the discrete Fourier transform of real and complex signals. | C# | VB.NET | F# |
Trial version
If you would like to evaluate Extreme Numercs.NET, you can download a free, fully functional 30-day trial version. In addition to the code samples discussed here, it includes about 70 other samples as well as complete documentation for the entire library.