Skip to content

Releases: tobiasbrestrich/NFFT-based-Hilbert-transform

Initial release

04 Aug 13:07
@tobiasbrestrich tobiasbrestrich
v1.0
968f7d6
Compare
Choose a tag to compare
Initial release Latest
Latest

The calculation of the Hilbert transform by a non-equispaced Fast Fourier Transform (NFFT) and its application to gravity and magnetic data

Computes the Hilbert transform of vector fields in the space domain (see Nabighian, 1984: https://doi.org/10.1190/1.1441706). The convolution sum is efficiently calculated by (Potts et. al., 2004: https://doi.org/10.1007/s00211-004-0538-5)s' fastsum algorithm. This package includes the following subdirectories:

  • 1DHilbertConvolution: Computes the 1D Hilbert transform with two different convolution approaches. Uses a gravimetric field as an example.
  • 1DHilbertFastsum: Computes the 1D Hilbert transfrom with an efficient fastsum algorithm. Uses a gravimetric field as an example.
  • 3DHilbertFastsum: Computes 3D Hilbert transfrom with an efficient fastsum algorithm. Uses a magnetic field as an example.
  • 3DHilbertFastsumReal: Computes 3D Hilbert transfrom with an efficient fastsum algorithm. Uses uses real world magnetic data as an example.

In addition, the frequency approach for calculating the Hilbert transform is used for comparison in all the subdirectories mentioned above.

Assets 2
Loading