Hilbert transform

From Wikipedia, the free encyclopedia

In mathematics and signal processing, the Hilbert transform is a specific singular integral that takes a function, u(t) of a real variable and produces another function of a real variable H(u)(t). The Hilbert transform is given by the Cauchy principal value of the convolution with the function (see § Definition). The Hilbert transform has a particularly simple representation in the frequency domain: It imparts a phase 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 the analytic representation of a real-valued signal u(t). The Hilbert transform was first introduced by David Hilbert in this setting, to solve a special case of the Riemann–Hilbert problem for analytic functions.


The Hilbert transform of u can be thought of as the convolution of u(t) with the function h(t) = 1/ π t, known as the Cauchy kernel. Because 1t is not integrable across t = 0, the integral defining the convolution does not always converge. Instead, the Hilbert transform is defined using the Cauchy principal value (denoted here by p.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 of u with the tempered distribution p.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 function u, 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 the Fourier transform of u(t) (see § Relationship with the Fourier transform, below).

For an analytic function in the upper half-plane, the Hilbert transform describes the relationship between the real part and the imaginary part of the boundary values. That is, if f(z) is analytic in the upper half complex plane {z : Im{z} > 0}, and u(t) = Re{f (t + 0·i)}, then Im{f (t + 0·i)} = H(u)(t) up to an additive constant, provided this Hilbert transform exists.


In signal processing the Hilbert transform of u(t) is commonly denoted by .[3] However, in mathematics, this notation is already extensively used to denote the Fourier transform of u(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 the Riemann–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 in Göttingen. The results were later published by Hermann 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 spaces L2 and 2. In 1928, Marcel Riesz proved that the Hilbert transform can be defined for u in (Lp space) for 1 < p < ∞, that the Hilbert transform is a bounded operator on for 1 < 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 for Antoni Zygmund and Alberto Calderón during their study of singular 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.

Relationship with the Fourier transform[edit]

The Hilbert transform is a multiplier operator.[14] The multiplier of H is σH(ω) = −i sgn(ω), where sgn is the signum function. Therefore:

where denotes the Fourier transform. Since sgn(x) = sgn(2πx), it follows that this result applies to the three common definitions of .

By Euler's formula,

Therefore, H(u)(t) has the effect of shifting the phase of the negative frequency components of u(t) by +90° (π2 radians) and the phase of the positive frequency components by −90°, and i·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 of u(t) are respectively shifted by +180° and −180°, which are equivalent amounts. The signal is negated; i.e., H(H(u)) = −u, because

Table of selected Hilbert transforms[edit]

In the following table, the frequency parameter is real.

Hilbert transform[fn 1]
[fn 2]

[fn 2]

(see Dawson function)
Sinc function
Dirac delta function
Characteristic Function


  1. ^ 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.
  2. ^ a b The 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.

Domain of definition[edit]

It is by no means obvious that the Hilbert transform is well-defined at all, as the improper 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 for 1 < p < ∞.

More precisely, if u is in for 1 < p < ∞, then the limit defining the improper integral

exists for almost every t. 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 the Lp norm, as well as pointwise almost everywhere, by the Titchmarsh theorem.[16]

In the case p = 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 an L1 function does converge, however, in L1-weak, and the Hilbert transform is a bounded operator from L1 to L1,w.[18] (In particular, since the Hilbert transform is also a multiplier operator on L2, Marcinkiewicz interpolation and a duality argument furnishes an alternative proof that H is bounded on Lp.)



If 1 < p < ∞, then the Hilbert transform on is a bounded linear operator, meaning that there exists a constant Cp such that

for all .[19]

The best constant is given by[20]

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 valued f. 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

to f in .[21]

Anti-self adjointness[edit]

The Hilbert transform is an anti-self adjoint operator relative to the duality pairing between and the dual space , where p and q are Hölder conjugates and 1 < p, q < ∞. Symbolically,

for and .[22]

Inverse transform[edit]

The Hilbert transform is an anti-involution,[23] meaning that

provided each transform is well-defined. Since H preserves the space , this implies in particular that the Hilbert transform is invertible on , and that

Complex structure[edit]

Because H2 = −I ("I" is the identity operator) on the real Banach space of real-valued functions in , the Hilbert transform defines a linear complex structure on this Banach space. In particular, when p = 2, the Hilbert transform gives the Hilbert space of real-valued functions in the structure of a complex Hilbert space.

The (complex) eigenstates of the Hilbert transform admit representations as holomorphic functions in the upper and lower half-planes in the Hardy space H2 by the Paley–Wiener theorem.


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 provided u and its first k derivatives belong to .[24] One can check this easily in the frequency domain, where differentiation becomes multiplication by ω.


The Hilbert transform can formally be realized as a convolution with the tempered distribution[25]

Thus formally,

However, a priori this may only be defined for u a distribution of compact support. It is possible to work somewhat rigorously with this since compactly supported functions (which are distributions a fortiori) are dense in Lp. Alternatively, one may use the fact that h(t) is the distributional derivative of the function log|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 on only one of either of the factors:

This is rigorously true if u and v are compactly supported distributions since, in that case,

By passing to an appropriate limit, it is thus also true if uLp and vLq provided that

from a theorem due to Titchmarsh.[26]


The Hilbert transform has the following invariance properties on .

  • It commutes with translations. That is, it commutes with the operators Ta f(x) = f(x + a) for all a in
  • It commutes with positive dilations. That is it commutes with the operators Mλ f (x) = f (λ x) for all λ > 0.
  • It anticommutes with the reflection R f (x) = f (−x).

Up to a multiplicative constant, the Hilbert transform is the only bounded operator on L2 with these properties.[27]

In fact there is a wider set of operators that commute with the Hilbert transform. The group acts by unitary operators Ug on the space by the formula

This unitary representation is an example of a principal 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 of L2 boundary values of holomorphic functions on the upper and lower halfplanes. and its conjugate consist of exactly those L2 functions with Fourier transforms vanishing on the negative and positive parts of the real axis respectively. Since the Hilbert transform is equal to H = −i (2P − I), with P being the orthogonal projection from onto and I the identity operator, it follows that and its orthogonal complement are eigenspaces of H for the eigenvalues ±i. In other words, H commutes with the operators Ug. The restrictions of the operators Ug to and its conjugate give irreducible representations of – the so-called limit of discrete series representations.[28]

Extending the domain of definition[edit]

Hilbert transform of distributions[edit]

It is further possible to extend the Hilbert transform to certain spaces of distributions (Pandey 1996, Chapter 3). Since the Hilbert transform commutes with differentiation, and is a bounded operator on Lp, H restricts to give a continuous transform on the inverse limit of Sobolev spaces:

The Hilbert transform can then be defined on the dual space of , denoted , consisting of Lp distributions. This is accomplished by the duality pairing:
For , define:

It is possible to define the Hilbert transform on the space of tempered 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.

Hilbert transform of bounded functions[edit]

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 the Banach space of bounded mean oscillation (BMO) classes.

Interpreted naïvely, the Hilbert transform of a bounded function is clearly ill-defined. For instance, with u = sgn(x), the integral defining H(u) diverges almost everywhere to ±∞. To alleviate such difficulties, the Hilbert transform of an L function is therefore defined by the following regularized form of the integral

where as above h(x) = 1/πx and

The modified transform H 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.

A deep result of Fefferman's work[31] is that a function is of bounded mean oscillation if and only if it has the form f + H(g) for some .

Conjugate functions[edit]

The Hilbert transform can be understood in terms of a pair of functions f(x) and g(x) such that the function

is the boundary value of a holomorphic function F(z) in the upper half-plane.[32] Under these circumstances, if f and g are sufficiently integrable, then one is the Hilbert transform of the other.

Suppose that Then, by the theory of the Poisson integral, f admits a unique harmonic extension into the upper half-plane, and this extension is given by

which is the convolution of f with the Poisson kernel

Furthermore, there is a unique harmonic function v defined in the upper half-plane such that F(z) = u(z) + i v(z) is holomorphic and

This harmonic function is obtained from f by taking a convolution with the conjugate Poisson kernel


Indeed, the real and imaginary parts of the Cauchy kernel are

so that F = u + i v is holomorphic by Cauchy's integral formula.

The function v obtained from u in this way is called the harmonic conjugate of u. The (non-tangential) boundary limit of v(x,y) as y → 0 is the Hilbert transform of f. Thus, succinctly,

Titchmarsh's theorem[edit]

Titchmarsh's theorem (named for E. 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-valued square-integrable function F(x) on the real line to be the boundary value of a function in the Hardy space H2(U) of holomorphic functions in the upper half-plane U.

The theorem states that the following conditions for a complex-valued square-integrable function are equivalent:

  • F(x) is the limit as zx of a holomorphic function F(z) in the upper half-plane such that
  • The real and imaginary parts of F(x) are Hilbert transforms of each other.
  • The Fourier transform vanishes for x < 0.

A weaker result is true for functions of class Lp for p > 1.[34] Specifically, if F(z) is a holomorphic function such that

for all y, then there is a complex-valued function F(x) in such that F(x + i y) → F(x) in the Lp norm as y → 0 (as well as holding pointwise almost everywhere). Furthermore,

where f is a real-valued function in and g is the Hilbert transform (of class Lp) of f.

This is not true in the case p = 1. In fact, the Hilbert transform of an L1 function f need not converge in the mean to another L1 function. Nevertheless,[35] the Hilbert transform of f does converge almost everywhere to a finite function g such that

This result is directly analogous to one by Andrey 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 (see Paley–Wiener theorem), as well as work by Riesz, Hille, and Tamarkin[37]

Riemann–Hilbert problem[edit]

One form of the Riemann–Hilbert problem seeks to identify pairs of functions F+ and F such that F+ is holomorphic on the upper half-plane and F is holomorphic on the lower half-plane, such that for x along the real axis,

where f(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 of F± from the appropriate half-planes, or as a hyperfunction distribution. Two functions of this form are a solution of the Riemann–Hilbert problem.

Formally, if F± solve the Riemann–Hilbert problem

then the Hilbert transform of f(x) is given by[38]

Hilbert transform on the circle[edit]

For a periodic function f 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 the Hilbert 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 kernel 1x periodic. More precisely, for x ≠ 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 transform C(x) = (xi) / (x + i), which carries the real line onto the circle and the upper half plane onto the unit disk. It induces a unitary map

of L2(T) onto The operator U carries the Hardy space H2(T) onto the Hardy space .[39]

Hilbert transform in signal processing[edit]

Bedrosian's theorem[edit]

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

where fLP and fHP are the low- and high-pass signals respectively.[40] A category of communication signals to which this applies is called the narrowband signal model. A member of that category is amplitude modulation of a high-frequency sinusoidal "carrier":

where um(t) is the narrow bandwidth "message" waveform, such as voice or music. Then by Bedrosian's theorem:[41]

Analytic representation[edit]

A specific type of conjugate function is:

known as the analytic representation of The name reflects its mathematical tractability, due largely to Euler's formula. Applying Bedrosian's theorem to the narrowband model, the analytic representation is:[42]






A Fourier transform property indicates that this complex heterodyne operation can shift all the negative frequency components of um(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.

Angle (phase/frequency) modulation[edit]

The form:[43]

is called angle modulation, which includes both phase modulation and frequency modulation. The instantaneous frequency is    For sufficiently large ω, compared to :


Single sideband modulation (SSB)[edit]

When um(t) in Eq.1 is also an analytic representation (of a message waveform), that is:

the result is single-sideband modulation:

whose transmitted component is:[44][45]


The function presents two challenges to practical implementation as a convolution:

  • Its duration is infinite (technically infinite support). A finite length approximation must be used instead. But windowing the length also reduces the effective frequency range of the transform. The shorter the window, the greater the losses at low and high frequencies. See also quadrature filter.
  • It is a non-causal filter. So a delayed version, is required. The corresponding output is subsequently delayed by When creating the imaginary part of an analytic signal, the source (real part) must be delayed by the equivalent amount.

Discrete Hilbert transform[edit]

Figure 1: Filter whose frequency response is bandlimited to about 95% of the Nyquist frequency
Figure 2: Hilbert transform filter with a highpass frequency response
Figure 3.
Figure 4. The Hilbert transform of cos(ωt) is sin(ωt). This figure shows sin(ω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, , with discrete-time Fourier transform (DTFT), , and discrete Hilbert transform , the DTFT of in the region π < ω < π is given by:

The inverse DTFT, using the convolution theorem, is:[46]


which is an infinite impulse response (IIR). When the convolution is performed numerically, an FIR approximation is substituted for h[n], as shown in Figure 1. An FIR filter with an odd number of anti-symmetric coefficients is called Type III, which inherently exhibits responses of zero magnitude at frequencies 0 and Nyquist, resulting in this case in a bandpass filter shape. A Type IV design (even number of anti-symmetric coefficients) is shown in Figure 2. Since the magnitude response at the Nyquist frequency does not drop out, it approximates an ideal Hilbert transformer a little better than the odd-tap filter. However

  • A typical (i.e. properly filtered and sampled) u[n] sequence has no useful components at the Nyquist frequency.
  • The Type IV impulse response requires a 12 sample shift in the h[n] sequence. That causes the zero-valued coefficients to become non-zero, as seen in Figure 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 an analytic signal. The group delay of Type IV is halfway between two samples.

The MATLAB function, hilbert(u,N),[47] convolves a u[n] sequence with the periodic summation:[A]


and returns one cycle (N samples) of the periodic result in the imaginary part of a complex-valued output sequence. The convolution is implemented in the frequency domain as the product of the array    with samples of the i sgn(ω) distribution (whose real and imaginary components are all just 0 or ±1). Figure 3 compares a half-cycle of hN[n] with an equivalent length portion of h[n]. Given an FIR approximation for denoted by substituting for the i sgn(ω) samples results in an FIR version of the convolution.

The real part of the output sequence is the original input sequence, so that the complex output is an analytic representation of u[n]. When the input is a segment of a pure cosine, the resulting convolution for two different values of N is depicted in Figure 4 (red and blue plots). Edge effects prevent the result from being a pure sine function (green plot). Since hN[n] 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 N 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 differences. But their duration is dominated by the inherent rise and fall times of the h[n] impulse response.

An appreciation for the edge effects is important when a method called overlap-save is used to perform the convolution on a long u[n] sequence. Segments of length N are convolved with the periodic function:

When the duration of non-zero values of is the output sequence includes NM + 1 samples of M − 1 outputs are discarded from each block of N, and the input blocks are overlapped by that amount to prevent gaps.

Figure 5 is an example of using both the IIR hilbert(·) function and the FIR approximation. In the example, 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 h[n] and hN[n] (green and red in Figure 3). The fact that hN[n] is tapered (windowed) is actually helpful in this context. The real problem is that it's not windowed enough. Effectively, M = N, whereas the overlap-save method needs M < N.

Number-theoretic Hilbert transform[edit]

The number theoretic Hilbert transform is an extension[50] of the discrete Hilbert transform to integers modulo an appropriate prime number. In this it follows the generalization of discrete Fourier transform to number theoretic transforms. The number theoretic Hilbert transform can be used to generate sets of orthogonal discrete sequences.[51]

See also[edit]


  1. ^ see § Periodic convolution, Eq.4b
  2. ^ A closed form version of for even values of is:[48]
  3. ^ A closed form version of for odd values of is:[49]

Page citations[edit]

  1. ^ due to Schwartz 1950; see Pandey 1996, Chapter 3.
  2. ^ Zygmund 1968, §XVI.1
  3. ^ e.g., Brandwood 2003, p. 87
  4. ^ e.g., Stein & Weiss 1971
  5. ^ e.g., Bracewell 2000, p. 359
  6. ^ Kress 1989.
  7. ^ Bitsadze 2001.
  8. ^ a b Khvedelidze 2001.
  9. ^ Hilbert 1953.
  10. ^ Hardy, Littlewood & Pólya 1952, §9.1.
  11. ^ Hardy, Littlewood & Pólya 1952, §9.2.
  12. ^ Riesz 1928.
  13. ^ Calderón & Zygmund 1952.
  14. ^ Duoandikoetxea 2000, Chapter 3.
  15. ^ King 2009b.
  16. ^ Titchmarsh 1948, Chapter 5.
  17. ^ Titchmarsh 1948, §5.14.
  18. ^ Stein & Weiss 1971, Lemma V.2.8.
  19. ^ This theorem is due to Riesz 1928, VII; see also Titchmarsh 1948, Theorem 101.
  20. ^ This result is due to Pichorides 1972; see also Grafakos 2004, Remark 4.1.8.
  21. ^ See for example Duoandikoetxea 2000, p. 59.
  22. ^ Titchmarsh 1948, Theorem 102.
  23. ^ Titchmarsh 1948, p. 120.
  24. ^ Pandey 1996, §3.3.
  25. ^ Duistermaat & Kolk 2010, p. 211.
  26. ^ Titchmarsh 1948, Theorem 104.
  27. ^ Stein 1970, §III.1.
  28. ^ See Bargmann 1947, Lang 1985, and Sugiura 1990.
  29. ^ Gel'fand & Shilov 1968.
  30. ^ Calderón & Zygmund 1952; see Fefferman 1971.
  31. ^ Fefferman 1971; Fefferman & Stein 1972
  32. ^ Titchmarsh 1948, Chapter V.
  33. ^ Titchmarsh 1948, Theorem 95.
  34. ^ Titchmarsh 1948, Theorem 103.
  35. ^ Titchmarsh 1948, Theorem 105.
  36. ^ Duren 1970, Theorem 4.2.
  37. ^ see King 2009a, § 4.22.
  38. ^ Pandey 1996, Chapter 2.
  39. ^ Rosenblum & Rovnyak 1997, p. 92.
  40. ^ Schreier & Scharf 2010, 14.
  41. ^ Bedrosian 1962.
  42. ^ Osgood, p. 320
  43. ^ Osgood, p. 320
  44. ^ Franks 1969, p. 88
  45. ^ Tretter 1995, p. 80 (7.9)
  46. ^ Rabiner 1975
  47. ^ MathWorks. "hilbert – Discrete-time analytic signal using Hilbert transform". MATLAB Signal Processing Toolbox Documentation. Retrieved 2021-05-06.
  48. ^ Johansson, p. 24
  49. ^ Johansson, p. 25
  50. ^ Kak 1970.
  51. ^ Kak 2014.


Further reading[edit]

External links[edit]