Fast Hilbert Transform PtByPt (Not in Base Package)

Computes the Fast Hilbert Transform of the set of input data using fast Fourier transform (FFT) identities. Details

initialize, when TRUE, initializes the internal state of the VI.
input data is a set of input data.
sample length is the length of each set of incoming data. The VI performs computation on each set of data. The default is 100. sample length must be greater than zero.
Hilbert{X} is the fast Hilbert Transform of the set of input data.
error returns any error or warning condition from the VI. Refer to Point By Point Error Codes for more information about these conditions.

Fast Hilbert Transform PtByPt Details

Let h(t) be the Hilbert transform of x(t) and let

x(t) <==> X(f),

h(t) <==> H(f)

be the Fourier transform pairs, then H(f) can be written in terms of X(f) as

H(f) = -j sgn(f) X(f),

where

sgn(f) = 1 for f > 0

= -1 for f < 0.