Click or drag to resize
DigitalRuneFastFourierTransformD Class
Performs Fast Fourier Transform (FFT) (double-precision).
Inheritance Hierarchy
SystemObject
  DigitalRune.Mathematics.AnalysisFastFourierTransformD

Namespace: DigitalRune.Mathematics.Analysis
Assembly: DigitalRune.Mathematics (in DigitalRune.Mathematics.dll) Version: 1.14.0.0 (1.14.0.14427)
Syntax
public class FastFourierTransformD

The FastFourierTransformD type exposes the following members.

Constructors
  NameDescription
Public methodFastFourierTransformD
Initializes a new instance of the FastFourierTransformF class.
Top
Methods
  NameDescription
Public methodEquals
Determines whether the specified Object is equal to the current Object.
(Inherited from Object.)
Protected methodFinalize
Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection.
(Inherited from Object.)
Public methodGetHashCode
Serves as a hash function for a particular type.
(Inherited from Object.)
Public methodGetType
Gets the Type of the current instance.
(Inherited from Object.)
Protected methodMemberwiseClone
Creates a shallow copy of the current Object.
(Inherited from Object.)
Public methodToString
Returns a string that represents the current object.
(Inherited from Object.)
Public methodStatic memberTransform1D(Vector2D, Boolean)
Performs a Fast Fourier Transform in 1 dimension using the Radix-2 Cooley-Tukey algorithm.
Public methodStatic memberTransform1D(Vector2D, Int32, Boolean)
Performs a Fast Fourier Transform using the Radix-2 Cooley-Tukey algorithm.
Public methodTransform2D
Performs a Fast Fourier Transform in 2 dimensions.
Top
Properties
  NameDescription
Public propertyCapacity
Gets or sets the maximal capacity to reserve for internal buffers.
Top
Remarks

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(Vector2D, Boolean). This method is static and you do not need to create an instance of this class.

2D FFT can be performed using Transform2D(Vector2D, Boolean). This method is not static because it requires an internal buffer, which is allocated only once for each FastFourierTransformD instance. The size of the buffer is determine by Capacity.

See Also