Owning Palette: Transforms VIs
Requires: Full Development System
Computes the inverse fast Hartley transform of the input sequence X.
The number of elements in the real input sequence X must be a valid power of two.
 Add to the block diagram |
 Find on the palette |
 |
X is the input sequence. To properly compute the inverse FHT of X, the number of elements, n, in the sequence must be a valid power of 2. n = 2m for m = 1, 2, 3,…,23If the number of elements in X is not a valid power of 2, the VI sets Inv FHT{X} to an empty array and returns an error. |
 |
Inv FHT {X} is the inverse Hartley transform of X. |
 |
error returns any error or warning from the VI. You can wire error to the Error Cluster From Error Code VI to convert the error code or warning into an error cluster. |
The inverse Hartley transform of a function X(f) is defined as
,
where cas(x) = cos(x) + sin(x).
If Y represents the output sequence Inv FHT{X}, the Inverse FHT VI calculates Y through the discrete implementation of the inverse Hartley integral
for k = 1, 2, …n – 1,
where n is the number of elements in X.
The inverse Hartley transform maps real-valued frequency sequences into real-valued sequences. You can use it instead of the inverse Fourier transform to convolve, deconvolve, and correlate signals. You also can derive the Fourier transform from the Hartley transform.
Refer to the FHT VI for a comparison of the Fourier and Hartley transforms.