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 realvalued 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 1⁄t 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 halfplane, 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 L^{2} and ℓ^{2}. In 1928, Marcel Riesz proved that the Hilbert transform can be defined for u in (L^{p} 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.
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
In the following table, the frequency parameter is real.
Signal 
Hilbert transform^{[fn 1]} 

^{[fn 2]} 

^{[fn 2]} 

 
 
(see Dawson function)  
Sinc function 

Dirac delta function 

Characteristic Function 
Notes
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 welldefined at all, as the improper integral defining it must converge in a suitable sense. However, the Hilbert transform is welldefined 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 L^{p} 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 L^{1} function does converge, however, in L^{1}weak, and the Hilbert transform is a bounded operator from L^{1} to L^{1,w}.^{[18]} (In particular, since the Hilbert transform is also a multiplier operator on L^{2}, Marcinkiewicz interpolation and a duality argument furnishes an alternative proof that H is bounded on L^{p}.)
If 1 < p < ∞, then the Hilbert transform on is a bounded linear operator, meaning that there exists a constant C_{p} 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 socalled 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]}
The Hilbert transform is an antiself 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]}
The Hilbert transform is an antiinvolution,^{[23]} meaning that
provided each transform is welldefined. Since H preserves the space , this implies in particular that the Hilbert transform is invertible on , and that
Because H^{2} = −I ("I" is the identity operator) on the real Banach space of realvalued 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 realvalued 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 halfplanes in the Hardy space H^{2} 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 L^{p}. Alternatively, one may use the fact that h(t) is the distributional derivative of the function logt/π; 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 u ∈ L^{p} and v ∈ L^{q} provided that
from a theorem due to Titchmarsh.^{[26]}
The Hilbert transform has the following invariance properties on .
Up to a multiplicative constant, the Hilbert transform is the only bounded operator on L^{2} 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 U_{g} 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 L^{2} boundary values of holomorphic functions on the upper and lower halfplanes. and its conjugate consist of exactly those L^{2} 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 U_{g}. The restrictions of the operators U_{g} to and its conjugate give irreducible representations of – the socalled limit of discrete series representations.^{[28]}
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 L^{p}, 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 L^{p} 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.
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 illdefined. 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 .
The Hilbert transform can be understood in terms of a pair of functions f(x) and g(x) such that the function
Suppose that Then, by the theory of the Poisson integral, f admits a unique harmonic extension into the upper halfplane, 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 halfplane 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
Thus
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 (nontangential) boundary limit of v(x,y) as y → 0 is the Hilbert transform of f. Thus, succinctly,
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 halfplane and the Hilbert transform.^{[33]} It gives necessary and sufficient conditions for a complexvalued squareintegrable function F(x) on the real line to be the boundary value of a function in the Hardy space H^{2}(U) of holomorphic functions in the upper halfplane U.
The theorem states that the following conditions for a complexvalued squareintegrable function are equivalent:
A weaker result is true for functions of class L^{p} for p > 1.^{[34]} Specifically, if F(z) is a holomorphic function such that
for all y, then there is a complexvalued function F(x) in such that F(x + i y) → F(x) in the L^{p} norm as y → 0 (as well as holding pointwise almost everywhere). Furthermore,
where f is a realvalued function in and g is the Hilbert transform (of class L^{p}) of f.
This is not true in the case p = 1. In fact, the Hilbert transform of an L^{1} function f need not converge in the mean to another L^{1} 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]}
One form of the Riemann–Hilbert problem seeks to identify pairs of functions F_{+} and F_{−} such that F_{+} is holomorphic on the upper halfplane and F_{−} is holomorphic on the lower halfplane, such that for x along the real axis,
where f(x) is some given realvalued function of . The lefthand side of this equation may be understood either as the difference of the limits of F_{±} from the appropriate halfplanes, 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]}
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,
The Hilbert kernel (for the circular Hilbert transform) can be obtained by making the Cauchy kernel 1⁄x 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) = (x – i) / (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 L^{2}(T) onto The operator U carries the Hardy space H^{2}(T) onto the Hardy space .^{[39]}
Bedrosian's theorem states that the Hilbert transform of the product of a lowpass and a highpass signal with nonoverlapping spectra is given by the product of the lowpass signal and the Hilbert transform of the highpass signal, or
where f_{LP} and f_{HP} are the low and highpass 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 highfrequency sinusoidal "carrier":
where u_{m}(t) is the narrow bandwidth "message" waveform, such as voice or music. Then by Bedrosian's theorem:^{[41]}
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]}

(Eq.1) 
A Fourier transform property indicates that this complex heterodyne operation can shift all the negative frequency components of u_{m}(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 form:^{[43]}
is called angle modulation, which includes both phase modulation and frequency modulation. The instantaneous frequency is For sufficiently large ω, compared to :
When u_{m}(t) in Eq.1 is also an analytic representation (of a message waveform), that is:
the result is singlesideband modulation:
whose transmitted component is:^{[44]}^{[45]}
The function presents two causalitybased challenges to practical implementation in a convolution (in addition to its undefined value at 0):
For a discrete function, , with discretetime 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]}
where
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 antisymmetric 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 antisymmetric 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 oddtap filter. However
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 complexvalued 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 halfcycle of h_{N}[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 h_{N}[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 zerovalued 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 overlapsave 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 nonzero values of is the output sequence includes N − M + 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 h_{N}[n] (green and red in Figure 3). The fact that h_{N}[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 overlapsave method needs M < N.
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]}
{{cite book}}
: CS1 maint: location (link)