User Tools

Site Tools


api:dk11:delphi:gisfouriertransform.tgis_fouriertransform

TGIS_FourierTransform class

DK11 for Delphi | GisFourierTransform.TGIS_FourierTransform | Classes | Constructors | Methods | Properties | Events

Encapsulation of one- and two-dimensional Discrete and Fast Fourier Transform (DFT and FFT) for a real-valued signal. FFT uses the Cooley-Tukey radix-2 algorithm.

Available also on: .NET | Java | ActiveX.

Syntax

// Delphi
type
  TGIS_FourierTransform = class( TGIS_Object )
  end;
// C++ Builder
class PASCALIMPLEMENTATION TGIS_FourierTransform : public TGIS_Object
{
};

Inheritance

Constructors

Inherited Overrides Protected
Name Visibility Description
Create public Creates an instance.

Methods

Inherited Overrides Protected
Name Visibility Description
Invert public Inverts the one-dimensonal Fourier transform.
Invert2D public Inverts the two-dimensonal Fourier transform.
raiseBusyEvent protected Prepares and raises the BusyEvent.
RunDiscrete(TGIS_SingleArray) public Computes the one-dimensonal Fourier transform of the provided real-valued signal using the discrete algorithm (DFT).
RunDiscrete(TGIS_SingleArray; Integer; Integer) public Computes the one-dimensonal Fourier transform of the provided real-valued signal using the discrete algorithm (DFT).
RunDiscrete2D(TGIS_GridArray) public Computes the two-dimensonal Fourier transform of the provided real-valued signal using the discrete algorithm (DFT).
RunDiscrete2D(TGIS_GridArray; TRect) public Computes the two-dimensonal Fourier transform of the provided real-valued signal using the discrete algorithm (DFT).
RunFast(TGIS_SingleArray) public Computes the one-dimensonal Fourier transform of the provided real-valued signal using the fast algorithm (FFT).
RunFast(TGIS_SingleArray; Integer; Integer) public Computes the one-dimensonal Fourier transform of the provided real-valued signal using the fast algorithm (FFT).
RunFast2D(TGIS_GridArray) public Computes the two-dimensonal Fourier transform of the provided real-valued signal using the fast algorithm (FFT).
RunFast2D(TGIS_GridArray; TRect) public Computes the two-dimensonal Fourier transform of the provided real-valued signal using the fast algorithm (FFT).

Properties

Inherited Protected
Name Visibility Description
Argument public Argument of the one-dimensional Fourier transform.
Argument2D public Argument of the two-dimensional Fourier transform.
Imaginary public Imaginary part of the one-dimensional Fourier transform.
Imaginary2D public Imaginary part of the two-dimensional Fourier transform.
Modulus public Modulus of the one-dimensional Fourier transform.
Modulus2D public Modulus of the two-dimensional Fourier transform.
Real public Real part of the one-dimensional Fourier transform.
Real2D public Real part of the two-dimensional Fourier transform.
Shifted public If True then the transform is shifted by half the size so that the low frequencies are in the middle instead of the corners; does not have any effect after the transform has been computed; default is True.

Events

Inherited Protected
Name Visibility Description
BusyEvent published

2019/01/25 16:25