Inmathematics andsignal processing, theHilbert transform is a specificsingular integral that takes a function,u(t) of a real variable and produces another function of a real variableH(u)(t). The Hilbert transform is given by theCauchy principal value of theconvolution with the function (see§ Definition). The Hilbert transform has a particularly simple representation in thefrequency domain: It imparts aphase shift of ±90° (π/2 radians) to every frequency component of a function, the sign of the shift depending on the sign of the frequency (see§ Relationship with the Fourier transform). The Hilbert transform is important in signal processing, where it is a component of theanalytic representation of a real-valued signalu(t). The Hilbert transform was first introduced byDavid Hilbert in this setting, to solve a special case of theRiemann–Hilbert problem for analytic functions.
The Hilbert transform ofu can be thought of as theconvolution ofu(t) with the functionh(t) =1/πt, known as theCauchy kernel. Because 1/t is notintegrable acrosst = 0, the integral defining the convolution does not always converge. Instead, the Hilbert transform is defined using theCauchy principal value (denoted here byp.v.). Explicitly, the Hilbert transform of a function (or signal)u(t) is given by
provided this integral exists as a principal value. This is precisely the convolution ofu with thetempered distributionp.v.1/πt.[1] Alternatively, by changing variables, the principal-value integral can be written explicitly[2] as
When the Hilbert transform is applied twice in succession to a functionu, the result is
provided the integrals defining both iterations converge in a suitable sense. In particular, the inverse transform is. This fact can most easily be seen by considering the effect of the Hilbert transform on theFourier transform ofu(t) (see§ Relationship with the Fourier transform below).
For ananalytic function in theupper half-plane, the Hilbert transform describes the relationship between the real part and the imaginary part of the boundary values. That is, iff(z) is analytic in the upper half complex plane{z : Im{z} > 0}, andu(t) = Re{f (t + 0·i)}, thenIm{f(t + 0·i)} = H(u)(t) up to an additive constant, provided this Hilbert transform exists.
Insignal processing the Hilbert transform ofu(t) is commonly denoted by.[3] However, in mathematics, this notation is already extensively used to denote the Fourier transform ofu(t).[4] Occasionally, the Hilbert transform may be denoted by. Furthermore, many sources define the Hilbert transform as the negative of the one defined here.[5]
The Hilbert transform arose in Hilbert's 1905 work on a problem Riemann posed concerning analytic functions,[6][7] which has come to be known as theRiemann–Hilbert problem. Hilbert's work was mainly concerned with the Hilbert transform for functions defined on the circle.[8][9] Some of his earlier work related to the Discrete Hilbert Transform dates back to lectures he gave inGöttingen. The results were later published byHermann Weyl in his dissertation.[10] Schur improved Hilbert's results about the discrete Hilbert transform and extended them to the integral case.[11] These results were restricted to the spacesL2 andℓ2. In 1928,Marcel Riesz proved that the Hilbert transform can be defined foru in (Lp space) for1 <p < ∞, that the Hilbert transform is abounded operator on for1 <p < ∞, and that similar results hold for the Hilbert transform on the circle as well as the discrete Hilbert transform.[12] The Hilbert transform was a motivating example forAntoni Zygmund andAlberto Calderón during their study ofsingular integrals.[13] Their investigations have played a fundamental role in modern harmonic analysis. Various generalizations of the Hilbert transform, such as the bilinear and trilinear Hilbert transforms are still active areas of research today.
Therefore,H(u)(t) has the effect of shifting the phase of thenegative frequency components ofu(t) by +90° (π⁄2 radians) and the phase of the positive frequency components by −90°, andi·H(u)(t) has the effect of restoring the positive frequency components while shifting the negative frequency ones an additional +90°, resulting in their negation (i.e., a multiplication by −1).
When the Hilbert transform is applied twice, the phase of the negative and positive frequency components ofu(t) are respectively shifted by +180° and −180°, which are equivalent amounts. The signal is negated; i.e.,H(H(u)) = −u, because
^Some authors (e.g., Bracewell) use our−H as their definition of the forward transform. A consequence is that the right column of this table would be negated.
^abThe Hilbert transform of the sin and cos functions can be defined by taking the principal value of the integral at infinity. This definition agrees with the result of defining the Hilbert transform distributionally.
An extensive table of Hilbert transforms is available.[15]Note that the Hilbert transform of a constant is zero.
It is by no means obvious that the Hilbert transform is well-defined at all, as theimproper integral defining it must converge in a suitable sense. However, the Hilbert transform is well-defined for a broad class of functions, namely those in for1 <p < ∞.
More precisely, ifu is in for1 <p < ∞, then the limit defining the improper integral
exists foralmost everyt. The limit function is also in and is in fact the limit in the mean of the improper integral as well. That is,
asε → 0 in theLp norm, as well as pointwise almost everywhere, by theTitchmarsh theorem.[16]
In the casep = 1, the Hilbert transform still converges pointwise almost everywhere, but may itself fail to be integrable, even locally.[17] In particular, convergence in the mean does not in general happen in this case. The Hilbert transform of anL1 function does converge, however, inL1-weak, and the Hilbert transform is a bounded operator fromL1 toL1,w.[18] (In particular, since the Hilbert transform is also a multiplier operator onL2,Marcinkiewicz interpolation and a duality argument furnishes an alternative proof thatH is bounded onLp.)
An easy way to find the best for being a power of 2 is through the so-called Cotlar's identity that for all real valuedf. The same best constants hold for the periodic Hilbert transform.
The boundedness of the Hilbert transform implies the convergence of the symmetric partial sum operator
The Hilbert transform is an anti-self adjoint operator relative to the duality pairing between and the dual space, wherep andq areHölder conjugates and1 <p,q < ∞. Symbolically,
BecauseH2 = −I ("I" is theidentity operator) on the realBanach space ofreal-valued functions in, the Hilbert transform defines alinear complex structure on this Banach space. In particular, whenp = 2, the Hilbert transform gives theHilbert space of real-valued functions in the structure of acomplex Hilbert space.
Formally, the derivative of the Hilbert transform is the Hilbert transform of the derivative, i.e. these two linear operators commute:
Iterating this identity,
This is rigorously true as stated providedu and its firstk derivatives belong to.[24] One can check this easily in the frequency domain, where differentiation becomes multiplication byω.
However,a priori this may only be defined foru a distribution ofcompact support. It is possible to work somewhat rigorously with this since compactly supported functions (which are distributionsa fortiori) aredense inLp. Alternatively, one may use the fact thath(t) is thedistributional derivative of the functionlog|t|/π; to wit
For most operational purposes the Hilbert transform can be treated as a convolution. For example, in a formal sense, the Hilbert transform of a convolution is the convolution of the Hilbert transform applied ononly one of either of the factors:
This is rigorously true ifu andv are compactly supported distributions since, in that case,
By passing to an appropriate limit, it is thus also true ifu ∈Lp andv ∈Lq provided that
The Hilbert transform has the following invariance properties on.
It commutes with translations. That is, it commutes with the operatorsTaf(x) =f(x +a) for alla in
It commutes with positive dilations. That is it commutes with the operatorsMλ f (x) =f (λ x) for allλ > 0.
Itanticommutes with the reflectionR f (x) =f (−x).
Up to a multiplicative constant, the Hilbert transform is the only bounded operator onL2 with these properties.[27]
In fact there is a wider set of operators that commute with the Hilbert transform. The group acts by unitary operatorsUg on the space by the formula
Thisunitary representation is an example of aprincipal series representation of In this case it is reducible, splitting as the orthogonal sum of two invariant subspaces,Hardy space and its conjugate. These are the spaces ofL2 boundary values of holomorphic functions on the upper and lower halfplanes. and its conjugate consist of exactly thoseL2 functions with Fourier transforms vanishing on the negative and positive parts of the real axis respectively. Since the Hilbert transform is equal toH = −i (2P − I), withP being the orthogonal projection from onto andI theidentity operator, it follows that and its orthogonal complement are eigenspaces ofH for the eigenvalues±i. In other words,H commutes with the operatorsUg. The restrictions of the operatorsUg to and its conjugate give irreducible representations of – the so-calledlimit of discrete series representations.[28]
It is further possible to extend the Hilbert transform to certain spaces ofdistributions (Pandey 1996, Chapter 3). Since the Hilbert transform commutes with differentiation, and is a bounded operator onLp,H restricts to give a continuous transform on theinverse limit ofSobolev spaces:
The Hilbert transform can then be defined on the dual space of, denoted, consisting ofLp distributions. This is accomplished by the duality pairing: For, define:
It is possible to define the Hilbert transform on the space oftempered distributions as well by an approach due to Gel'fand and Shilov,[29] but considerably more care is needed because of the singularity in the integral.
The Hilbert transform can be defined for functions in as well, but it requires some modifications and caveats. Properly understood, the Hilbert transform maps to theBanach space ofbounded mean oscillation (BMO) classes.
Interpreted naïvely, the Hilbert transform of a bounded function is clearly ill-defined. For instance, withu = sgn(x), the integral definingH(u) diverges almost everywhere to±∞. To alleviate such difficulties, the Hilbert transform of anL∞ function is therefore defined by the followingregularized form of the integral
where as aboveh(x) =1/πx and
The modified transformH agrees with the original transform up to an additive constant on functions of compact support from a general result by Calderón and Zygmund.[30] Furthermore, the resulting integral converges pointwise almost everywhere, and with respect to the BMO norm, to a function of bounded mean oscillation.
Adeep result of Fefferman's work[31] is that a function is of bounded mean oscillation if and only if it has the formf + H(g) for some.
The Hilbert transform can be understood in terms of a pair of functionsf(x) andg(x) such that the functionis the boundary value of aholomorphic functionF(z) in the upper half-plane.[32] Under these circumstances, iff andg are sufficiently integrable, then one is the Hilbert transform of the other.
Suppose that Then, by the theory of thePoisson integral,f admits a unique harmonic extension into the upper half-plane, and this extension is given by
The functionv obtained fromu in this way is called theharmonic conjugate ofu. The (non-tangential) boundary limit ofv(x,y) asy → 0 is the Hilbert transform off. Thus, succinctly,
Titchmarsh's theorem (named forE. C. Titchmarsh who included it in his 1937 work) makes precise the relationship between the boundary values of holomorphic functions in the upper half-plane and the Hilbert transform.[33] It gives necessary and sufficient conditions for a complex-valuedsquare-integrable functionF(x) on the real line to be the boundary value of a function in theHardy spaceH2(U) of holomorphic functions in the upper half-planeU.
The theorem states that the following conditions for a complex-valued square-integrable function are equivalent:
F(x) is the limit asz →x of a holomorphic functionF(z) in the upper half-plane such that
The real and imaginary parts ofF(x) are Hilbert transforms of each other.
A weaker result is true for functions of classLp forp > 1.[34] Specifically, ifF(z) is a holomorphic function such that
for ally, then there is a complex-valued functionF(x) in such thatF(x +i y) →F(x) in theLp norm asy → 0 (as well as holding pointwisealmost everywhere). Furthermore,
wheref is a real-valued function in andg is the Hilbert transform (of classLp) off.
This is not true in the casep = 1. In fact, the Hilbert transform of anL1 functionf need not converge in the mean to anotherL1 function. Nevertheless,[35] the Hilbert transform off does converge almost everywhere to a finite functiong such that
This result is directly analogous to one byAndrey Kolmogorov for Hardy functions in the disc.[36] Although usually called Titchmarsh's theorem, the result aggregates much work of others, including Hardy, Paley and Wiener (seePaley–Wiener theorem), as well as work by Riesz, Hille, and Tamarkin[37]
One form of theRiemann–Hilbert problem seeks to identify pairs of functionsF+ andF− such thatF+ isholomorphic on the upper half-plane andF− is holomorphic on the lower half-plane, such that forx along the real axis,
wheref(x) is some given real-valued function of. The left-hand side of this equation may be understood either as the difference of the limits ofF± from the appropriate half-planes, or as ahyperfunction distribution. Two functions of this form are a solution of the Riemann–Hilbert problem.
For a periodic functionf the circular Hilbert transform is defined:
The circular Hilbert transform is used in giving a characterization of Hardy space and in the study of the conjugate function in Fourier series. The kernel,is known as theHilbert kernel since it was in this form the Hilbert transform was originally studied.[8]
The Hilbert kernel (for the circular Hilbert transform) can be obtained by making the Cauchy kernel1⁄x periodic. More precisely, forx ≠ 0
Many results about the circular Hilbert transform may be derived from the corresponding results for the Hilbert transform from this correspondence.
Another more direct connection is provided by the Cayley transformC(x) = (x –i) / (x +i), which carries the real line onto the circle and the upper half plane onto theunit disk. It induces a unitary map
ofL2(T) onto The operatorU carries the Hardy spaceH2(T) onto the Hardy space.[39]
Bedrosian's theorem states that the Hilbert transform of the product of a low-pass and a high-pass signal with non-overlapping spectra is given by the product of the low-pass signal and the Hilbert transform of the high-pass signal, or
wherefLP andfHP are the low- and high-pass signals respectively.[40] A category of communication signals to which this applies is called thenarrowband signal model. A member of that category is amplitude modulation of a high-frequency sinusoidal "carrier":
whereum(t) is the narrow bandwidth "message" waveform, such as voice or music. Then by Bedrosian's theorem:[41]
known as theanalytic representation of The name reflects its mathematical tractability, due largely toEuler's formula. Applying Bedrosian's theorem to the narrowband model, the analytic representation is:[42]
Eq.1
A Fourier transform property indicates that this complexheterodyne operation can shift all the negative frequency components ofum(t) above 0 Hz. In that case, the imaginary part of the result is a Hilbert transform of the real part. This is an indirect way to produce Hilbert transforms.
The function presents two causality-based challenges to practical implementation in a convolution (in addition to its undefined value at 0):
Its duration is infinite (technicallyinfinitesupport). Finite-lengthwindowing reduces the effective frequency range of the transform; shorter windows result in greater losses at low and high frequencies. See alsoquadrature filter.
It is anon-causal filter. So a delayed version, is required. The corresponding output is subsequently delayed by When creating the imaginary part of ananalytic signal, the source (real part) must also be delayed by.
Figure 1: Filter whose frequency response is bandlimited to about 95% of the Nyquist frequencyFigure 2: Hilbert transform filter with a highpass frequency responseFigure 3.Figure 4. The Hilbert transform ofcos(ωt) issin(ωt). This figure showssin(ωt) and two approximate Hilbert transforms computed by the MATLAB library function,hilbert()Figure 5. Discrete Hilbert transforms of a cosine function, using piecewise convolution
For a discrete function, withdiscrete-time Fourier transform (DTFT),, anddiscrete Hilbert transform the DTFT of in the region−π < ω <π is given by:
Method 1: Direct convolution of streaming data with an FIR approximation of which we will designate by Examples of truncated are shown in figures 1 and 2.Fig 1 has an odd number of anti-symmetric coefficients and is called Type III.[49] This type inherently exhibits responses of zero magnitude at frequencies 0 and Nyquist, resulting in a bandpass filter shape.[50][51] A Type IV design (even number of anti-symmetric coefficients) is shown inFig 2.[52][53] It has a highpass frequency response.[54] Type III is the usual choice.[55][56] for these reasons:
A typical (i.e. properly filtered and sampled) sequence has no useful components at the Nyquist frequency.
The Type IV impulse response requires a sample shift in the sequence. That causes the zero-valued coefficients to become non-zero, as seen inFigure 2. So a Type III design is potentially twice as efficient as Type IV.
The group delay of a Type III design is an integer number of samples, which facilitates aligning with to create ananalytic signal. The group delay of Type IV is halfway between two samples.
The abrupt truncation of creates a rippling (Gibbs effect) of the flat frequency response. That can be mitigated by use of a window function to taper to zero.[57]
Method 2: Piecewise convolution. It is well known that direct convolution is computationally much more intensive than methods likeoverlap-save that give access to the efficiencies of the Fast Fourier transform via the convolution theorem.[58] Specifically, thediscrete Fourier transform (DFT) of a segment of is multiplied pointwise with a DFT of the sequence. An inverse DFT is done on the product, and the transient artifacts at the leading and trailing edges of the segment are discarded. Over-lapping input segments prevent gaps in the output stream. An equivalent time domain description is that segments of length (an arbitrary parameter) are convolved with the periodic function:
When the duration of non-zero values of is the output sequence includes samples of outputs are discarded from each block of and the input blocks are overlapped by that amount to prevent gaps.
Method 3: Same as method 2, except the DFT of is replaced by samples of the distribution (whose real and imaginary components are all just or ) That convolves with aperiodic summation:[A]
for some arbitrary parameter, is not an FIR, so the edge effects extend throughout the entire transform. Deciding what to delete and the corresponding amount of overlap is an application-dependent design issue.
Fig 3 depicts the difference between methods 2 and 3. Only half of the antisymmetric impulse response is shown, and only the non-zero coefficients. The blue graph corresponds to method 2 where is truncated by a rectangular window function, rather than tapered. It is generated by a Matlab function,hilb(65). Its transient effects are exactly known and readily discarded. The frequency response, which is determined by the function argument, is the only application-dependent design issue.
The red graph is corresponding to method 3. It is the inverse DFT of the distribution. Specifically, it is the function that is convolved with a segment of by theMATLAB function,hilbert(u,512).[61] The real part of the output sequence is the original input sequence, so that the complex output is ananalytic representation of
When the input is a segment of a pure cosine, the resulting convolution for two different values of is depicted inFig 4 (red and blue plots). Edge effects prevent the result from being a pure sine function (green plot). Since is not an FIR sequence, the theoretical extent of the effects is the entire output sequence. But the differences from a sine function diminish with distance from the edges. Parameter is the output sequence length. If it exceeds the length of the input sequence, the input is modified by appending zero-valued elements. In most cases, that reduces the magnitude of the edge distortions. But their duration is dominated by the inherent rise and fall times of the impulse response.
Fig 5 is an example of piecewise convolution, using both methods 2 (in blue) and 3 (red dots). A sine function is created by computing the Discrete Hilbert transform of a cosine function, which was processed in four overlapping segments, and pieced back together. As the FIR result (blue) shows, the distortions apparent in the IIR result (red) are not caused by the difference between and (green and red inFig 3). The fact that is tapered (windowed) is actually helpful in this context. The real problem is that it's not windowed enough. Effectively, whereas the overlap-save method needs
The number theoretic Hilbert transform is an extension[62] of the discrete Hilbert transform to integers modulo an appropriate prime number. In this it follows the generalization ofdiscrete Fourier transform to number theoretic transforms. The number theoretic Hilbert transform can be used to generate sets of orthogonal discrete sequences.[63]
Rosenblum, Marvin; Rovnyak, James (1997).Hardy classes and operator theory. Dover.ISBN0-486-69536-0.
Schwartz, Laurent (1950).Théorie des distributions. Paris, FR: Hermann.
Schreier, P.; Scharf, L. (2010).Statistical signal processing of complex-valued data: The theory of improper and noncircular signals. Cambridge, UK: Cambridge University Press.
Carlson; Crilly & Rutledge (2002).Communication Systems (4th ed.). McGraw-Hill.ISBN0-07-011127-8.
Gold, B.; Oppenheim, A. V.; Rader, C. M. (1969). "Theory and Implementation of the Discrete Hilbert Transform".Proceedings of the 1969 Polytechnic Institute of Brooklyn Symposium. New York.
Grafakos, Loukas (1994). "An elementary proof of the square summability of the discrete Hilbert transform".American Mathematical Monthly.101 (5). Mathematical Association of America:456–458.doi:10.2307/2974910.JSTOR2974910.