# Hilbert transform

In mathematics and in signal processing, the Hilbert transform is a linear operator that takes a function, u(t), and produces a function, H(u)(t), with the same domain.

The Hilbert transform is important in signal processing, where it derives the analytic representation of a signal u(t). This means that the real signal u(t) is extended into the complex plane such that it satisfies the Cauchy–Riemann equations. For example, the Hilbert transform leads to the harmonic conjugate of a given function in Fourier analysis, aka harmonic analysis. Equivalently, it is an example of a singular integral operator and of a Fourier multiplier.

The Hilbert transform was originally defined for periodic functions, or equivalently for functions on the circle, in which case it is given by convolution with the Hilbert kernel. More commonly, however, the Hilbert transform refers to a convolution with the Cauchy kernel, for functions defined on the real line R (the boundary of the upper half-plane). The Hilbert transform is closely related to the Paley–Wiener theorem, another result relating holomorphic functions in the upper half-plane and Fourier transforms of functions on the real line.

The Hilbert transform is named after David Hilbert, who first introduced the operator to solve a special case of the Riemann–Hilbert problem for holomorphic functions.

The Hilbert transform, in red, of a square wave, in blue

## Introduction

The Hilbert transform of u can be thought of as the convolution of u(t) with the function h(t) = 1/(πt). Because h(t) is not integrable, the integrals defining the convolution do not 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:

${\displaystyle H(u)(t)=\operatorname {p.v.} \int _{-\infty }^{\infty }u(\tau )h(t-\tau )\,d\tau ={\frac {1}{\pi }}\ \operatorname {p.v.} \int _{-\infty }^{\infty }{\frac {u(\tau )}{t-\tau }}\,d\tau }$

provided this integral exists as a principal value. This is precisely the convolution of u with the tempered distribution p.v. 1/πt (due to Schwartz (1950); see Pandey (1996, Chapter 3)). Alternatively, by changing variables, the principal value integral can be written explicitly (Zygmund 1968, §XVI.1) as:

${\displaystyle H(u)(t)=-{\frac {1}{\pi }}\lim _{\varepsilon \rightarrow 0}\int _{\varepsilon }^{\infty }{\frac {u(t+\tau )-u(t-\tau )}{\tau }}\,d\tau .}$

When the Hilbert transform is applied twice in succession to a function u, the result is negative u:

${\displaystyle H(H(u))(t)=-u(t)}$

provided the integrals defining both iterations converge in a suitable sense. In particular, the inverse transform is −H. 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 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 plane 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.

### Notation

In signal processing the Hilbert transform of u(t) is commonly denoted by ${\displaystyle {\widehat {u}}(t)\,}$ (e.g., Brandwood 2003, pg 87). However, in mathematics, this notation is already extensively used to denote the Fourier transform of u(t) (e.g., Stein & Weiss 1971). Occasionally, the Hilbert transform may be denoted by ${\displaystyle {\tilde {u}}(t)}$. Furthermore, many sources define the Hilbert transform as the negative of the one defined here (e.g., Bracewell 2000, pg 359).

## History

The Hilbert transform arose in Hilbert's 1905 work on a problem Riemann posed concerning analytic functions,(Kress (1989)Bitsadze (2001)) 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 (Khvedelidze 2001; Hilbert 1953). 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 (Hardy, Littlewood & Polya 1952, §9.1). Schur improved Hilbert's results about the discrete Hilbert transform and extended them to the integral case (Hardy, Littlewood & Polya 1952, §9.2). 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(R) for 1 ≤ p < ∞, that the Hilbert transform is a bounded operator on Lp(R) for 1 < p < ∞, and that similar results hold for the Hilbert transform on the circle as well as the discrete Hilbert transform (Riesz 1928). The Hilbert transform was a motivating example for Antoni Zygmund and Alberto Calderón during their study of singular integrals (Calderón & Zygmund 1952). 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

The Hilbert transform is a multiplier operator (Duoandikoetxea 2000, Chapter 3). The multiplier of H is σH(ω) = −i sgn(ω) where sgn is the signum function. Therefore:

${\displaystyle {\mathcal {F}}(H(u))(\omega )=(-i\,\operatorname {sgn} (\omega ))\cdot {\mathcal {F}}(u)(\omega )}$

where ${\displaystyle {\mathcal {F}}}$ denotes the Fourier transform. Since sgn(x) = sgn(2πx), it follows that this result applies to the three common definitions of ${\displaystyle {\mathcal {F}}}$.

${\displaystyle \sigma _{H}(\omega )={\begin{cases}i=e^{+{\frac {i\pi }{2}}},&{\text{for }}\omega <0\\0,&{\text{for }}\omega =0\\-i=e^{-{\frac {i\pi }{2}}},&{\text{for }}\omega >0\end{cases}}}$

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.

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:

${\displaystyle {\big (}\sigma _{H}(\omega ){\big )}^{2}=e^{\pm i\pi }=-1\qquad {\text{for }}\omega \neq 0}$

## Table of selected Hilbert transforms

Signal
${\displaystyle u(t)\,}$
Hilbert transform[fn 1]
${\displaystyle H(u)(t)}$
${\displaystyle \sin(t)}$ [fn 2] ${\displaystyle -\cos(t)}$
${\displaystyle \cos(t)}$ [fn 2] ${\displaystyle \sin(t)\,}$
${\displaystyle \exp \left(it\right)}$ ${\displaystyle -i\exp \left(it\right)}$
${\displaystyle \exp \left(-it\right)}$ ${\displaystyle i\exp \left(-it\right)}$
${\displaystyle 1 \over t^{2}+1}$ ${\displaystyle t \over t^{2}+1}$
${\displaystyle e^{-t^{2}}}$ ${\displaystyle 2\pi ^{-1/2}F(t)}$ see Dawson function
Sinc function
${\displaystyle \sin(t) \over t}$
${\displaystyle 1-\cos(t) \over t}$
Rectangular function
${\displaystyle \sqcap (t)}$
${\displaystyle {1 \over \pi }\ln \left|{t+{1 \over 2} \over t-{1 \over 2}}\right|}$
Dirac delta function
${\displaystyle \delta (t)\,}$
${\displaystyle {1 \over \pi t}}$
Characteristic Function
${\displaystyle \chi _{[a,b]}(t)\,}$
${\displaystyle {{\frac {1}{\pi }}\ln \left\vert {\frac {t-a}{t-b}}\right\vert }}$
Notes
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 in a distributional sense, if there is a concern that the integral defining them is otherwise conditionally convergent. In the periodic setting this result holds without any difficulty.

An extensive table of Hilbert transforms is available (King 2009). Note that the Hilbert transform of a constant is zero.

## Domain of definition

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 Lp(R) for 1 < p < ∞.

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

${\displaystyle H(u)(t)=-{\frac {1}{\pi }}\lim _{\varepsilon \rightarrow 0}\int _{\epsilon }^{\infty }{\frac {u(t+\tau )-u(t-\tau )}{\tau }}\,d\tau }$

exists for almost every t. The limit function is also in Lp(R) and is in fact the limit in the mean of the improper integral as well. That is,

${\displaystyle -{\frac {1}{\pi }}\int _{\epsilon }^{\infty }{\frac {u(t+\tau )-u(t-\tau )}{\tau }}\,d\tau \to H(u)(t)}$

as ε→0 in the Lp-norm, as well as pointwise almost everywhere, by the Titchmarsh theorem (Titchmarsh 1948, Chapter 5).

In the case p = 1, the Hilbert transform still converges pointwise almost everywhere, but may itself fail to be integrable, even locally. (Titchmarsh 1948, §5.14) 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 (Stein & Weiss 1971, Lemma V.2.8). (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.)

## Properties

### Boundedness

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

${\displaystyle \|Hu\|_{p}\leq C_{p}\|u\|_{p}}$

for all uLp(R). This theorem is due to Riesz (1928, VII); see also Titchmarsh (1948, Theorem 101). The best constant Cp is given by

${\displaystyle C_{p}={\begin{cases}\tan {\frac {\pi }{2p}}&{\text{for }}1

This result is due to (Pichorides 1972); see also Grafakos (2004, Remark 4.1.8). The same best constants hold for the periodic Hilbert transform.

The boundedness of the Hilbert transform implies the Lp(R) convergence of the symmetric partial sum operator

${\displaystyle S_{R}f=\int _{-R}^{R}{\hat {f}}(\xi )e^{2\pi ix\xi }\,d\xi }$

to f in Lp(R), see for example (Duoandikoetxea 2000, p. 59).

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

${\displaystyle \langle Hu,v\rangle =\langle u,-Hv\rangle }$

for u ∈ Lp(R) and v ∈ Lq(R) (Titchmarsh 1948, Theorem 102).

### Inverse transform

The Hilbert transform is an anti-involution (Titchmarsh 1948, p. 120), meaning that

${\displaystyle H(H(u))=-u}$

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

${\displaystyle H^{-1}=-H}$

### Differentiation

Formally, the derivative of the Hilbert transform is the Hilbert transform of the derivative, i.e. these two linear operators commute:

${\displaystyle H\left({\frac {du}{dt}}\right)={\frac {d}{dt}}H(u)}$

Iterating this identity,

${\displaystyle H\left({\frac {d^{k}u}{dt^{k}}}\right)={\frac {d^{k}}{dt^{k}}}H(u)}$

This is rigorously true as stated provided u and its first k derivatives belong to Lp(R) (Pandey 1996, §3.3). One can check this easily in the frequency domain, where differentiation becomes multiplication by ω.

### Convolutions

The Hilbert transform can formally be realized as a convolution with the tempered distribution (Duistermaat & Kolk 2010, p. 211)

${\displaystyle h(t)=\operatorname {p.v.} {\frac {1}{\pi t}}}$

Thus formally,

${\displaystyle H(u)=h*u}$

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

${\displaystyle H(u)(t)={\frac {d}{dt}}\left({\frac {1}{\pi }}(u*\log |\cdot |)(t)\right)}$

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 on either factor:

${\displaystyle H(u*v)=H(u)*v=u*H(v)}$

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

${\displaystyle h*(u*v)=(h*u)*v=u*(h*v)}$

By passing to an appropriate limit, it is thus also true if u ∈ Lp and v ∈ Lr provided

${\displaystyle 1<{\frac {1}{p}}+{\frac {1}{r}}}$

a theorem due to Titchmarsh (1948, Theorem 104).

### Invariance

The Hilbert transform has the following invariance properties on L2(R).

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

Up to a multiplicative constant, the Hilbert transform is the only bounded operator on L2 with these properties (Stein 1970, §III.1).

In fact there is a larger group of operators commuting with the Hilbert transform. The group SL(2,R) acts by unitary operators Ug on the space L2(R) by the formula

${\displaystyle \displaystyle {U_{g}^{-1}f(x)=(cx+d)^{-1}f\left({ax+b \over cx+d}\right),\,\,\,g={\begin{pmatrix}a&b\\c&d\end{pmatrix}}}}$

This unitary representation is an example of a principal series representation of SL(2,R). In this case it is reducible, splitting as the orthogonal sum of two invariant subspaces, Hardy space H2(R) and its conjugate. These are the spaces of L2 boundary values of holomorphic functions on the upper and lower halfplanes. H2(R) 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 L2(R) onto H2(R), it follows that H2(R) and its orthogonal are eigenspaces of H for the eigenvalues ± i. In other words, H commutes with the operators Ug. The restrictions of the operators Ug to H2(R) and its conjugate give irreducible representations of SL(2,R)—the so-called limit of discrete series representations.[1]

## Extending the domain of definition

### Hilbert transform of distributions

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:

${\displaystyle {\mathcal {D}}_{L^{p}}={\underset {n\to \infty }{\underset {\longleftarrow }{\lim }}}W^{n,p}(\mathbb {R} )}$

The Hilbert transform can then be defined on the dual space of ${\displaystyle {\mathcal {D}}_{L^{p}}}$, denoted ${\displaystyle {\mathcal {D}}_{L^{p}}'}$, consisting of Lp distributions. This is accomplished by the duality pairing: for ${\displaystyle u\in {\mathcal {D}}'_{L^{p}}}$, define ${\displaystyle H(u)\in {\mathcal {D}}'_{L^{p}}}$ by

${\displaystyle \langle Hu,v\rangle {\overset {\mathrm {def} }{=}}\langle u,-Hv\rangle }$

for all ${\displaystyle v\in {\mathcal {D}}_{L^{p}}}$.

It is possible to define the Hilbert transform on the space of tempered distributions as well by an approach due to Gel'fand & Shilov (1967)[page needed], but considerably more care is needed because of the singularity in the integral.

### Hilbert transform of bounded functions

The Hilbert transform can be defined for functions in L(R) as well, but it requires some modifications and caveats. Properly understood, the Hilbert transform maps L(R) 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

${\displaystyle H(u)(t)=\operatorname {p.v.} \int _{-\infty }^{\infty }u(\tau )\left\{h(t-\tau )-h_{0}(-\tau )\right\}\,d\tau }$

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

${\displaystyle h_{0}(x)={\begin{cases}0&{\text{if }}|x|<1\\{\frac {1}{\pi x}}&{\text{otherwise}}\end{cases}}}$

The modified transform H agrees with the original transform on functions of compact support by a general result of Calderón & Zygmund (1952); see Fefferman (1971). The resulting integral, furthermore, converges pointwise almost everywhere, and with respect to the BMO norm, to a function of bounded mean oscillation.

A deep result of Fefferman (1971) and Fefferman & Stein (1972) is that a function is of bounded mean oscillation if and only if it has the form ƒ + H(g) for some ƒ, g ∈ L(R).

## Conjugate functions

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

${\displaystyle F(x)=f(x)+ig(x)}$

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

Suppose that f ∈ Lp(R). 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

${\displaystyle u(x+iy)=u(x,y)={\frac {1}{\pi }}\int _{-\infty }^{\infty }f(s){\frac {y}{(x-s)^{2}+y^{2}}}\,ds}$

which is the convolution of f with the Poisson kernel

${\displaystyle P(x,y)={\frac {1}{\pi }}{\frac {y}{x^{2}+y^{2}}}}$

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

${\displaystyle \lim _{y\to \infty }v(x+iy)=0}$

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

${\displaystyle Q(x,y)={\frac {1}{\pi }}{\frac {x}{x^{2}+y^{2}}}}$

Thus

${\displaystyle v(x,y)={\frac {1}{\pi }}\int _{-\infty }^{\infty }f(s){\frac {x-s}{(x-s)^{2}+y^{2}}}\,ds}$

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

${\displaystyle {\frac {i}{\pi z}}=P(x,y)+iQ(x,y)}$

so that F = u + iv 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,

${\displaystyle H(f)=\lim _{y\to 0}Q(-,y)\star f}$

### Titchmarsh's theorem

A theorem due to Edward Charles Titchmarsh makes precise the relationship between the boundary values of holomorphic functions in the upper half-plane and the Hilbert transform (Titchmarsh 1948, Theorem 95). 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 F : RC are equivalent:

• F(x) is the limit as z → x of a holomorphic function F(z) in the upper half-plane such that
${\displaystyle \int _{-\infty }^{\infty }|F(x+iy)|^{2}\,dx
• The real and imaginary parts of F(x) are Hilbert transforms of each other.
• The Fourier transform ${\displaystyle {\mathcal {F}}(F)(x)}$ vanishes for x < 0.

A weaker result is true for functions of class Lp for p > 1 (Titchmarsh 1948, Theorem 103). Specifically, if F(z) is a holomorphic function such that

${\displaystyle \int _{-\infty }^{\infty }|F(x+iy)|^{p}\,dx

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

${\displaystyle F(x)=f(x)-ig(x)}$

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

This is not true in the case p = 1. In fact, the Hilbert transform of an L1 function ƒ need not converge in the mean to another L1 function. Nevertheless, (Titchmarsh 1948, Theorem 105), the Hilbert transform of ƒ does converge almost everywhere to a finite function g such that

${\displaystyle \int _{-\infty }^{\infty }{\frac {|g(x)|^{p}}{1+x^{2}}}\,dx<\infty }$

This result is directly analogous to one by Andrey Kolmogorov for Hardy functions in the disc (Duren 1970, Theorem 4.2).

### Riemann–Hilbert problem

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,

${\displaystyle F_{+}(x)-F_{-}(x)=f(x)}$

where f(x) is some given real-valued function of x ∈ R. 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

${\displaystyle f(x)=F_{+}(x)-F_{-}(x)}$

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

${\displaystyle H(f)(x)={\frac {1}{i}}(F_{+}(x)+F_{-}(x))}$ (Pandey 1996, Chapter 2).

## Hilbert transform on the circle

For a periodic function f the circular Hilbert transform is defined as

${\displaystyle {\tilde {f}}(x)={\frac {1}{2\pi }}\operatorname {p.v.} \int _{0}^{2\pi }f(t)\cot \left({\frac {x-t}{2}}\right)\,dt}$

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,

${\displaystyle \scriptstyle \cot \left({\frac {x-t}{2}}\right)}$ is known as the Hilbert kernel since it was in this form the Hilbert transform was originally studied (Khvedelidze 2001).

The Hilbert kernel (for the circular Hilbert transform) can be obtained by making the Cauchy kernel 1/x periodic. More precisely, for x ≠ 0

${\displaystyle {\frac {1}{2}}\cot \left({\frac {x}{2}}\right)={\frac {1}{x}}+\sum _{n=1}^{\infty }\left({\frac {1}{x+2n\pi }}+{\frac {1}{x-2n\pi }}\right)}$

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

${\displaystyle Uf(x)=\pi ^{-{\frac {1}{2}}}(x+i)^{-1}f(C(x))}$

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

## Hilbert transform in signal processing

### Bedrosian's theorem

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

${\displaystyle H(f_{LP}(t)f_{HP}(t))=f_{LP}(t)H(f_{HP}(t))}$

where fLP and fHP are the low- and high-pass signals respectively (Schreier & Scharf 2010, 14).

Amplitude modulated signals are modeled as the product of a bandlimited "message" waveform, um(t), and a sinusoidal "carrier":

${\displaystyle u(t)=u_{m}(t)\cdot \cos(\omega t+\phi )}$

When um(t) has no frequency content above the carrier frequency, ${\displaystyle {\frac {\omega }{2\pi }}{\text{ Hz}},}$ then by Bedrosian's theorem:

${\displaystyle H(u)(t)=u_{m}(t)\cdot \sin(\omega t+\phi )}$ (Bedrosian 1962)

### Analytic representation

Main article: analytic signal

In the context of signal processing, the conjugate function interpretation of the Hilbert transform, discussed above, gives the analytic representation of a signal u(t):

${\displaystyle u_{a}(t)=u(t)+i\cdot H(u)(t)}$

which is a holomorphic function in the upper half plane.

For the narrowband model (above), the analytic representation is:

{\displaystyle {\begin{aligned}u_{a}(t)&=u_{m}(t)\cdot \cos(\omega t+\phi )+i\cdot u_{m}(t)\cdot \sin(\omega t+\phi )\\&=u_{m}(t)\cdot \left[\cos(\omega t+\phi )+i\cdot \sin(\omega t+\phi )\right]\end{aligned}}}

${\displaystyle =u_{m}(t)\cdot e^{i(\omega t+\phi )}\,}$   (by Euler's formula)

(Eq.1)

This complex heterodyne operation shifts all the 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.

### Phase/frequency modulation

The form:

${\displaystyle u(t)=A\cdot \cos(\omega t+\phi _{m}(t))}$

is called phase (or frequency) modulation. The instantaneous frequency is  ${\displaystyle \omega +\phi _{m}^{\prime }(t).}$  For sufficiently large ω, compared to  ${\displaystyle \phi _{m}^{\prime }}$:

${\displaystyle H(u)(t)\approx A\cdot \sin(\omega t+\phi _{m}(t))}$

and:

${\displaystyle u_{a}(t)\approx A\cdot e^{i(\omega t+\phi _{m}(t))}}$

### Single sideband modulation (SSB)

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

${\displaystyle u_{m}(t)=m(t)+i\cdot {\widehat {m}}(t)}$

the result is single-sideband modulation:

${\displaystyle u_{a}(t)=(m(t)+i\cdot {\widehat {m}}(t))\cdot e^{i(\omega t+\phi )}}$

whose transmitted component is:

{\displaystyle {\begin{aligned}u(t)&=\operatorname {Re} \{u_{a}(t)\}\\&=m(t)\cdot \cos(\omega t+\phi )-{\widehat {m}}(t)\cdot \sin(\omega t+\phi )\end{aligned}}}

### Causality

The function h with h(t) = 1/(πt) is a non-causal filter and therefore cannot be implemented as is, if u is a time-dependent signal. If u is a function of a non-temporal variable (e.g., spatial) the non-causality might not be a problem. The filter is also of infinite support, which may be a problem in certain applications. Another issue relates to what happens with the zero frequency (DC), which can be avoided by assuring that s does not contain a DC-component.

A practical implementation in many cases implies that a finite support filter, which in addition is made causal by means of a suitable delay, is used to approximate the computation. The approximation may also imply that only a specific frequency range is subject to the characteristic phase shift related to the Hilbert transform. See also quadrature filter.

## Discrete Hilbert transform

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,  ${\displaystyle u[n],}$  with discrete-time Fourier transform (DTFT),  ${\displaystyle U(\omega ),}$  and discrete Hilbert transform  ${\displaystyle {\hat {u}}[n],}$  the DTFT of  ${\displaystyle {\hat {u}}[n]}$  in the region  −π < ω <  π is given by:

${\displaystyle \operatorname {DTFT} \displaystyle ({\hat {u}})=U(\omega )\cdot (-i\cdot \operatorname {sgn}(\omega )).}$

The inverse DTFT, using the convolution theorem, is:

{\displaystyle {\begin{aligned}{\hat {u}}[n]&=\scriptstyle {DTFT}^{-1}\displaystyle (U(\omega ))\ *\ \scriptstyle {DTFT}^{-1}\displaystyle (-i\cdot \operatorname {sgn}(\omega ))\\&=u[n]\ *\ {\frac {1}{2\pi }}\int _{-\pi }^{\pi }(-i\cdot \operatorname {sgn}(\omega ))\cdot e^{i\omega n}d\omega \\&=u[n]\ *\ \underbrace {{\frac {1}{2\pi }}\left[\int _{-\pi }^{0}i\cdot e^{i\omega n}d\omega -\int _{0}^{\pi }i\cdot e^{i\omega n}d\omega \right]} _{h[n]},\end{aligned}}}

where:

${\displaystyle h[n]\ {\stackrel {\mathrm {def} }{=}}\ {\begin{cases}0,&{\text{for }}n{\text{ even}}\\{\frac {2}{\pi n}}&{\text{for }}n{\text{ odd}},\end{cases}}}$

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 Nyquist 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 ½ 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 ${\displaystyle {\hat {u}}[n]}$ with ${\displaystyle u[n],}$ to create an analytic signal. The group delay of Type IV is halfway between two samples.

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

${\displaystyle h_{N}[n]\ {\stackrel {\text{def}}{=}}\ \sum _{m=-\infty }^{\infty }h[n-mN],}$

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  ${\displaystyle \scriptstyle {DFT}\displaystyle \left(u[n]\right)}$  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  ${\displaystyle h[n],}$ denoted by  ${\displaystyle {\tilde {h}}[n],}$  substituting  ${\displaystyle \scriptstyle {DFT}\displaystyle \left({\tilde {h}}[n]\right)}$  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:

${\displaystyle {\tilde {h}}_{N}[n]\ {\stackrel {\text{def}}{=}}\ \sum _{m=-\infty }^{\infty }{\tilde {h}}[n-mN].}$

When the duration of non-zero values of  ${\displaystyle {\tilde {h}}[n]}$  is M < N, the output sequence includes N − M + 1 samples of  ${\displaystyle {\hat {u}}.}$  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 Fig 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

The number theoretic Hilbert transform is an extension (Kak 1970) 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(Kak 2014).