FastFourierTransformF Class |
Namespace: DigitalRune.Mathematics.Analysis
The FastFourierTransformF type exposes the following members.
Name | Description | |
---|---|---|
FastFourierTransformF |
Initializes a new instance of the FastFourierTransformF class.
|
Name | Description | |
---|---|---|
Equals | (Inherited from Object.) | |
Finalize | Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object.) | |
GetHashCode | Serves as a hash function for a particular type. (Inherited from Object.) | |
GetType | Gets the Type of the current instance. (Inherited from Object.) | |
MemberwiseClone | Creates a shallow copy of the current Object. (Inherited from Object.) | |
ToString | Returns a string that represents the current object. (Inherited from Object.) | |
Transform1D(Vector2F, Boolean) |
Performs a Fast Fourier Transform in 1 dimension using the Radix-2 Cooley-Tukey algorithm.
| |
Transform1D(Vector2F, Int32, Boolean) |
Performs a Fast Fourier Transform using the Radix-2 Cooley-Tukey algorithm.
| |
Transform2D |
Performs a Fast Fourier Transform in 2 dimensions.
|
This class performs a Discrete Fourier transform (DFT) for 1D and 2D samples using Fast Fourier Transform (FFT) algorithms. Have a look at DFT and FFT by Paul Bourke for introduction to DFT and FFT. This class uses the same notation. (Please note that the 1 / N factor and the sign of the exponent are switched between forward and inverse FFT in some notations.)
1D FFT can be performed using Transform1D(Vector2F, Boolean). This method is static and you do not need to create an instance of this class.
2D FFT can be performed using Transform2D(Vector2F, Boolean). This method is not static because it requires an internal buffer, which is allocated only once for each FastFourierTransformF instance. The size of the buffer is determine by Capacity.