Hilbert transform

Template:Short description In mathematics and signal processing, the Hilbert transform is a specific singular integral that takes a function, Template:Math of a real variable and produces another function of a real variable Template:Math. The Hilbert transform is given by the Cauchy principal value of the convolution with the function <math>1/(\pi t)</math> (see Template:Slink). The Hilbert transform has a particularly simple representation in the frequency domain: It imparts a phase shift of ±90° (Template:Pi/2 radians) to every frequency component of a function, the sign of the shift depending on the sign of the frequency (see Template:Slink). The Hilbert transform is important in signal processing, where it is a component of the analytic representation of a real-valued signal Template:Math. 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.

DefinitionEdit

The Hilbert transform of Template:Mvar can be thought of as the convolution of Template:Math with the function Template:Math, known as the Cauchy kernel. Because 1/Template:Mvar is not integrable across Template:Math, the integral defining the convolution does not always converge. Instead, the Hilbert transform is defined using the Cauchy principal value (denoted here by Template:Math). Explicitly, the Hilbert transform of a function (or signal) Template:Math is given by

\operatorname{H}(u)(t) = \frac{1}{\pi}\, \operatorname{p.v.} \int_{-\infty}^{+\infty} \frac{u(\tau)}{t - \tau}\,\mathrm{d}\tau,

</math>

provided this integral exists as a principal value. This is precisely the convolution of Template:Mvar with the tempered distribution Template:Math.<ref>Due to Template:Harvnb; see Template:Harvnb.</ref> Alternatively, by changing variables, the principal-value integral can be written explicitly<ref>Template:Harvnb.</ref> as

\operatorname{H}(u)(t) = \frac{2}{\pi}\, \lim_{\varepsilon \to 0} \int_\varepsilon^\infty \frac{u(t - \tau) - u(t + \tau)}{2\tau} \,\mathrm{d}\tau.

</math>

When the Hilbert transform is applied twice in succession to a function Template:Mvar, the result is

\operatorname{H}\bigl(\operatorname{H}(u)\bigr)(t) = -u(t),

</math>

provided the integrals defining both iterations converge in a suitable sense. In particular, the inverse transform is <math>-\operatorname{H}</math>. This fact can most easily be seen by considering the effect of the Hilbert transform on the Fourier transform of Template:Math (see Template:Slink 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 Template:Math is analytic in the upper half complex plane Template:Math, and Template:Math, then Template:Math up to an additive constant, provided this Hilbert transform exists.

NotationEdit

In signal processing the Hilbert transform of Template:Math is commonly denoted by <math>\hat{u}(t)</math>.<ref>E.g., Template:Harvnb.</ref> However, in mathematics, this notation is already extensively used to denote the Fourier transform of Template:Math.<ref>E.g., Template:Harvnb.</ref> Occasionally, the Hilbert transform may be denoted by <math>\tilde{u}(t)</math>. Furthermore, many sources define the Hilbert transform as the negative of the one defined here.<ref>E.g., Template:Harvnb.</ref>

HistoryEdit

The Hilbert transform arose in Hilbert's 1905 work on a problem Riemann posed concerning analytic functions,Template:Sfn Template:Sfn 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.Template:Sfn Template:Sfn 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.Template:Sfn Schur improved Hilbert's results about the discrete Hilbert transform and extended them to the integral case.Template:Sfn These results were restricted to the spaces [[Lp space|Template:Math and Template:Math]]. In 1928, Marcel Riesz proved that the Hilbert transform can be defined for u in <math>L^p(\mathbb{R})</math> (L^p space) for Template:Math, that the Hilbert transform is a bounded operator on <math>L^p(\mathbb{R})</math> for Template:Math, and that similar results hold for the Hilbert transform on the circle as well as the discrete Hilbert transform.Template:Sfn The Hilbert transform was a motivating example for Antoni Zygmund and Alberto Calderón during their study of singular integrals.Template:Sfn 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 transformEdit

The Hilbert transform is a multiplier operator.Template:Sfn The multiplier of Template:Math is Template:Math, where Template:Math is the signum function. Therefore:

<math display="block">\mathcal{F}\bigl(\operatorname{H}(u)\bigr)(\omega) = -i \sgn(\omega) \cdot \mathcal{F}(u)(\omega) ,</math>

where <math>\mathcal{F}</math> denotes the Fourier transform. Since Template:Math, it follows that this result applies to the three common definitions of <math> \mathcal{F}</math>.

By Euler's formula, <math display="block">\sigma_\operatorname{H}(\omega) = \begin{cases}

~~i = e^{+i\pi/2} & \text{if } \omega < 0\\
~~                      0 & \text{if } \omega = 0\\
 -i = e^{-i\pi/2} & \text{if } \omega > 0

\end{cases}</math>

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

<math display="block">\left(\sigma_\operatorname{H}(\omega)\right)^2 = e^{\pm i\pi} = -1 \quad \text{for } \omega \neq 0 .</math>

Table of selected Hilbert transformsEdit

In the following table, the frequency parameter <math>\omega</math> is real.

Signal <math>u(t)</math>	Hilbert transform<ref group="fn">Some authors (e.g., Bracewell) use our Template:Math as their definition of the forward transform. A consequence is that the right column of this table would be negated.</ref> <math>\operatorname{H}(u)(t)</math>
<math>\sin(\omega t + \varphi)</math> <ref group="fn" name="ex02">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.</ref>	<math>\begin{array}{lll} \sin\left(\omega t + \varphi - \tfrac{\pi}{2}\right)=-\cos\left(\omega t + \varphi \right), \quad \omega > 0\\ \sin\left(\omega t + \varphi + \tfrac{\pi}{2}\right)=\cos\left(\omega t + \varphi \right), \quad \omega < 0 \end{array}</math>
<math> \cos(\omega t + \varphi) </math> <ref group="fn" name="ex02"/>	<math>\begin{array}{lll} \cos\left(\omega t + \varphi - \tfrac{\pi}{2}\right)=\sin\left(\omega t + \varphi\right), \quad \omega > 0\\ \cos\left(\omega t + \varphi + \tfrac{\pi}{2}\right)=-\sin\left(\omega t + \varphi\right), \quad \omega < 0 \end{array}</math>
<math> e^{i \omega t} </math>	<math>\begin{array}{lll} e^{i\left(\omega t - \tfrac{\pi}{2}\right)}, \quad \omega > 0\\ e^{i\left(\omega t + \tfrac{\pi}{2}\right)}, \quad \omega < 0 \end{array}</math>
<math> e^{-i \omega t} </math>	<math>\begin{array}{lll} e^{-i\left(\omega t - \tfrac{\pi}{2}\right)}, \quad \omega > 0\\ e^{-i\left(\omega t + \tfrac{\pi}{2}\right)}, \quad \omega < 0 \end{array}</math>
<math> 1 \over t^2 + 1 </math>	<math> t \over t^2 + 1 </math>
<math> e^{-t^2} </math>	<math> \frac{2}{\sqrt{\pi\,}} F(t) </math> (see Dawson function)
Sinc function <math> \sin(t) \over t </math>	<math> 1 - \cos(t)\over t </math>
Dirac delta function <math> \delta(t) </math>	<math> {1 \over \pi t} </math>
Characteristic function <math> \chi_{[a,b]}(t) </math>	<math>{ \frac{1}{\,\pi\,}\ln \left\vert \frac{t - a}{t - b}\right\vert }</math>

Notes <references group="fn"/> An extensive table of Hilbert transforms is available.Template:Sfn Note that the Hilbert transform of a constant is zero.

Domain of definitionEdit

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 <math>L^p(\mathbb{R})</math> for Template:Math.

More precisely, if Template:Mvar is in <math>L^p(\mathbb{R})</math> for Template:Math, then the limit defining the improper integral

<math display="block">\operatorname{H}(u)(t) = \frac{2}{\pi} \lim_{\varepsilon \to 0} \int_\varepsilon^\infty \frac{u(t - \tau) - u(t + \tau)}{2\tau}\,d\tau</math>

exists for almost every Template:Mvar. The limit function is also in <math>L^p(\mathbb{R})</math> and is in fact the limit in the mean of the improper integral as well. That is,

<math display="block">\frac{2}{\pi} \int_\varepsilon^\infty \frac{u(t - \tau) - u(t + \tau)}{2\tau}\,\mathrm{d}\tau \to \operatorname{H}(u)(t)</math>

as Template:Math in the Template:Mvar norm, as well as pointwise almost everywhere, by the Titchmarsh theorem.Template:Sfn

In the case Template:Math, the Hilbert transform still converges pointwise almost everywhere, but may itself fail to be integrable, even locally.Template:Sfn In particular, convergence in the mean does not in general happen in this case. The Hilbert transform of an Template:Math function does converge, however, in Template:Math-weak, and the Hilbert transform is a bounded operator from Template:Math to Template:Math.Template:Sfn (In particular, since the Hilbert transform is also a multiplier operator on Template:Math, Marcinkiewicz interpolation and a duality argument furnishes an alternative proof that Template:Mvar is bounded on Template:Math.)

PropertiesEdit

BoundednessEdit

If Template:Math, then the Hilbert transform on <math>L^p(\mathbb{R})</math> is a bounded linear operator, meaning that there exists a constant Template:Mvar such that

<math display="block">\left\|\operatorname{H}u\right\|_p \le C_p \left\|u\right\|_p </math>

for all Template:Nowrap<ref>This theorem is due to Template:Harvnb; see also Template:Harvnb.</ref>

The best constant <math>C_p</math> is given by<ref>This result is due to Template:Harvnb; see also Template:Harvnb.</ref> <math display="block">C_p = \begin{cases}

 \tan \frac{\pi}{2p} & \text{if} ~ 1 < p \leq 2 \\[4pt] 
 \cot \frac{\pi}{2p} & \text{if} ~ 2 < p < \infty

\end{cases}</math>

An easy way to find the best <math>C_p</math> for <math>p</math> being a power of 2 is through the so-called Cotlar's identity that <math> (\operatorname{H}f)^2 =f^2 +2\operatorname{H}(f\operatorname{H}f)</math> for all real valued Template:Mvar. The same best constants hold for the periodic Hilbert transform.

The boundedness of the Hilbert transform implies the <math>L^p(\mathbb{R})</math> convergence of the symmetric partial sum operator <math display="block">S_R f = \int_{-R}^R \hat{f}(\xi) e^{2\pi i x\xi} \, \mathrm{d}\xi </math>

to Template:Mvar in Template:Nowrap<ref>See for example Template:Harvnb.</ref>

Anti-self adjointnessEdit

The Hilbert transform is an anti-self adjoint operator relative to the duality pairing between <math>L^p(\mathbb{R})</math> and the dual space Template:Nowrap where Template:Mvar and Template:Mvar are Hölder conjugates and Template:Math. Symbolically,

<math display="block">\langle \operatorname{H} u, v \rangle = \langle u, -\operatorname{H} v \rangle</math>

for <math>u \isin L^p(\mathbb{R})</math> and Template:Nowrap Template:Sfn

Inverse transformEdit

The Hilbert transform is an anti-involution,Template:Sfn meaning that

<math display="block">\operatorname{H}\bigl(\operatorname{H}\left(u\right)\bigr) = -u</math>

provided each transform is well-defined. Since Template:Math preserves the space Template:Nowrap this implies in particular that the Hilbert transform is invertible on Template:Nowrap and that

<math display="block">\operatorname{H}^{-1} = -\operatorname{H}</math>

Complex structureEdit

Because Template:Math ("Template:Math" is the identity operator) on the real Banach space of real-valued functions in Template:Nowrap the Hilbert transform defines a linear complex structure on this Banach space. In particular, when Template:Math, the Hilbert transform gives the Hilbert space of real-valued functions in <math>L^2(\mathbb{R})</math> 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 [[H square|Template:Math]] by the Paley–Wiener theorem.

DifferentiationEdit

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

<math display="block">\operatorname{H}\left(\frac{ \mathrm{d}u}{\mathrm{d}t}\right) = \frac{\mathrm d}{\mathrm{d}t}\operatorname{H}(u)</math>

Iterating this identity,

<math display="block">\operatorname{H}\left(\frac{\mathrm{d}^ku}{\mathrm{d}t^k}\right) = \frac{\mathrm{d}^k}{\mathrm{d}t^k}\operatorname{H}(u)</math>

This is rigorously true as stated provided Template:Mvar and its first Template:Mvar derivatives belong to Template:Nowrap Template:Sfn One can check this easily in the frequency domain, where differentiation becomes multiplication by Template:Mvar.

ConvolutionsEdit

The Hilbert transform can formally be realized as a convolution with the tempered distribution Template:Sfn

<math display="block">h(t) = \operatorname{p.v.} \frac{1}{ \pi \, t }</math>

Thus formally,

<math display="block">\operatorname{H}(u) = h*u</math>

However, a priori this may only be defined for Template:Mvar 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 Template:Math. Alternatively, one may use the fact that h(t) is the distributional derivative of the function Template:Math; to wit

<math display="block">\operatorname{H}(u)(t) = \frac{\mathrm{d}}{\mathrm{d}t}\left(\frac{1}{\pi} \left(u*\log\bigl|\cdot\bigr|\right)(t)\right)</math>

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:

<math display="block">\operatorname{H}(u*v) = \operatorname{H}(u)*v = u*\operatorname{H}(v)</math>

This is rigorously true if Template:Mvar and Template:Mvar are compactly supported distributions since, in that case,

By passing to an appropriate limit, it is thus also true if Template:Math and Template:Math provided that

from a theorem due to Titchmarsh.Template:Sfn

InvarianceEdit

The Hilbert transform has the following invariance properties on <math>L^2(\mathbb{R})</math>.

It commutes with translations. That is, it commutes with the operators Template:Math for all Template:Mvar in <math>\mathbb{R}.</math>
It commutes with positive dilations. That is it commutes with the operators Template:Math for all Template:Math.
It anticommutes with the reflection Template:Math.

Up to a multiplicative constant, the Hilbert transform is the only bounded operator on Template:Mvar² with these properties.Template:Sfn

In fact there is a wider set of operators that commute with the Hilbert transform. The group <math>\text{SL}(2,\mathbb{R})</math> acts by unitary operators Template:Math on the space <math>L^2(\mathbb{R})</math> by the formula

<math display="block">\operatorname{U}_{g}^{-1} f(x) = \frac{1}{ c x + d } \, f \left( \frac{ ax + b }{ cx + d } \right) \,,\qquad g = \begin{bmatrix} a & b \\ c & d \end{bmatrix} ~,\qquad \text{ for }~ a d - b c = \pm 1 . </math>

This unitary representation is an example of a principal series representation of <math>~\text{SL}(2,\mathbb{R})~.</math> In this case it is reducible, splitting as the orthogonal sum of two invariant subspaces, Hardy space <math>H^2(\mathbb{R})</math> and its conjugate. These are the spaces of Template:Math boundary values of holomorphic functions on the upper and lower halfplanes. <math>H^2(\mathbb{R})</math> and its conjugate consist of exactly those Template:Math functions with Fourier transforms vanishing on the negative and positive parts of the real axis respectively. Since the Hilbert transform is equal to Template:Math, with Template:Mvar being the orthogonal projection from <math>L^2(\mathbb{R})</math> onto <math>\operatorname{H}^2(\mathbb{R}),</math> and Template:Math the identity operator, it follows that <math>\operatorname{H}^2(\mathbb{R})</math> and its orthogonal complement are eigenspaces of Template:Math for the eigenvalues Template:Math. In other words, Template:Math commutes with the operators Template:Mvar. The restrictions of the operators Template:Mvar to <math>\operatorname{H}^2(\mathbb{R})</math> and its conjugate give irreducible representations of <math>\text{SL}(2,\mathbb{R})</math> – the so-called limit of discrete series representations.<ref>See Template:Harvnb, Template:Harvnb, and Template:Harvnb.</ref>

Extending the domain of definitionEdit

Hilbert transform of distributionsEdit

It is further possible to extend the Hilbert transform to certain spaces of distributions Template:Harv. Since the Hilbert transform commutes with differentiation, and is a bounded operator on Template:Mvar, Template:Mvar restricts to give a continuous transform on the inverse limit of Sobolev spaces:

<math display="block">\mathcal{D}_{L^p} = \underset{n \to \infty}{\underset{\longleftarrow}{\lim}} W^{n,p}(\mathbb{R})</math>

The Hilbert transform can then be defined on the dual space of <math>\mathcal{D}_{L^p}</math>, denoted <math>\mathcal{D}_{L^p}'</math>, consisting of Template:Mvar distributions. This is accomplished by the duality pairing:
For Template:Nowrap define:

<math display="block">\operatorname{H}(u)\in \mathcal{D}'_{L^p} = \langle \operatorname{H}u, v \rangle \ \triangleq \ \langle u, -\operatorname{H}v\rangle,\ \text{for all} \ v\in\mathcal{D}_{L^p} .</math>

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,Template:Sfn but considerably more care is needed because of the singularity in the integral.

Hilbert transform of bounded functionsEdit

The Hilbert transform can be defined for functions in <math>L^\infty (\mathbb{R})</math> as well, but it requires some modifications and caveats. Properly understood, the Hilbert transform maps <math>L^\infty (\mathbb{R})</math> 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 Template:Math, the integral defining Template:Math diverges almost everywhere to Template:Math. To alleviate such difficulties, the Hilbert transform of an Template:Math function is therefore defined by the following regularized form of the integral

<math display="block">\operatorname{H}(u)(t) = \operatorname{p.v.} \int_{-\infty}^\infty u(\tau)\left\{h(t - \tau)- h_0(-\tau)\right\} \, \mathrm{d}\tau</math>

where as above Template:Math and

<math display="block">h_0(x) = \begin{cases} 0 & \text{if} ~ |x| < 1 \\ \frac{1}{\pi \, x} & \text{if} ~ |x| \ge 1 \end{cases}</math>

The modified transform Template:Math agrees with the original transform up to an additive constant on functions of compact support from a general result by Calderón and Zygmund.<ref>Template:Harvnb; see Template:Harvnb.</ref> 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<ref>Template:Harvnb; Template:Harvnb</ref> is that a function is of bounded mean oscillation if and only if it has the form Template:Nowrap for some Template:Nowrap

Conjugate functionsEdit

The Hilbert transform can be understood in terms of a pair of functions Template:Math and Template:Math such that the function <math display="block">F(x) = f(x) + i\,g(x)</math> is the boundary value of a holomorphic function Template:Math in the upper half-plane.Template:Sfn Under these circumstances, if Template:Mvar and Template:Mvar are sufficiently integrable, then one is the Hilbert transform of the other.

Suppose that <math>f \isin L^p(\mathbb{R}).</math> Then, by the theory of the Poisson integral, Template:Mvar admits a unique harmonic extension into the upper half-plane, and this extension is given by

<math display="block">u(x + iy) = u(x, y) = \frac{1}{\pi} \int_{-\infty}^\infty f(s)\;\frac{y}{(x - s)^2 + y^2} \; \mathrm{d}s</math>

which is the convolution of Template:Mvar with the Poisson kernel

<math display="block">P(x, y) = \frac{ y }{ \pi\, \left( x^2 + y^2 \right) }</math>

Furthermore, there is a unique harmonic function Template:Mvar defined in the upper half-plane such that Template:Math is holomorphic and <math display="block">\lim_{y \to \infty} v\,(x + i\,y) = 0</math>

This harmonic function is obtained from Template:Mvar by taking a convolution with the conjugate Poisson kernel

<math display="block">Q(x, y) = \frac{ x }{ \pi\, \left(x^2 + y^2\right) } .</math>

Thus <math display="block">v(x, y) = \frac{1}{\pi}\int_{-\infty}^\infty f(s)\;\frac{x - s}{\,(x - s)^2 + y^2\,}\;\mathrm{d}s .</math>

Indeed, the real and imaginary parts of the Cauchy kernel are <math display="block">\frac{i}{\pi\,z} = P(x, y) + i\,Q(x, y)</math>

so that Template:Math is holomorphic by Cauchy's integral formula.

The function Template:Mvar obtained from Template:Mvar in this way is called the harmonic conjugate of Template:Mvar. The (non-tangential) boundary limit of Template:Math as Template:Math is the Hilbert transform of Template:Mvar. Thus, succinctly, <math display="block">\operatorname{H}(f) = \lim_{y \to 0} Q(-, y) \star f</math>

Titchmarsh's theoremEdit

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.Template:Sfn It gives necessary and sufficient conditions for a complex-valued square-integrable function Template:Math on the real line to be the boundary value of a function in the Hardy space Template:Math of holomorphic functions in the upper half-plane Template:Mvar.

The theorem states that the following conditions for a complex-valued square-integrable function <math>F : \mathbb{R} \to \mathbb{C}</math> are equivalent:

Template:Math is the limit as Template:Math of a holomorphic function Template:Math in the upper half-plane such that <math display="block"> \int_{-\infty}^\infty |F(x + i\,y)|^2\;\mathrm{d}x < K </math>
The real and imaginary parts of Template:Math are Hilbert transforms of each other.
The Fourier transform <math>\mathcal{F}(F)(x)</math> vanishes for Template:Math.

A weaker result is true for functions of class Template:Mvar for Template:Math.Template:Sfn Specifically, if Template:Math is a holomorphic function such that

<math display="block">\int_{-\infty}^\infty |F(x + i\,y)|^p\;\mathrm{d}x < K </math>

for all Template:Mvar, then there is a complex-valued function Template:Math in <math>L^p(\mathbb{R})</math> such that Template:Math in the Template:Mvar norm as Template:Math (as well as holding pointwise almost everywhere). Furthermore,

where Template:Mvar is a real-valued function in <math>L^p(\mathbb{R})</math> and Template:Mvar is the Hilbert transform (of class Template:Mvar) of Template:Mvar.

This is not true in the case Template:Math. In fact, the Hilbert transform of an Template:Math function Template:Mvar need not converge in the mean to another Template:Math function. Nevertheless,Template:Sfn the Hilbert transform of Template:Mvar does converge almost everywhere to a finite function Template:Mvar such that

<math display="block">\int_{-\infty}^\infty \frac{ |g(x)|^p }{ 1 + x^2 } \; \mathrm{d}x < \infty</math>

This result is directly analogous to one by Andrey Kolmogorov for Hardy functions in the disc.Template:Sfn 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<ref>see Template:Harvnb.</ref>

Riemann–Hilbert problemEdit

One form of the Riemann–Hilbert problem seeks to identify pairs of functions Template:Math and Template:Math such that Template:Math is holomorphic on the upper half-plane and Template:Math is holomorphic on the lower half-plane, such that for Template:Mvar along the real axis, <math display="block">F_{+}(x) - F_{-}(x) = f(x)</math>

where Template:Math is some given real-valued function of Template:Nowrap The left-hand side of this equation may be understood either as the difference of the limits of Template:Math 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 Template:Math solve the Riemann–Hilbert problem <math display="block">f(x) = F_{+}(x) - F_{-}(x)</math>

then the Hilbert transform of Template:Math is given byTemplate:Sfn <math display="block">H(f)(x) = -i \bigl( F_{+}(x) + F_{-}(x) \bigr) .</math>

Hilbert transform on the circleEdit

Template:See also For a periodic function Template:Mvar the circular Hilbert transform is defined:

<math display="block">\tilde f(x) \triangleq \frac{1}{ 2\pi } \operatorname{p.v.} \int_0^{2\pi} f(t)\,\cot\left(\frac{ x - t }{2}\right)\,\mathrm{d}t</math>

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, <math display="block">\cot\left(\frac{ x - t }{2}\right)</math> is known as the Hilbert kernel since it was in this form the Hilbert transform was originally studied.Template:Sfn

The Hilbert kernel (for the circular Hilbert transform) can be obtained by making the Cauchy kernel Template:Frac periodic. More precisely, for Template:Math

<math display="block">\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)</math>

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 Template:Math, which carries the real line onto the circle and the upper half plane onto the unit disk. It induces a unitary map

<math display="block"> U\,f(x) = \frac{1}{(x + i)\,\sqrt{\pi}} \, f\left(C\left(x\right)\right) </math>

of Template:Math onto <math>L^2 (\mathbb{R}).</math> The operator Template:Mvar carries the Hardy space Template:Math onto the Hardy space <math>H^2(\mathbb{R})</math>.Template:Sfn

Hilbert transform in signal processingEdit

Bedrosian's theoremEdit

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

<math display="block">\operatorname{H}\left(f_\text{LP}(t)\cdot f_\text{HP}(t)\right) = f_\text{LP}(t)\cdot \operatorname{H}\left(f_\text{HP}(t)\right),</math>

where Template:Math and Template:Math are the low- and high-pass signals respectively.Template:Sfn 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":

<math display="block">u(t) = u_m(t) \cdot \cos(\omega t + \varphi),</math>

where Template:Math is the narrow bandwidth "message" waveform, such as voice or music. Then by Bedrosian's theorem:Template:Sfn

<math display="block">\operatorname{H}(u)(t) = \begin{cases} +u_m(t) \cdot \sin(\omega t + \varphi) & \text{if } \omega > 0 \\ -u_m(t) \cdot \sin(\omega t + \varphi) & \text{if } \omega < 0 \end{cases}</math>

Analytic representationEdit

Template:Main article A specific type of conjugate function is:

<math display="block">u_a(t) \triangleq u(t) + i\cdot H(u)(t),</math>

known as the analytic representation of <math>u(t).</math> The name reflects its mathematical tractability, due largely to Euler's formula. Applying Bedrosian's theorem to the narrowband model, the analytic representation is:<ref>Template:Harvnb</ref>

Template:Equation box 1

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

Template:Anchor Angle (phase/frequency) modulationEdit

The form:<ref>Template:Harvnb</ref>

<math display="block">u(t) = A \cdot \cos(\omega t + \varphi_m(t))</math>

is called angle modulation, which includes both phase modulation and frequency modulation. The instantaneous frequency is <math>\omega + \varphi_m^\prime(t).</math> For sufficiently large Template:Mvar, compared to Template:Nowrap

<math display="block">\operatorname{H}(u)(t) \approx A \cdot \sin(\omega t + \varphi_m(t))</math> and: <math display="block">u_a(t) \approx A \cdot e^{i(\omega t + \varphi_m(t))}.</math>

Single sideband modulation (SSB)Edit

Template:Main article When Template:Math in Template:EquationNote is also an analytic representation (of a message waveform), that is:

<math display="block">u_m(t) = m(t) + i \cdot \widehat{m}(t)</math>

the result is single-sideband modulation:

<math display="block">u_a(t) = (m(t) + i \cdot \widehat{m}(t)) \cdot e^{i(\omega t + \varphi)}</math>

whose transmitted component is:<ref>Template:Harvnb</ref><ref>Template:Harvnb</ref>

<math display="block">\begin{align}

 u(t) &= \operatorname{Re}\{u_a(t)\}\\
      &= m(t)\cdot \cos(\omega t + \varphi) - \widehat{m}(t)\cdot \sin(\omega t + \varphi)

\end{align}</math>

CausalityEdit

The function <math>h(t) = 1/(\pi t)</math> presents two causality-based challenges to practical implementation in a convolution (in addition to its undefined value at 0):

Its duration is infinite (technically infinite support). Finite-length windowing reduces the effective frequency range of the transform; shorter windows result in greater losses at low and high frequencies. See also quadrature filter.
It is a non-causal filter. So a delayed version, <math>h(t-\tau),</math> is required. The corresponding output is subsequently delayed by <math>\tau.</math> When creating the imaginary part of an analytic signal, the source (real part) must also be delayed by <math>\tau</math>.

Discrete Hilbert transformEdit

File:Bandpass discrete Hilbert transform filter.tif

Figure 1: Filter whose frequency response is bandlimited to about 95% of the Nyquist frequency

File:Highpass discrete Hilbert transform filter.tif

Figure 2: Hilbert transform filter with a highpass frequency response

File:DFT approximation to Hilbert filter.png

Figure 3.

File:Effect of circular convolution on discrete Hilbert transform.png

Figure 4. The Hilbert transform of Template:Math is Template:Math. This figure shows Template:Math and two approximate Hilbert transforms computed by the MATLAB library function, Template:Mono

File:Discrete Hilbert transforms of a cosine function, using piecewise convolution.svg

Figure 5. Discrete Hilbert transforms of a cosine function, using piecewise convolution

For a discrete function, <math>u[n],</math> with discrete-time Fourier transform (DTFT), <math>U(\omega)</math>, and discrete Hilbert transform <math>\widehat u[n],</math> the DTFT of <math>\widehat u[n]</math> in the region Template:Math is given by:

<math>\operatorname{DTFT} (\widehat u) = U(\omega)\cdot (-i\cdot \sgn(\omega)).</math>

The inverse DTFT, using the convolution theorem, is:<ref>Template:Harvnb</ref><ref>Template:Harvnb</ref>

<math>

\begin{align} \widehat u[n] &= {\scriptstyle \mathrm{DTFT}^{-1}} (U(\omega))\ *\ {\scriptstyle \mathrm{DTFT}^{-1}} (-i\cdot \sgn(\omega))\\ &= u[n]\ *\ \frac{1}{2 \pi}\int_{-\pi}^{\pi} (-i\cdot \sgn(\omega))\cdot e^{i \omega n} \,\mathrm{d}\omega\\ &= u[n]\ *\ \underbrace{\frac{1}{2 \pi}\left[\int_{-\pi}^0 i\cdot e^{i \omega n} \,\mathrm{d}\omega - \int_0^\pi i\cdot e^{i \omega n} \,\mathrm{d}\omega \right]}_{h[n]}, \end{align} </math>

where

<math>h[n]\ \triangleq \

\begin{cases}

            0, & \text{if }n\text{ even}\\

\frac 2 {\pi n} & \text{if }n\text{ odd} \end{cases}</math>

which is an infinite impulse response (IIR).

Practical considerations<ref>Template:Harvnb</ref>

Method 1: Direct convolution of streaming <math>u[n]</math> data with an FIR approximation of <math>h[n],</math> which we will designate by <math>\tilde h[n].</math> Examples of truncated <math>h[n]</math> are shown in figures 1 and 2. Fig 1 has an odd number of anti-symmetric coefficients and is called Type III.<ref>Template:Harvnb</ref> This type inherently exhibits responses of zero magnitude at frequencies 0 and Nyquist, resulting in a bandpass filter shape.<ref>Template:Harvnb</ref><ref>Template:Harvnb</ref> A Type IV design (even number of anti-symmetric coefficients) is shown in Fig 2.<ref>Template:Harvnb</ref><ref>Template:Harvnb</ref> It has a highpass frequency response.<ref>Template:Harvnb</ref> Type III is the usual choice.<ref>Template:Harvnb</ref><ref>Template:Harvnb</ref> for these reasons:

A typical (i.e. properly filtered and sampled) <math>u[n]</math> sequence has no useful components at the Nyquist frequency.
The Type IV impulse response requires a <math>\tfrac{1}{2}</math> sample shift in the <math>h[n]</math> 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 <math>\widehat u[n]</math> with <math>u[n]</math> to create an analytic signal. The group delay of Type IV is halfway between two samples.

The abrupt truncation of <math>h[n]</math> creates a rippling (Gibbs effect) of the flat frequency response. That can be mitigated by use of a window function to taper <math>\tilde h[n]</math> to zero.<ref>Template:Harvnb</ref>

Method 2: Piecewise convolution. It is well known that direct convolution is computationally much more intensive than methods like overlap-save that give access to the efficiencies of the Fast Fourier transform via the convolution theorem.<ref>Template:Harvnb</ref> Specifically, the discrete Fourier transform (DFT) of a segment of <math>u[n]</math> is multiplied pointwise with a DFT of the <math>\tilde h[n]</math> 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 <math>N</math> (an arbitrary parameter) are convolved with the periodic function:

<math>\tilde{h}_N[n]\ \triangleq \sum_{m=-\infty}^\infty \tilde{h}[n - mN].</math>

When the duration of non-zero values of <math>\tilde{h}[n]</math> is <math>M < N,</math> the output sequence includes <math>N-M+1</math> samples of <math>\widehat u.</math> <math>M-1</math> outputs are discarded from each block of <math>N,</math> and the input blocks are overlapped by that amount to prevent gaps.

Method 3: Same as method 2, except the DFT of <math>\tilde{h}[n]</math> is replaced by samples of the <math>-i \operatorname{sgn}(\omega)</math> distribution (whose real and imaginary components are all just <math>0</math> or <math>\pm 1.</math>) That convolves <math>u[n]</math> with a periodic summation:Template:Efn-ua

<math>h_N[n]\ \triangleq \sum_{m=-\infty}^\infty h[n - mN],</math>Template:Spaces Template:Efn-ua Template:Efn-ua

for some arbitrary parameter, <math>N.</math> <math>h[n]</math> 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 <math>h[n]</math> 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 <math>h_{512}[n],</math> corresponding to method 3. It is the inverse DFT of the <math>-i \operatorname{sgn}(\omega)</math> distribution. Specifically, it is the function that is convolved with a segment of <math>u[n]</math> by the MATLAB function, hilbert(u,512).<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> The real part of the output sequence is the original input sequence, so that the complex output is an analytic representation of <math>u[n].</math>

When the input is a segment of a pure cosine, the resulting convolution for two different values of <math>N</math> is depicted in Fig 4 (red and blue plots). Edge effects prevent the result from being a pure sine function (green plot). Since <math>h_N[n]</math> 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 <math>N</math> 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 <math>h[n]</math> 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 <math>h[n]</math> and <math>h_N[n]</math> (green and red in Fig 3). The fact that <math>h_N[n]</math> is tapered (windowed) is actually helpful in this context. The real problem is that it's not windowed enough. Effectively, <math>M=N,</math> whereas the overlap-save method needs <math>M < N.</math>

Number-theoretic Hilbert transformEdit

The number theoretic Hilbert transform is an extensionTemplate:Sfn 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.Template:Sfn

NotesEdit

Template:Notelist-ua

Page citationsEdit

Template:Reflist

ReferencesEdit

Template:Sfn whitelist Template:Refbegin

|CitationClass=web }}

{{#invoke:citation/CS1|citation

|CitationClass=web }}; also http://www.fuchs-braun.com/media/d9140c7b3d5004fbffff8007fffffff0.pdf Template:Webarchive

|CitationClass=web }}; also https://www.dsprelated.com/freebooks/mdft/Analytic_Signals_Hilbert_Transform.html

Template:Refend

External linksEdit

Template:Sister project

Derivation of the boundedness of the Hilbert transform
Mathworld Hilbert transform — Contains a table of transforms
{{#invoke:Template wrapper|{{#if:|list|wrap}}|_template=cite web

|_exclude=urlname, _debug, id |url = https://mathworld.wolfram.com/{{#if:TitchmarshTheorem%7CTitchmarshTheorem.html}} |title = Titchmarsh theorem |author = Weisstein, Eric W. |website = MathWorld |access-date = |ref = Template:SfnRef }}

{{#invoke:citation/CS1|citation

|CitationClass=web }} an entry level introduction to Hilbert transformation.

Hilbert transform

Contents

DefinitionEdit

NotationEdit

HistoryEdit

Relationship with the Fourier transformEdit

Table of selected Hilbert transformsEdit

Domain of definitionEdit

PropertiesEdit

BoundednessEdit

Anti-self adjointnessEdit

Inverse transformEdit

Complex structureEdit

DifferentiationEdit

ConvolutionsEdit

InvarianceEdit

Extending the domain of definitionEdit

Hilbert transform of distributionsEdit

Hilbert transform of bounded functionsEdit

Conjugate functionsEdit

Titchmarsh's theoremEdit

Riemann–Hilbert problemEdit

Hilbert transform on the circleEdit

Hilbert transform in signal processingEdit

Bedrosian's theoremEdit

Analytic representationEdit

Template:Anchor Angle (phase/frequency) modulationEdit

Single sideband modulation (SSB)Edit

CausalityEdit

Discrete Hilbert transformEdit

Number-theoretic Hilbert transformEdit

See alsoEdit

NotesEdit

Page citationsEdit

ReferencesEdit

Further readingEdit

External linksEdit