In mathematics and signal processing, the Hilbert transform is a specific singular integral that takes a function, u(t) of a real variable and produces another function of a real variable H(u)(t). The Hilbert transform is given by the Cauchy principal value of the convolution with the function (see § Definition). The Hilbert transform has a particularly simple representation in the frequency domain: It imparts a phase shift of ±90° (π/2 radians) to every frequency component of a function, the sign of the shift depending on the sign of the frequency (see § Relationship with the Fourier transform). The Hilbert transform is important in signal processing, where it is a component of the analytic representation of a real-valued signal u(t). The Hilbert transform was first introduced by David Hilbert in this setting, to solve a special case of the Riemann–Hilbert problem for analytic functions.
The Hilbert transform of u can be thought of as the convolution of u(t) with the function h(t) = 1/πt, known as the Cauchy kernel. Because 1/t is not integrable across t = 0, the integral defining the convolution does not always converge. Instead, the Hilbert transform is defined using the Cauchy principal value (denoted here by p.v.). Explicitly, the Hilbert transform of a function (or signal) u(t) is given by
provided this integral exists as a principal value. This is precisely the convolution of u with the tempered distribution p.v. 1/πt. [1] Alternatively, by changing variables, the principal-value integral can be written explicitly [2] as
When the Hilbert transform is applied twice in succession to a function u, the result is
provided the integrals defining both iterations converge in a suitable sense. In particular, the inverse transform is . This fact can most easily be seen by considering the effect of the Hilbert transform on the Fourier transform of u(t) (see § Relationship with the Fourier transform below).
For an analytic function in the upper half-plane, the Hilbert transform describes the relationship between the real part and the imaginary part of the boundary values. That is, if f(z) is analytic in the upper half complex plane {z : Im{z} > 0}, and u(t) = Re{f (t + 0·i)}, then Im{f(t + 0·i)} = H(u)(t) up to an additive constant, provided this Hilbert transform exists.
In signal processing the Hilbert transform of u(t) is commonly denoted by . [3] However, in mathematics, this notation is already extensively used to denote the Fourier transform of u(t). [4] Occasionally, the Hilbert transform may be denoted by . Furthermore, many sources define the Hilbert transform as the negative of the one defined here. [5]
The Hilbert transform arose in Hilbert's 1905 work on a problem Riemann posed concerning analytic functions, [6] [7] which has come to be known as the Riemann–Hilbert problem. Hilbert's work was mainly concerned with the Hilbert transform for functions defined on the circle. [8] [9] Some of his earlier work related to the Discrete Hilbert Transform dates back to lectures he gave in Göttingen. The results were later published by Hermann Weyl in his dissertation. [10] Schur improved Hilbert's results about the discrete Hilbert transform and extended them to the integral case. [11] These results were restricted to the spaces L2 and ℓ2. In 1928, Marcel Riesz proved that the Hilbert transform can be defined for u in (Lp space) for 1 < p < ∞, that the Hilbert transform is a bounded operator on for 1 < p < ∞, and that similar results hold for the Hilbert transform on the circle as well as the discrete Hilbert transform. [12] The Hilbert transform was a motivating example for Antoni Zygmund and Alberto Calderón during their study of singular integrals. [13] Their investigations have played a fundamental role in modern harmonic analysis. Various generalizations of the Hilbert transform, such as the bilinear and trilinear Hilbert transforms are still active areas of research today.
The Hilbert transform is a multiplier operator. [14] The multiplier of H is σH(ω) = −i sgn(ω), where sgn is the signum function. Therefore:
where denotes the Fourier transform. Since sgn(x) = sgn(2πx), it follows that this result applies to the three common definitions of .
By Euler's formula,
Therefore, H(u)(t) has the effect of shifting the phase of the negative frequency components of u(t) by +90° (π⁄2 radians) and the phase of the positive frequency components by −90°, and i·H(u)(t) has the effect of restoring the positive frequency components while shifting the negative frequency ones an additional +90°, resulting in their negation (i.e., a multiplication by −1).
When the Hilbert transform is applied twice, the phase of the negative and positive frequency components of u(t) are respectively shifted by +180° and −180°, which are equivalent amounts. The signal is negated; i.e., H(H(u)) = −u, because
In the following table, the frequency parameter is real.
Signal | Hilbert transform [fn 1] |
---|---|
[fn 2] | |
[fn 2] | |
(see Dawson function) | |
Sinc function | |
Dirac delta function | |
Characteristic function |
Notes
An extensive table of Hilbert transforms is available. [15] Note that the Hilbert transform of a constant is zero.
It is by no means obvious that the Hilbert transform is well-defined at all, as the improper integral defining it must converge in a suitable sense. However, the Hilbert transform is well-defined for a broad class of functions, namely those in for 1 < p < ∞.
More precisely, if u is in for 1 < p < ∞, then the limit defining the improper integral
exists for almost every t. The limit function is also in and is in fact the limit in the mean of the improper integral as well. That is,
as ε → 0 in the Lp norm, as well as pointwise almost everywhere, by the Titchmarsh theorem. [16]
In the case p = 1, the Hilbert transform still converges pointwise almost everywhere, but may itself fail to be integrable, even locally. [17] In particular, convergence in the mean does not in general happen in this case. The Hilbert transform of an L1 function does converge, however, in L1-weak, and the Hilbert transform is a bounded operator from L1 to L1,w. [18] (In particular, since the Hilbert transform is also a multiplier operator on L2, Marcinkiewicz interpolation and a duality argument furnishes an alternative proof that H is bounded on Lp.)
If 1 < p < ∞, then the Hilbert transform on is a bounded linear operator, meaning that there exists a constant Cp such that
for all . [19]
The best constant is given by [20]
An easy way to find the best for being a power of 2 is through the so-called Cotlar's identity that for all real valued f. The same best constants hold for the periodic Hilbert transform.
The boundedness of the Hilbert transform implies the convergence of the symmetric partial sum operator
to f in . [21]
The Hilbert transform is an anti-self adjoint operator relative to the duality pairing between and the dual space , where p and q are Hölder conjugates and 1 < p, q < ∞. Symbolically,
for and . [22]
The Hilbert transform is an anti-involution, [23] meaning that
provided each transform is well-defined. Since H preserves the space , this implies in particular that the Hilbert transform is invertible on , and that
Because H2 = −I ("I" is the identity operator) on the real Banach space of real-valued functions in , the Hilbert transform defines a linear complex structure on this Banach space. In particular, when p = 2, the Hilbert transform gives the Hilbert space of real-valued functions in the structure of a complex Hilbert space.
The (complex) eigenstates of the Hilbert transform admit representations as holomorphic functions in the upper and lower half-planes in the Hardy space H2 by the Paley–Wiener theorem.
Formally, the derivative of the Hilbert transform is the Hilbert transform of the derivative, i.e. these two linear operators commute:
Iterating this identity,
This is rigorously true as stated provided u and its first k derivatives belong to . [24] One can check this easily in the frequency domain, where differentiation becomes multiplication by ω.
The Hilbert transform can formally be realized as a convolution with the tempered distribution [25]
Thus formally,
However, a priori this may only be defined for u a distribution of compact support. It is possible to work somewhat rigorously with this since compactly supported functions (which are distributions a fortiori) are dense in Lp. Alternatively, one may use the fact that h(t) is the distributional derivative of the function log|t|/π; to wit
For most operational purposes the Hilbert transform can be treated as a convolution. For example, in a formal sense, the Hilbert transform of a convolution is the convolution of the Hilbert transform applied on only one of either of the factors:
This is rigorously true if u and v are compactly supported distributions since, in that case,
By passing to an appropriate limit, it is thus also true if u ∈ Lp and v ∈ Lq provided that
from a theorem due to Titchmarsh. [26]
The Hilbert transform has the following invariance properties on .
Up to a multiplicative constant, the Hilbert transform is the only bounded operator on L2 with these properties. [27]
In fact there is a wider set of operators that commute with the Hilbert transform. The group acts by unitary operators Ug on the space by the formula
This unitary representation is an example of a principal series representation of In this case it is reducible, splitting as the orthogonal sum of two invariant subspaces, Hardy space and its conjugate. These are the spaces of L2 boundary values of holomorphic functions on the upper and lower halfplanes. and its conjugate consist of exactly those L2 functions with Fourier transforms vanishing on the negative and positive parts of the real axis respectively. Since the Hilbert transform is equal to H = −i (2P − I), with P being the orthogonal projection from onto and I the identity operator, it follows that and its orthogonal complement are eigenspaces of H for the eigenvalues ±i. In other words, H commutes with the operators Ug. The restrictions of the operators Ug to and its conjugate give irreducible representations of – the so-called limit of discrete series representations. [28]
It is further possible to extend the Hilbert transform to certain spaces of distributions ( Pandey 1996 , Chapter 3). Since the Hilbert transform commutes with differentiation, and is a bounded operator on Lp, H restricts to give a continuous transform on the inverse limit of Sobolev spaces:
The Hilbert transform can then be defined on the dual space of , denoted , consisting of Lp distributions. This is accomplished by the duality pairing:
For , define:
It is possible to define the Hilbert transform on the space of tempered distributions as well by an approach due to Gel'fand and Shilov, [29] but considerably more care is needed because of the singularity in the integral.
The Hilbert transform can be defined for functions in as well, but it requires some modifications and caveats. Properly understood, the Hilbert transform maps to the Banach space of bounded mean oscillation (BMO) classes.
Interpreted naïvely, the Hilbert transform of a bounded function is clearly ill-defined. For instance, with u = sgn(x), the integral defining H(u) diverges almost everywhere to ±∞. To alleviate such difficulties, the Hilbert transform of an L∞ function is therefore defined by the following regularized form of the integral
where as above h(x) = 1/πx and
The modified transform H agrees with the original transform up to an additive constant on functions of compact support from a general result by Calderón and Zygmund. [30] Furthermore, the resulting integral converges pointwise almost everywhere, and with respect to the BMO norm, to a function of bounded mean oscillation.
A deep result of Fefferman's work [31] is that a function is of bounded mean oscillation if and only if it has the form f + H(g) for some .
The Hilbert transform can be understood in terms of a pair of functions f(x) and g(x) such that the function is the boundary value of a holomorphic function F(z) in the upper half-plane. [32] Under these circumstances, if f and g are sufficiently integrable, then one is the Hilbert transform of the other.
Suppose that Then, by the theory of the Poisson integral, f admits a unique harmonic extension into the upper half-plane, and this extension is given by
which is the convolution of f with the Poisson kernel
Furthermore, there is a unique harmonic function v defined in the upper half-plane such that F(z) = u(z) + i v(z) is holomorphic and
This harmonic function is obtained from f by taking a convolution with the conjugate Poisson kernel
Thus
Indeed, the real and imaginary parts of the Cauchy kernel are
so that F = u + i v is holomorphic by Cauchy's integral formula.
The function v obtained from u in this way is called the harmonic conjugate of u. The (non-tangential) boundary limit of v(x,y) as y → 0 is the Hilbert transform of f. Thus, succinctly,
Titchmarsh's theorem (named for E. C. Titchmarsh who included it in his 1937 work) makes precise the relationship between the boundary values of holomorphic functions in the upper half-plane and the Hilbert transform. [33] It gives necessary and sufficient conditions for a complex-valued square-integrable function F(x) on the real line to be the boundary value of a function in the Hardy space H2(U) of holomorphic functions in the upper half-plane U.
The theorem states that the following conditions for a complex-valued square-integrable function are equivalent:
A weaker result is true for functions of class Lp for p > 1. [34] Specifically, if F(z) is a holomorphic function such that
for all y, then there is a complex-valued function F(x) in such that F(x + i y) → F(x) in the Lp norm as y → 0 (as well as holding pointwise almost everywhere). Furthermore,
where f is a real-valued function in and g is the Hilbert transform (of class Lp) of f.
This is not true in the case p = 1. In fact, the Hilbert transform of an L1 function f need not converge in the mean to another L1 function. Nevertheless, [35] the Hilbert transform of f does converge almost everywhere to a finite function g such that
This result is directly analogous to one by Andrey Kolmogorov for Hardy functions in the disc. [36] Although usually called Titchmarsh's theorem, the result aggregates much work of others, including Hardy, Paley and Wiener (see Paley–Wiener theorem), as well as work by Riesz, Hille, and Tamarkin [37]
One form of the Riemann–Hilbert problem seeks to identify pairs of functions F+ and F− such that F+ is holomorphic on the upper half-plane and F− is holomorphic on the lower half-plane, such that for x along the real axis,
where f(x) is some given real-valued function of . The left-hand side of this equation may be understood either as the difference of the limits of F± from the appropriate half-planes, or as a hyperfunction distribution. Two functions of this form are a solution of the Riemann–Hilbert problem.
Formally, if F± solve the Riemann–Hilbert problem
then the Hilbert transform of f(x) is given by [38]
For a periodic function f the circular Hilbert transform is defined:
The circular Hilbert transform is used in giving a characterization of Hardy space and in the study of the conjugate function in Fourier series. The kernel, is known as the Hilbert kernel since it was in this form the Hilbert transform was originally studied. [8]
The Hilbert kernel (for the circular Hilbert transform) can be obtained by making the Cauchy kernel 1⁄x periodic. More precisely, for x ≠ 0
Many results about the circular Hilbert transform may be derived from the corresponding results for the Hilbert transform from this correspondence.
Another more direct connection is provided by the Cayley transform C(x) = (x – i) / (x + i), which carries the real line onto the circle and the upper half plane onto the unit disk. It induces a unitary map
of L2(T) onto The operator U carries the Hardy space H2(T) onto the Hardy space . [39]
Bedrosian's theorem states that the Hilbert transform of the product of a low-pass and a high-pass signal with non-overlapping spectra is given by the product of the low-pass signal and the Hilbert transform of the high-pass signal, or
where fLP and fHP are the low- and high-pass signals respectively. [40] A category of communication signals to which this applies is called the narrowband signal model. A member of that category is amplitude modulation of a high-frequency sinusoidal "carrier":
where um(t) is the narrow bandwidth "message" waveform, such as voice or music. Then by Bedrosian's theorem: [41]
A specific type of conjugate function is:
known as the analytic representation of The name reflects its mathematical tractability, due largely to Euler's formula. Applying Bedrosian's theorem to the narrowband model, the analytic representation is: [42]
(Eq.1) |
A Fourier transform property indicates that this complex heterodyne operation can shift all the negative frequency components of 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.
The form: [43]
is called angle modulation, which includes both phase modulation and frequency modulation. The instantaneous frequency is For sufficiently large ω, compared to :
and:
When um(t) in Eq.1 is also an analytic representation (of a message waveform), that is:
the result is single-sideband modulation:
whose transmitted component is: [44] [45]
The function presents two causality-based challenges to practical implementation in a convolution (in addition to its undefined value at 0):
For a discrete function, with discrete-time Fourier transform (DTFT), , and discrete Hilbert transform the DTFT of in the region −π < ω < π is given by:
The inverse DTFT, using the convolution theorem, is: [46] [47]
where
which is an infinite impulse response (IIR).
Practical considerations
Method 1: Direct convolution of streaming data with an FIR approximation of which we will designate by Examples of truncated are shown in figures 1 and 2. Fig 1 has an odd number of anti-symmetric coefficients and is called Type III. [48] This type inherently exhibits responses of zero magnitude at frequencies 0 and Nyquist, resulting in a bandpass filter shape. [49] [50] A Type IV design (even number of anti-symmetric coefficients) is shown in Fig 2. [51] [52] It has a highpass frequency response. [53] Type III is the usual choice. [54] [55] for these reasons:
The abrupt truncation of creates a rippling (Gibbs effect) of the flat frequency response. That can be mitigated by use of a window function to taper to zero. [56]
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. [57] Specifically, the discrete Fourier transform (DFT) of a segment of is multiplied pointwise with a DFT of the 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 (an arbitrary parameter) are convolved with the periodic function:
When the duration of non-zero values of is the output sequence includes samples of outputs are discarded from each block of and the input blocks are overlapped by that amount to prevent gaps.
Method 3: Same as method 2, except the DFT of is replaced by samples of the distribution (whose real and imaginary components are all just or ) That convolves with a periodic summation : [upper-alpha 1]
for some arbitrary parameter, 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 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 corresponding to method 3. It is the inverse DFT of the distribution. Specifically, it is the function that is convolved with a segment of by the MATLAB function, hilbert(u,512), [60] . The real part of the output sequence is the original input sequence, so that the complex output is an analytic representation of
When the input is a segment of a pure cosine, the resulting convolution for two different values of is depicted in Fig 4 (red and blue plots). Edge effects prevent the result from being a pure sine function (green plot). Since 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 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 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 and (green and red in Fig 3). The fact that is tapered (windowed) is actually helpful in this context. The real problem is that it's not windowed enough. Effectively, whereas the overlap-save method needs
The number theoretic Hilbert transform is an extension [61] 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. [62]
In mathematical analysis, the Dirac delta function, also known as the unit impulse, is a generalized function on the real numbers, whose value is zero everywhere except at zero, and whose integral over the entire real line is equal to one. Since there is no function having this property, modelling the delta "function" rigorously involves the use of limits or, as is common in mathematics, measure theory and the theory of distributions.
In physics, engineering and mathematics, the Fourier transform (FT) is an integral transform that takes a function as input and outputs another function that describes the extent to which various frequencies are present in the original function. The output of the transform is a complex-valued function of frequency. The term Fourier transform refers to both this complex-valued function and the mathematical operation. When a distinction needs to be made, the output of the operation is sometimes called the frequency domain representation of the original function. The Fourier transform is analogous to decomposing the sound of a musical chord into the intensities of its constituent pitches.
In vector calculus, the divergence theorem, also known as Gauss's theorem or Ostrogradsky's theorem, is a theorem relating the flux of a vector field through a closed surface to the divergence of the field in the volume enclosed.
In mathematical analysis, a function of bounded variation, also known as BV function, is a real-valued function whose total variation is bounded (finite): the graph of a function having this property is well behaved in a precise sense. For a continuous function of a single variable, being of bounded variation means that the distance along the direction of the y-axis, neglecting the contribution of motion along x-axis, traveled by a point moving along the graph has a finite value. For a continuous function of several variables, the meaning of the definition is the same, except for the fact that the continuous path to be considered cannot be the whole graph of the given function, but can be every intersection of the graph itself with a hyperplane parallel to a fixed x-axis and to the y-axis.
In mathematics, the Hartley transform (HT) is an integral transform closely related to the Fourier transform (FT), but which transforms real-valued functions to real-valued functions. It was proposed as an alternative to the Fourier transform by Ralph V. L. Hartley in 1942, and is one of many known Fourier-related transforms. Compared to the Fourier transform, the Hartley transform has the advantages of transforming real functions to real functions and of being its own inverse.
In functional analysis, a reproducing kernel Hilbert space (RKHS) is a Hilbert space of functions in which point evaluation is a continuous linear functional. Roughly speaking, this means that if two functions and in the RKHS are close in norm, i.e., is small, then and are also pointwise close, i.e., is small for all . The converse does not need to be true. Informally, this can be shown by looking at the supremum norm: the sequence of functions converges pointwise, but does not converge uniformly i.e. does not converge with respect to the supremum norm.
In mathematics, Parseval's theorem usually refers to the result that the Fourier transform is unitary; loosely, that the sum of the square of a function is equal to the sum of the square of its transform. It originates from a 1799 theorem about series by Marc-Antoine Parseval, which was later applied to the Fourier series. It is also known as Rayleigh's energy theorem, or Rayleigh's identity, after John William Strutt, Lord Rayleigh.
In functional analysis, a branch of mathematics, the Borel functional calculus is a functional calculus, which has particularly broad scope. Thus for instance if T is an operator, applying the squaring function s → s2 to T yields the operator T2. Using the functional calculus for larger classes of functions, we can for example define rigorously the "square root" of the (negative) Laplacian operator −Δ or the exponential
In mathematics and signal processing, an analytic signal is a complex-valued function that has no negative frequency components. The real and imaginary parts of an analytic signal are real-valued functions related to each other by the Hilbert transform.
In mathematics, the Riesz–Thorin theorem, often referred to as the Riesz–Thorin interpolation theorem or the Riesz–Thorin convexity theorem, is a result about interpolation of operators. It is named after Marcel Riesz and his student G. Olof Thorin.
The rectangular function is defined as
In mathematics, a Dirac comb is a periodic function with the formula for some given period . Here t is a real variable and the sum extends over all integers k. The Dirac delta function and the Dirac comb are tempered distributions. The graph of the function resembles a comb, hence its name and the use of the comb-like Cyrillic letter sha (Ш) to denote the function.
In mathematics, the stationary phase approximation is a basic principle of asymptotic analysis, applying to functions given by integration against a rapidly-varying complex exponential.
In mathematics, and specifically in potential theory, the Poisson kernel is an integral kernel, used for solving the two-dimensional Laplace equation, given Dirichlet boundary conditions on the unit disk. The kernel can be understood as the derivative of the Green's function for the Laplace equation. It is named for Siméon Poisson.
In complex analysis, functional analysis and operator theory, a Bergman space, named after Stefan Bergman, is a function space of holomorphic functions in a domain D of the complex plane that are sufficiently well-behaved at the boundary that they are absolutely integrable. Specifically, for 0 < p < ∞, the Bergman space Ap(D) is the space of all holomorphic functions in D for which the p-norm is finite:
In mathematics, the lemniscate elliptic functions are elliptic functions related to the arc length of the lemniscate of Bernoulli. They were first studied by Giulio Fagnano in 1718 and later by Leonhard Euler and Carl Friedrich Gauss, among others.
In mathematics, a π-system on a set is a collection of certain subsets of such that
In functional analysis, the Shannon wavelet is a decomposition that is defined by signal analysis by ideal bandpass filters. Shannon wavelet may be either of real or complex type.
In mathematics, Maass forms or Maass wave forms are studied in the theory of automorphic forms. Maass forms are complex-valued smooth functions of the upper half plane, which transform in a similar way under the operation of a discrete subgroup of as modular forms. They are eigenforms of the hyperbolic Laplace operator defined on and satisfy certain growth conditions at the cusps of a fundamental domain of . In contrast to modular forms, Maass forms need not be holomorphic. They were studied first by Hans Maass in 1949.
In functional analysis, every C*-algebra is isomorphic to a subalgebra of the C*-algebra of bounded linear operators on some Hilbert space This article describes the spectral theory of closed normal subalgebras of . A subalgebra of is called normal if it is commutative and closed under the operation: for all , we have and that .
{{cite book}}
: CS1 maint: location (link)