Package htw.ai.dln.utils.hilbert

Class Summary

Class	Description
ComplexArray	This is a wrapper class that can hold two double arrays, one of which is interpreted as containing the real values, the other the imaginary values of the complex numbers.
ComplexNumber	A complex number: real+sqrt(-1).imag
FFTMixedRadix	FFT for non-power-of-two sequences Note that, this algorithm is significantly slower than FFT.java.
Hilbert	Computes the N-point Discrete Hilbert Transform of real valued vector x: The algorithm consists of the following stages: - X(w) = FFT(x) is computed - H(w), DFT of a Hilbert transform filter h[n], is created: H[0]=H[N/2]=1 H[w]=2 for w=1,2,...,N/2-1 H[w]=0 for w=N/2+1,...,N-1 - x[n] and h[n] are convolved (i.e.