Hilbert transform

In mathematics and signal processing, the Hilbert transform is a specific singular integral that takes a function, of a real variable and produces another function of a real variable . The Hilbert transform is given by the Cauchy principal value of the convolution with the function <math>1/(\pi t)</math> (see ). 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 ). The Hilbert transform is important in signal processing, where it is a component of the analytic representation of a real-valued signal . 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.

Definition

The Hilbert transform of can be thought of as the convolution of with the function , known as the Cauchy kernel. Because 1/ is not integrable across , the integral defining the convolution does not always converge. Instead, the Hilbert transform is defined using the Cauchy principal value (denoted here by ). Explicitly, the Hilbert transform of a function (or signal) 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 with the tempered distribution . Alternatively, by changing variables, the principal-value integral can be written explicitly 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 , 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 (see 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 is analytic in the upper half complex plane , and , then up to an additive constant, provided this Hilbert transform exists.

Notation

In signal processing the Hilbert transform of is commonly denoted by <math>\hat{u}(t)</math>. However, in mathematics, this notation is already extensively used to denote the Fourier transform of . 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.

History

The Hilbert transform arose in Hilbert's 1905 work on a problem Riemann posed concerning analytic functions, 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. 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. Schur improved Hilbert's results about the discrete Hilbert transform and extended them to the integral case. These results were restricted to the spaces and . In 1928, Marcel Riesz proved that the Hilbert transform can be defined for u in <math>L^p(\mathbb{R})</math> (Lp space) for , that the Hilbert transform is a bounded operator on <math>L^p(\mathbb{R})</math> for , and that similar results hold for the Hilbert transform on the circle as well as the discrete Hilbert transform. The Hilbert transform was a motivating example for Antoni Zygmund and Alberto Calderón during their study of singular integrals. 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. The multiplier of is , where 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 , 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, has the effect of shifting the phase of the negative frequency components of by +90° ( radians) and the phase of the positive frequency components by −90°, and 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 are respectively shifted by +180° and −180°, which are equivalent amounts. The signal is negated; i.e., , 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 transforms

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

{| class="wikitable"

! Signal <math>u(t)</math>

! Hilbert transform <math>\operatorname{H}(u)(t)</math>

| align="center"| <math>\sin(\omega t + \varphi)</math> || align="center" |

<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>

| align="center"| <math> \cos(\omega t + \varphi) </math>

The best constant <math>C_p</math> is given by

<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 . 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 in

Anti-self adjointness

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 where and are Hölder conjugates and . 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

Inverse transform

The Hilbert transform is an anti-involution, meaning that

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

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

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

Complex structure

Because ("" is the identity operator) on the real Banach space of real-valued functions in the Hilbert transform defines a linear complex structure on this Banach space. In particular, when , 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| by the Paley–Wiener theorem.

Differentiation

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 and its first derivatives belong to 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

<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 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 . Alternatively, one may use the fact that h(t) is the distributional derivative of the function ; 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 and are compactly supported distributions since, in that case,

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

from a theorem due to Titchmarsh.

Invariance

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 for all in <math>\mathbb{R}.</math>
It commutes with positive dilations. That is it commutes with the operators for all .
It anticommutes with the reflection .

Up to a multiplicative constant, the Hilbert transform is the only bounded operator on 2 with these properties.

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 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 boundary values of holomorphic functions on the upper and lower halfplanes. <math>H^2(\mathbb{R})</math> and its conjugate consist of exactly those functions with Fourier transforms vanishing on the negative and positive parts of the real axis respectively. Since the Hilbert transform is equal to , with being the orthogonal projection from <math>L^2(\mathbb{R})</math> onto <math>\operatorname{H}^2(\mathbb{R}),</math> and the identity operator, it follows that <math>\operatorname{H}^2(\mathbb{R})</math> and its orthogonal complement are eigenspaces of for the eigenvalues . In other words, commutes with the operators . The restrictions of the operators 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.

Extending the domain of definition

Hilbert transform of distributions

It is further possible to extend the Hilbert transform to certain spaces of distributions . Since the Hilbert transform commutes with differentiation, and is a bounded operator on , 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 distributions. This is accomplished by the duality pairing:

For 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, 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 <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 , the integral defining diverges almost everywhere to . To alleviate such difficulties, the Hilbert transform of an 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 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 agrees with the original transform up to an additive constant on functions of compact support from a general result by Calderón and Zygmund. 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 is that a function is of bounded mean oscillation if and only if it has the form for some

Conjugate functions

The Hilbert transform can be understood in terms of a pair of functions and such that the function

is the boundary value of a holomorphic function in the upper half-plane. Under these circumstances, if and 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, 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 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 defined in the upper half-plane such that is holomorphic and

<math display="block">\lim_{y \to \infty} v\,(x + i\,y) = 0</math>

This harmonic function is obtained from 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

so that is holomorphic by Cauchy's integral formula.

The function obtained from in this way is called the harmonic conjugate of . The (non-tangential) boundary limit of as is the Hilbert transform of . Thus, succinctly,

<math display="block">\operatorname{H}(f) = \lim_{y \to 0} Q(-, y) \star f</math>

Titchmarsh's theorem

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

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

is the limit as of a holomorphic function 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 are Hilbert transforms of each other.
The Fourier transform <math>\mathcal{F}(F)(x)</math> vanishes for .

A weaker result is true for functions of class for . Specifically, if is a holomorphic function such that

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

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

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

This is not true in the case . In fact, the Hilbert transform of an function need not converge in the mean to another function. Nevertheless, the Hilbert transform of does converge almost everywhere to a finite function 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. 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

Riemann–Hilbert problem

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

where is some given real-valued function of The left-hand side of this equation may be understood either as the difference of the limits of 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 solve the Riemann–Hilbert problem

then the Hilbert transform of is given by

Hilbert transform on the circle

For a periodic function 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.

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

<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 , 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 onto <math>L^2 (\mathbb{R}).</math> The operator carries the Hardy space onto the Hardy space <math>H^2(\mathbb{R})</math>.

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

<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 and are the low- and high-pass signals respectively. 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 is the narrow bandwidth "message" waveform, such as voice or music. Then by Bedrosian's theorem:

<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 representation

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:

A Fourier transform property indicates that this complex heterodyne operation can shift all the negative frequency components of above 0 Hz. In that case, the imaginary part of the result is a Hilbert transform of the real part. This is an indirect way to produce Hilbert transforms.

Angle (phase/frequency) modulation

The form:

<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 , compared to

<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)

When in  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:

<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>

Causality

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 transform

thumb|400px|right|Figure 1: Filter whose frequency response is bandlimited to about 95% of the Nyquist frequency

thumb|400px|right|Figure 2: Hilbert transform filter with a highpass frequency response

thumb|400px|right|Figure 3.

thumb|400px|right|Figure 4. The Hilbert transform of is . This figure shows and two approximate Hilbert transforms computed by the MATLAB library function,

thumb|400px|right|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 is given by:

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

The inverse DTFT, using the convolution theorem, is:

:<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

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. This type inherently exhibits responses of zero magnitude at frequencies 0 and Nyquist, resulting in a bandpass filter shape. A Type IV design (even number of anti-symmetric coefficients) is shown in Fig 2. It has a highpass frequency response. Type III is the usual choice. 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.

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. 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:

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

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). 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 transform

The number theoretic Hilbert transform is an extension 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.

Notes

Page citations

References

; also http://www.fuchs-braun.com/media/d9140c7b3d5004fbffff8007fffffff0.pdf
; also https://www.dsprelated.com/freebooks/mdft/Analytic_Signals_Hilbert_Transform.html

External links

Derivation of the boundedness of the Hilbert transform
Mathworld Hilbert transform — Contains a table of transforms
an entry level introduction to Hilbert transformation.

Definition

Notation

History

Relationship with the Fourier transform

Table of selected Hilbert transforms

Anti-self adjointness

Inverse transform

Complex structure

Differentiation

Convolutions

Invariance

Extending the domain of definition

Hilbert transform of distributions

Hilbert transform of bounded functions

Conjugate functions

Titchmarsh's theorem

Riemann–Hilbert problem

Hilbert transform on the circle

Hilbert transform in signal processing

Bedrosian's theorem

Analytic representation

Angle (phase/frequency) modulation

Single sideband modulation (SSB)

Causality

Discrete Hilbert transform

Number-theoretic Hilbert transform

See also

Notes

Page citations

References

Further reading

External links