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.
// Delphi type TGIS_FourierTransform = class( TGIS_Object ) end;
// C++ Builder class PASCALIMPLEMENTATION TGIS_FourierTransform : public TGIS_Object { };
Name | Visibility | Description | |
---|---|---|---|
Create | public | Creates an instance. _{} | |
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). _{ } | |
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. _{} | |