Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Hilbert transform

From Wikipedia, the free encyclopedia
Integral transform and linear operator

Inmathematics andsignal processing, theHilbert transform is a specificsingular integral that takes a function,u(t) of a real variable and produces another function of a real variableH(u)(t). The Hilbert transform is given by theCauchy principal value of theconvolution with the function1/(πt){\displaystyle 1/(\pi t)} (see§ Definition). The Hilbert transform has a particularly simple representation in thefrequency domain: It imparts aphase 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 theanalytic representation of a real-valued signalu(t). The Hilbert transform was first introduced byDavid Hilbert in this setting, to solve a special case of theRiemann–Hilbert problem for analytic functions.

Definition

[edit]

The Hilbert transform ofu can be thought of as theconvolution ofu(t) with the functionh(t) =1/πt, known as theCauchy kernel. Because 1/t is notintegrable acrosst = 0, the integral defining the convolution does not always converge. Instead, the Hilbert transform is defined using theCauchy principal value (denoted here byp.v.). Explicitly, the Hilbert transform of a function (or signal)u(t) is given by

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

provided this integral exists as a principal value. This is precisely the convolution ofu with thetempered distributionp.v.1/πt.[1] Alternatively, by changing variables, the principal-value integral can be written explicitly[2] as

H(u)(t)=2πlimε0εu(tτ)u(t+τ)2τdτ.{\displaystyle \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 .}

When the Hilbert transform is applied twice in succession to a functionu, the result is

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

provided the integrals defining both iterations converge in a suitable sense. In particular, the inverse transform isH{\displaystyle -\operatorname {H} }. This fact can most easily be seen by considering the effect of the Hilbert transform on theFourier transform ofu(t) (see§ Relationship with the Fourier transform below).

For ananalytic function in theupper half-plane, the Hilbert transform describes the relationship between the real part and the imaginary part of the boundary values. That is, iff(z) is analytic in the upper half complex plane{z : Im{z} > 0}, andu(t) = Re{f (t + 0·i)}, thenIm{f(t + 0·i)} = H(u)(t) up to an additive constant, provided this Hilbert transform exists.

Notation

[edit]

Insignal processing the Hilbert transform ofu(t) is commonly denoted byu^(t){\displaystyle {\hat {u}}(t)}.[3] However, in mathematics, this notation is already extensively used to denote the Fourier transform ofu(t).[4] Occasionally, the Hilbert transform may be denoted byu~(t){\displaystyle {\tilde {u}}(t)}. Furthermore, many sources define the Hilbert transform as the negative of the one defined here.[5]

History

[edit]

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 theRiemann–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 inGöttingen. The results were later published byHermann 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 spacesL2 and2. In 1928,Marcel Riesz proved that the Hilbert transform can be defined foru inLp(R){\displaystyle L^{p}(\mathbb {R} )} (Lp space) for1 <p < ∞, that the Hilbert transform is abounded operator onLp(R){\displaystyle L^{p}(\mathbb {R} )} for1 <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 forAntoni Zygmund andAlberto Calderón during their study ofsingular 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.

Relationship with the Fourier transform

[edit]

The Hilbert transform is amultiplier operator.[14] The multiplier ofH isσH(ω) = −i sgn(ω), wheresgn is thesignum function. Therefore:

F(H(u))(ω)=isgn(ω)F(u)(ω),{\displaystyle {\mathcal {F}}{\bigl (}\operatorname {H} (u){\bigr )}(\omega )=-i\operatorname {sgn}(\omega )\cdot {\mathcal {F}}(u)(\omega ),}

whereF{\displaystyle {\mathcal {F}}} denotes theFourier transform. Sincesgn(x) = sgn(2πx), it follows that this result applies to the three common definitions ofF{\displaystyle {\mathcal {F}}}.

ByEuler's formula,σH(ω)={  i=e+iπ/2if ω<0  0if ω=0i=eiπ/2if ω>0{\displaystyle \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}}}

Therefore,H(u)(t) has the effect of shifting the phase of thenegative frequency components ofu(t) by +90° (π2 radians) and the phase of the positive frequency components by −90°, andi·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 ofu(t) are respectively shifted by +180° and −180°, which are equivalent amounts. The signal is negated; i.e.,H(H(u)) = −u, because

(σH(ω))2=e±iπ=1for ω0.{\displaystyle \left(\sigma _{\operatorname {H} }(\omega )\right)^{2}=e^{\pm i\pi }=-1\quad {\text{for }}\omega \neq 0.}

Table of selected Hilbert transforms

[edit]

In the following table, thefrequency parameterω{\displaystyle \omega } is real.

Signal
u(t){\displaystyle u(t)}
Hilbert transform[fn 1]
H(u)(t){\displaystyle \operatorname {H} (u)(t)}
sin(ωt+φ){\displaystyle \sin(\omega t+\varphi )}[fn 2]

sin(ωt+φπ2)=cos(ωt+φ),ω>0sin(ωt+φ+π2)=cos(ωt+φ),ω<0{\displaystyle {\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}}}

cos(ωt+φ){\displaystyle \cos(\omega t+\varphi )}[fn 2]

cos(ωt+φπ2)=sin(ωt+φ),ω>0cos(ωt+φ+π2)=sin(ωt+φ),ω<0{\displaystyle {\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}}}

eiωt{\displaystyle e^{i\omega t}}

ei(ωtπ2),ω>0ei(ωt+π2),ω<0{\displaystyle {\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}}}

eiωt{\displaystyle e^{-i\omega t}}

ei(ωtπ2),ω>0ei(ωt+π2),ω<0{\displaystyle {\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}}}

1t2+1{\displaystyle 1 \over t^{2}+1}tt2+1{\displaystyle t \over t^{2}+1}
et2{\displaystyle e^{-t^{2}}}2πF(t){\displaystyle {\frac {2}{\sqrt {\pi \,}}}F(t)}
(seeDawson function)
Sinc function
sin(t)t{\displaystyle \sin(t) \over t}
1cos(t)t{\displaystyle 1-\cos(t) \over t}
Dirac delta function
δ(t){\displaystyle \delta (t)}
1πt{\displaystyle {1 \over \pi t}}
Characteristic function
χ[a,b](t){\displaystyle \chi _{[a,b]}(t)}
1πln|tatb|{\displaystyle {{\frac {1}{\,\pi \,}}\ln \left\vert {\frac {t-a}{t-b}}\right\vert }}

Notes

  1. ^Some authors (e.g., Bracewell) use our−H as their definition of the forward transform. A consequence is that the right column of this table would be negated.
  2. ^abThe 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.

An extensive table of Hilbert transforms is available.[15]Note that the Hilbert transform of a constant is zero.

Domain of definition

[edit]

It is by no means obvious that the Hilbert transform is well-defined at all, as theimproper integral defining it must converge in a suitable sense. However, the Hilbert transform is well-defined for a broad class of functions, namely those inLp(R){\displaystyle L^{p}(\mathbb {R} )} for1 <p < ∞.

More precisely, ifu is inLp(R){\displaystyle L^{p}(\mathbb {R} )} for1 <p < ∞, then the limit defining the improper integral

H(u)(t)=2πlimε0εu(tτ)u(t+τ)2τdτ{\displaystyle \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 }

exists foralmost everyt. The limit function is also inLp(R){\displaystyle L^{p}(\mathbb {R} )} and is in fact the limit in the mean of the improper integral as well. That is,

2πεu(tτ)u(t+τ)2τdτH(u)(t){\displaystyle {\frac {2}{\pi }}\int _{\varepsilon }^{\infty }{\frac {u(t-\tau )-u(t+\tau )}{2\tau }}\,\mathrm {d} \tau \to \operatorname {H} (u)(t)}

asε → 0 in theLp norm, as well as pointwise almost everywhere, by theTitchmarsh theorem.[16]

In the casep = 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 anL1 function does converge, however, inL1-weak, and the Hilbert transform is a bounded operator fromL1 toL1,w.[18] (In particular, since the Hilbert transform is also a multiplier operator onL2,Marcinkiewicz interpolation and a duality argument furnishes an alternative proof thatH is bounded onLp.)

Properties

[edit]

Boundedness

[edit]

If1 <p < ∞, then the Hilbert transform onLp(R){\displaystyle L^{p}(\mathbb {R} )} is abounded linear operator, meaning that there exists a constantCp such that

HupCpup{\displaystyle \left\|\operatorname {H} u\right\|_{p}\leq C_{p}\left\|u\right\|_{p}}

for alluLp(R){\displaystyle u\in L^{p}(\mathbb {R} )}.[19]

The best constantCp{\displaystyle C_{p}} is given by[20]Cp={tanπ2pif 1<p2cotπ2pif 2<p<{\displaystyle 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}}}

An easy way to find the bestCp{\displaystyle C_{p}} forp{\displaystyle p} being a power of 2 is through the so-called Cotlar's identity that(Hf)2=f2+2H(fHf){\displaystyle (\operatorname {H} f)^{2}=f^{2}+2\operatorname {H} (f\operatorname {H} f)} for all real valuedf. The same best constants hold for the periodic Hilbert transform.

The boundedness of the Hilbert transform implies theLp(R){\displaystyle L^{p}(\mathbb {R} )} convergence of the symmetric partial sum operatorSRf=RRf^(ξ)e2πixξdξ{\displaystyle S_{R}f=\int _{-R}^{R}{\hat {f}}(\xi )e^{2\pi ix\xi }\,\mathrm {d} \xi }

tof inLp(R){\displaystyle L^{p}(\mathbb {R} )}.[21]

Anti-self adjointness

[edit]

The Hilbert transform is an anti-self adjoint operator relative to the duality pairing betweenLp(R){\displaystyle L^{p}(\mathbb {R} )} and the dual spaceLq(R){\displaystyle L^{q}(\mathbb {R} )}, wherep andq areHölder conjugates and1 <p,q < ∞. Symbolically,

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

foruLp(R){\displaystyle u\in L^{p}(\mathbb {R} )} andvLq(R){\displaystyle v\in L^{q}(\mathbb {R} )}.[22]

Inverse transform

[edit]

The Hilbert transform is ananti-involution,[23] meaning that

H(H(u))=u{\displaystyle \operatorname {H} {\bigl (}\operatorname {H} \left(u\right){\bigr )}=-u}

provided each transform is well-defined. SinceH preserves the spaceLp(R){\displaystyle L^{p}(\mathbb {R} )}, this implies in particular that the Hilbert transform is invertible onLp(R){\displaystyle L^{p}(\mathbb {R} )}, and that

H1=H{\displaystyle \operatorname {H} ^{-1}=-\operatorname {H} }

Complex structure

[edit]

BecauseH2 = −I ("I" is theidentity operator) on the realBanach space ofreal-valued functions inLp(R){\displaystyle L^{p}(\mathbb {R} )}, the Hilbert transform defines alinear complex structure on this Banach space. In particular, whenp = 2, the Hilbert transform gives theHilbert space of real-valued functions inL2(R){\displaystyle L^{2}(\mathbb {R} )} the structure of acomplex Hilbert space.

The (complex)eigenstates of the Hilbert transform admit representations asholomorphic functions in the upper and lower half-planes in theHardy spaceH2 by thePaley–Wiener theorem.

Differentiation

[edit]

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

H(dudt)=ddtH(u){\displaystyle \operatorname {H} \left({\frac {\mathrm {d} u}{\mathrm {d} t}}\right)={\frac {\mathrm {d} }{\mathrm {d} t}}\operatorname {H} (u)}

Iterating this identity,

H(dkudtk)=dkdtkH(u){\displaystyle \operatorname {H} \left({\frac {\mathrm {d} ^{k}u}{\mathrm {d} t^{k}}}\right)={\frac {\mathrm {d} ^{k}}{\mathrm {d} t^{k}}}\operatorname {H} (u)}

This is rigorously true as stated providedu and its firstk derivatives belong toLp(R){\displaystyle L^{p}(\mathbb {R} )}.[24] One can check this easily in the frequency domain, where differentiation becomes multiplication byω.

Convolutions

[edit]

The Hilbert transform can formally be realized as aconvolution with thetempered distribution[25]

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

Thus formally,

H(u)=hu{\displaystyle \operatorname {H} (u)=h*u}

However,a priori this may only be defined foru a distribution ofcompact support. It is possible to work somewhat rigorously with this since compactly supported functions (which are distributionsa fortiori) aredense inLp. Alternatively, one may use the fact thath(t) is thedistributional derivative of the functionlog|t|/π; to wit

H(u)(t)=ddt(1π(ulog||)(t)){\displaystyle \operatorname {H} (u)(t)={\frac {\mathrm {d} }{\mathrm {d} t}}\left({\frac {1}{\pi }}\left(u*\log {\bigl |}\cdot {\bigr |}\right)(t)\right)}

For most operational purposes the Hilbert transform can be treated as a convolution. For example, in a formal sense, the Hilbert transform of a convolution is the convolution of the Hilbert transform applied ononly one of either of the factors:

H(uv)=H(u)v=uH(v){\displaystyle \operatorname {H} (u*v)=\operatorname {H} (u)*v=u*\operatorname {H} (v)}

This is rigorously true ifu andv are compactly supported distributions since, in that case,

h(uv)=(hu)v=u(hv){\displaystyle h*(u*v)=(h*u)*v=u*(h*v)}

By passing to an appropriate limit, it is thus also true ifuLp andvLq provided that

1<1p+1q{\displaystyle 1<{\frac {1}{p}}+{\frac {1}{q}}}

from a theorem due to Titchmarsh.[26]

Invariance

[edit]

The Hilbert transform has the following invariance properties onL2(R){\displaystyle L^{2}(\mathbb {R} )}.

  • It commutes with translations. That is, it commutes with the operatorsTaf(x) =f(x +a) for alla inR.{\displaystyle \mathbb {R} .}
  • It commutes with positive dilations. That is it commutes with the operatorsMλ f (x) =f (λ x) for allλ > 0.
  • Itanticommutes with the reflectionR f (x) =f (−x).

Up to a multiplicative constant, the Hilbert transform is the only bounded operator onL2 with these properties.[27]

In fact there is a wider set of operators that commute with the Hilbert transform. The groupSL(2,R){\displaystyle {\text{SL}}(2,\mathbb {R} )} acts by unitary operatorsUg on the spaceL2(R){\displaystyle L^{2}(\mathbb {R} )} by the formula

Ug1f(x)=1cx+df(ax+bcx+d),g=[abcd] , for  adbc=±1.{\displaystyle \operatorname {U} _{g}^{-1}f(x)={\frac {1}{cx+d}}\,f\left({\frac {ax+b}{cx+d}}\right)\,,\qquad g={\begin{bmatrix}a&b\\c&d\end{bmatrix}}~,\qquad {\text{ for }}~ad-bc=\pm 1.}

Thisunitary representation is an example of aprincipal series representation of SL(2,R) .{\displaystyle ~{\text{SL}}(2,\mathbb {R} )~.} In this case it is reducible, splitting as the orthogonal sum of two invariant subspaces,Hardy spaceH2(R){\displaystyle H^{2}(\mathbb {R} )} and its conjugate. These are the spaces ofL2 boundary values of holomorphic functions on the upper and lower halfplanes.H2(R){\displaystyle H^{2}(\mathbb {R} )} and its conjugate consist of exactly thoseL2 functions with Fourier transforms vanishing on the negative and positive parts of the real axis respectively. Since the Hilbert transform is equal toH = −i (2P − I), withP being the orthogonal projection fromL2(R){\displaystyle L^{2}(\mathbb {R} )} ontoH2(R),{\displaystyle \operatorname {H} ^{2}(\mathbb {R} ),} andI theidentity operator, it follows thatH2(R){\displaystyle \operatorname {H} ^{2}(\mathbb {R} )} and its orthogonal complement are eigenspaces ofH for the eigenvalues±i. In other words,H commutes with the operatorsUg. The restrictions of the operatorsUg toH2(R){\displaystyle \operatorname {H} ^{2}(\mathbb {R} )} and its conjugate give irreducible representations ofSL(2,R){\displaystyle {\text{SL}}(2,\mathbb {R} )} – the so-calledlimit of discrete series representations.[28]

Extending the domain of definition

[edit]

Hilbert transform of distributions

[edit]

It is further possible to extend the Hilbert transform to certain spaces ofdistributions (Pandey 1996, Chapter 3). Since the Hilbert transform commutes with differentiation, and is a bounded operator onLp,H restricts to give a continuous transform on theinverse limit ofSobolev spaces:

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

The Hilbert transform can then be defined on the dual space ofDLp{\displaystyle {\mathcal {D}}_{L^{p}}}, denotedDLp{\displaystyle {\mathcal {D}}_{L^{p}}'}, consisting ofLp distributions. This is accomplished by the duality pairing:
ForuDLp{\displaystyle u\in {\mathcal {D}}'_{L^{p}}}, define:

H(u)DLp=Hu,v  u,Hv, for all vDLp.{\displaystyle \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}}.}

It is possible to define the Hilbert transform on the space oftempered 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.

Hilbert transform of bounded functions

[edit]

The Hilbert transform can be defined for functions inL(R){\displaystyle L^{\infty }(\mathbb {R} )} as well, but it requires some modifications and caveats. Properly understood, the Hilbert transform mapsL(R){\displaystyle L^{\infty }(\mathbb {R} )} to theBanach space ofbounded mean oscillation (BMO) classes.

Interpreted naïvely, the Hilbert transform of a bounded function is clearly ill-defined. For instance, withu = sgn(x), the integral definingH(u) diverges almost everywhere to±∞. To alleviate such difficulties, the Hilbert transform of anL function is therefore defined by the followingregularized form of the integral

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

where as aboveh(x) =1/πx and

h0(x)={0if |x|<11πxif |x|1{\displaystyle h_{0}(x)={\begin{cases}0&{\text{if}}~|x|<1\\{\frac {1}{\pi \,x}}&{\text{if}}~|x|\geq 1\end{cases}}}

The modified transformH 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.

Adeep result of Fefferman's work[31] is that a function is of bounded mean oscillation if and only if it has the formf + H(g) for somef,gL(R){\displaystyle f,g\in L^{\infty }(\mathbb {R} )}.

Conjugate functions

[edit]

The Hilbert transform can be understood in terms of a pair of functionsf(x) andg(x) such that the functionF(x)=f(x)+ig(x){\displaystyle F(x)=f(x)+i\,g(x)}is the boundary value of aholomorphic functionF(z) in the upper half-plane.[32] Under these circumstances, iff andg are sufficiently integrable, then one is the Hilbert transform of the other.

Suppose thatfLp(R).{\displaystyle f\in L^{p}(\mathbb {R} ).} Then, by the theory of thePoisson integral,f admits a unique harmonic extension into the upper half-plane, and this extension is given by

u(x+iy)=u(x,y)=1πf(s)y(xs)2+y2ds{\displaystyle u(x+iy)=u(x,y)={\frac {1}{\pi }}\int _{-\infty }^{\infty }f(s)\;{\frac {y}{(x-s)^{2}+y^{2}}}\;\mathrm {d} s}

which is the convolution off with thePoisson kernel

P(x,y)=yπ(x2+y2){\displaystyle P(x,y)={\frac {y}{\pi \,\left(x^{2}+y^{2}\right)}}}

Furthermore, there is a unique harmonic functionv defined in the upper half-plane such thatF(z) =u(z) +i v(z) is holomorphic andlimyv(x+iy)=0{\displaystyle \lim _{y\to \infty }v\,(x+i\,y)=0}

This harmonic function is obtained fromf by taking a convolution with theconjugate Poisson kernel

Q(x,y)=xπ(x2+y2).{\displaystyle Q(x,y)={\frac {x}{\pi \,\left(x^{2}+y^{2}\right)}}.}

Thusv(x,y)=1πf(s)xs(xs)2+y2ds.{\displaystyle v(x,y)={\frac {1}{\pi }}\int _{-\infty }^{\infty }f(s)\;{\frac {x-s}{\,(x-s)^{2}+y^{2}\,}}\;\mathrm {d} s.}

Indeed, the real and imaginary parts of the Cauchy kernel areiπz=P(x,y)+iQ(x,y){\displaystyle {\frac {i}{\pi \,z}}=P(x,y)+i\,Q(x,y)}

so thatF =u +i v is holomorphic byCauchy's integral formula.

The functionv obtained fromu in this way is called theharmonic conjugate ofu. The (non-tangential) boundary limit ofv(x,y) asy → 0 is the Hilbert transform off. Thus, succinctly,H(f)=limy0Q(,y)f{\displaystyle \operatorname {H} (f)=\lim _{y\to 0}Q(-,y)\star f}

Titchmarsh's theorem

[edit]

Titchmarsh's theorem (named forE. 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-valuedsquare-integrable functionF(x) on the real line to be the boundary value of a function in theHardy spaceH2(U) of holomorphic functions in the upper half-planeU.

The theorem states that the following conditions for a complex-valued square-integrable functionF:RC{\displaystyle F:\mathbb {R} \to \mathbb {C} } are equivalent:

A weaker result is true for functions of classLp forp > 1.[34] Specifically, ifF(z) is a holomorphic function such that

|F(x+iy)|pdx<K{\displaystyle \int _{-\infty }^{\infty }|F(x+i\,y)|^{p}\;\mathrm {d} x<K}

for ally, then there is a complex-valued functionF(x) inLp(R){\displaystyle L^{p}(\mathbb {R} )} such thatF(x +i y) →F(x) in theLp norm asy → 0 (as well as holding pointwisealmost everywhere). Furthermore,

F(x)=f(x)+ig(x){\displaystyle F(x)=f(x)+i\,g(x)}

wheref is a real-valued function inLp(R){\displaystyle L^{p}(\mathbb {R} )} andg is the Hilbert transform (of classLp) off.

This is not true in the casep = 1. In fact, the Hilbert transform of anL1 functionf need not converge in the mean to anotherL1 function. Nevertheless,[35] the Hilbert transform off does converge almost everywhere to a finite functiong such that

|g(x)|p1+x2dx<{\displaystyle \int _{-\infty }^{\infty }{\frac {|g(x)|^{p}}{1+x^{2}}}\;\mathrm {d} x<\infty }

This result is directly analogous to one byAndrey 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 (seePaley–Wiener theorem), as well as work by Riesz, Hille, and Tamarkin[37]

Riemann–Hilbert problem

[edit]

One form of theRiemann–Hilbert problem seeks to identify pairs of functionsF+ andF such thatF+ isholomorphic on the upper half-plane andF is holomorphic on the lower half-plane, such that forx along the real axis,F+(x)F(x)=f(x){\displaystyle F_{+}(x)-F_{-}(x)=f(x)}

wheref(x) is some given real-valued function ofxR{\displaystyle x\in \mathbb {R} }. The left-hand side of this equation may be understood either as the difference of the limits ofF± from the appropriate half-planes, or as ahyperfunction distribution. Two functions of this form are a solution of the Riemann–Hilbert problem.

Formally, ifF± solve the Riemann–Hilbert problemf(x)=F+(x)F(x){\displaystyle f(x)=F_{+}(x)-F_{-}(x)}

then the Hilbert transform off(x) is given by[38]H(f)(x)=i(F+(x)+F(x)).{\displaystyle H(f)(x)=-i{\bigl (}F_{+}(x)+F_{-}(x){\bigr )}.}

Hilbert transform on the circle

[edit]
See also:Hardy space

For a periodic functionf the circular Hilbert transform is defined:

f~(x)12πp.v.02πf(t)cot(xt2)dt{\displaystyle {\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}

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,cot(xt2){\displaystyle \cot \left({\frac {x-t}{2}}\right)}is known as theHilbert 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 kernel1x periodic. More precisely, forx ≠ 0

12cot(x2)=1x+n=1(1x+2nπ+1x2nπ){\displaystyle {\frac {1}{\,2\,}}\cot \left({\frac {x}{2}}\right)={\frac {1}{x}}+\sum _{n=1}^{\infty }\left({\frac {1}{x+2n\pi }}+{\frac {1}{\,x-2n\pi \,}}\right)}

Many results about the circular Hilbert transform may be derived from the corresponding results for the Hilbert transform from this correspondence.

Another more direct connection is provided by the Cayley transformC(x) = (xi) / (x +i), which carries the real line onto the circle and the upper half plane onto theunit disk. It induces a unitary map

Uf(x)=1(x+i)πf(C(x)){\displaystyle U\,f(x)={\frac {1}{(x+i)\,{\sqrt {\pi }}}}\,f\left(C\left(x\right)\right)}

ofL2(T) ontoL2(R).{\displaystyle L^{2}(\mathbb {R} ).} The operatorU carries the Hardy spaceH2(T) onto the Hardy spaceH2(R){\displaystyle H^{2}(\mathbb {R} )}.[39]

Hilbert transform in signal processing

[edit]

Bedrosian's theorem

[edit]

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

H(fLP(t)fHP(t))=fLP(t)H(fHP(t)),{\displaystyle \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),}

wherefLP andfHP are the low- and high-pass signals respectively.[40] A category of communication signals to which this applies is called thenarrowband signal model. A member of that category is amplitude modulation of a high-frequency sinusoidal "carrier":

u(t)=um(t)cos(ωt+φ),{\displaystyle u(t)=u_{m}(t)\cdot \cos(\omega t+\varphi ),}

whereum(t) is the narrow bandwidth "message" waveform, such as voice or music. Then by Bedrosian's theorem:[41]

H(u)(t)={+um(t)sin(ωt+φ)if ω>0um(t)sin(ωt+φ)if ω<0{\displaystyle \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}}}

Analytic representation

[edit]
Main article:analytic signal

A specific type ofconjugate function is:

ua(t)u(t)+iH(u)(t),{\displaystyle u_{a}(t)\triangleq u(t)+i\cdot H(u)(t),}

known as theanalytic representation ofu(t).{\displaystyle u(t).} The name reflects its mathematical tractability, due largely toEuler's formula. Applying Bedrosian's theorem to the narrowband model, the analytic representation is:[42]

ua(t)=um(t)cos(ωt+φ)+ium(t)sin(ωt+φ),ω>0=um(t)[cos(ωt+φ)+isin(ωt+φ)],ω>0=um(t)ei(ωt+φ),ω>0.{\displaystyle {\begin{aligned}u_{a}(t)&=u_{m}(t)\cdot \cos(\omega t+\varphi )+i\cdot u_{m}(t)\cdot \sin(\omega t+\varphi ),\quad \omega >0\\&=u_{m}(t)\cdot \left[\cos(\omega t+\varphi )+i\cdot \sin(\omega t+\varphi )\right],\quad \omega >0\\&=u_{m}(t)\cdot e^{i(\omega t+\varphi )},\quad \omega >0.\,\end{aligned}}}Eq.1

A Fourier transform property indicates that this complexheterodyne operation can shift all the negative frequency components ofum(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.

Angle (phase/frequency) modulation

[edit]

The form:[43]

u(t)=Acos(ωt+φm(t)){\displaystyle u(t)=A\cdot \cos(\omega t+\varphi _{m}(t))}

is calledangle modulation, which includes bothphase modulation andfrequency modulation. Theinstantaneous frequency is  ω+φm(t).{\displaystyle \omega +\varphi _{m}^{\prime }(t).}  For sufficiently largeω, compared toφm{\displaystyle \varphi _{m}^{\prime }}:

H(u)(t)Asin(ωt+φm(t)){\displaystyle \operatorname {H} (u)(t)\approx A\cdot \sin(\omega t+\varphi _{m}(t))}and:ua(t)Aei(ωt+φm(t)).{\displaystyle u_{a}(t)\approx A\cdot e^{i(\omega t+\varphi _{m}(t))}.}

Single sideband modulation (SSB)

[edit]
Main article:Single-sideband modulation

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

um(t)=m(t)+im^(t){\displaystyle u_{m}(t)=m(t)+i\cdot {\widehat {m}}(t)}

the result issingle-sideband modulation:

ua(t)=(m(t)+im^(t))ei(ωt+φ){\displaystyle u_{a}(t)=(m(t)+i\cdot {\widehat {m}}(t))\cdot e^{i(\omega t+\varphi )}}

whose transmitted component is:[44][45]

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

Causality

[edit]

The functionh(t)=1/(πt){\displaystyle h(t)=1/(\pi t)} presents two causality-based challenges to practical implementation in a convolution (in addition to its undefined value at 0):

Discrete Hilbert transform

[edit]
Figure 1: Filter whose frequency response is bandlimited to about 95% of the Nyquist frequency
Figure 2: Hilbert transform filter with a highpass frequency response
Figure 3.
Figure 4. The Hilbert transform ofcos(ωt) issin(ωt). This figure showssin(ωt) and two approximate Hilbert transforms computed by the MATLAB library function,hilbert()
Figure 5. Discrete Hilbert transforms of a cosine function, using piecewise convolution

For a discrete function,u[n],{\displaystyle u[n],} withdiscrete-time Fourier transform (DTFT),U(ω){\displaystyle U(\omega )}, anddiscrete Hilbert transformu^[n],{\displaystyle {\widehat {u}}[n],} the DTFT ofu^[n]{\displaystyle {\widehat {u}}[n]} in the regionπ < ω <π is given by:

DTFT(u^)=U(ω)(isgn(ω)).{\displaystyle \operatorname {DTFT} ({\widehat {u}})=U(\omega )\cdot (-i\cdot \operatorname {sgn}(\omega )).}

The inverse DTFT, using theconvolution theorem, is:[46][47]

u^[n]=DTFT1(U(ω))  DTFT1(isgn(ω))=u[n]  12πππ(isgn(ω))eiωndω=u[n]  12π[π0ieiωndω0πieiωndω]h[n],{\displaystyle {\begin{aligned}{\widehat {u}}[n]&={\scriptstyle \mathrm {DTFT} ^{-1}}(U(\omega ))\ *\ {\scriptstyle \mathrm {DTFT} ^{-1}}(-i\cdot \operatorname {sgn}(\omega ))\\&=u[n]\ *\ {\frac {1}{2\pi }}\int _{-\pi }^{\pi }(-i\cdot \operatorname {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{aligned}}}

where

h[n]  {0,if n even2πnif n odd{\displaystyle h[n]\ \triangleq \ {\begin{cases}0,&{\text{if }}n{\text{ even}}\\{\frac {2}{\pi n}}&{\text{if }}n{\text{ odd}}\end{cases}}}

which is an infinite impulse response (IIR).

Practical considerations[48]

Method 1: Direct convolution of streamingu[n]{\displaystyle u[n]} data with an FIR approximation ofh[n],{\displaystyle h[n],} which we will designate byh~[n].{\displaystyle {\tilde {h}}[n].} Examples of truncatedh[n]{\displaystyle h[n]} are shown in figures 1 and 2.Fig 1 has an odd number of anti-symmetric coefficients and is called Type III.[49] This type inherently exhibits responses of zero magnitude at frequencies 0 and Nyquist, resulting in a bandpass filter shape.[50][51] A Type IV design (even number of anti-symmetric coefficients) is shown inFig 2.[52][53] It has a highpass frequency response.[54] Type III is the usual choice.[55][56] for these reasons:

The abrupt truncation ofh[n]{\displaystyle h[n]} creates a rippling (Gibbs effect) of the flat frequency response. That can be mitigated by use of a window function to taperh~[n]{\displaystyle {\tilde {h}}[n]} to zero.[57]

Method 2: Piecewise convolution. It is well known that direct convolution is computationally much more intensive than methods likeoverlap-save that give access to the efficiencies of the Fast Fourier transform via the convolution theorem.[58] Specifically, thediscrete Fourier transform (DFT) of a segment ofu[n]{\displaystyle u[n]} is multiplied pointwise with a DFT of theh~[n]{\displaystyle {\tilde {h}}[n]} 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 lengthN{\displaystyle N} (an arbitrary parameter) are convolved with the periodic function:

h~N[n] m=h~[nmN].{\displaystyle {\tilde {h}}_{N}[n]\ \triangleq \sum _{m=-\infty }^{\infty }{\tilde {h}}[n-mN].}

When the duration of non-zero values ofh~[n]{\displaystyle {\tilde {h}}[n]} isM<N,{\displaystyle M<N,} the output sequence includesNM+1{\displaystyle N-M+1} samples ofu^.{\displaystyle {\widehat {u}}.} M1{\displaystyle M-1} outputs are discarded from each block ofN,{\displaystyle N,} and the input blocks are overlapped by that amount to prevent gaps.

Method 3: Same as method 2, except the DFT ofh~[n]{\displaystyle {\tilde {h}}[n]} is replaced by samples of theisgn(ω){\displaystyle -i\operatorname {sgn} (\omega )} distribution (whose real and imaginary components are all just0{\displaystyle 0} or ±1.{\displaystyle \pm 1.}) That convolvesu[n]{\displaystyle u[n]} with aperiodic summation:[A]

hN[n] m=h[nmN],{\displaystyle h_{N}[n]\ \triangleq \sum _{m=-\infty }^{\infty }h[n-mN],}   [B][C]

for some arbitrary parameter,N.{\displaystyle N.}h[n]{\displaystyle h[n]} 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 whereh[n]{\displaystyle h[n]} 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 ish512[n],{\displaystyle h_{512}[n],} corresponding to method 3. It is the inverse DFT of theisgn(ω){\displaystyle -i\operatorname {sgn} (\omega )} distribution. Specifically, it is the function that is convolved with a segment ofu[n]{\displaystyle u[n]} by theMATLAB function,hilbert(u,512).[61] The real part of the output sequence is the original input sequence, so that the complex output is ananalytic representation ofu[n].{\displaystyle u[n].}

When the input is a segment of a pure cosine, the resulting convolution for two different values ofN{\displaystyle N} is depicted inFig 4 (red and blue plots). Edge effects prevent the result from being a pure sine function (green plot). SincehN[n]{\displaystyle h_{N}[n]} is not an FIR sequence, the theoretical extent of the effects is the entire output sequence. But the differences from a sine function diminish with distance from the edges. ParameterN{\displaystyle N} is the output sequence length. If it exceeds the length of the input sequence, the input is modified by appending zero-valued elements. In most cases, that reduces the magnitude of the edge distortions. But their duration is dominated by the inherent rise and fall times of theh[n]{\displaystyle h[n]} 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 betweenh[n]{\displaystyle h[n]} andhN[n]{\displaystyle h_{N}[n]} (green and red inFig 3). The fact thathN[n]{\displaystyle h_{N}[n]} is tapered (windowed) is actually helpful in this context. The real problem is that it's not windowed enough. Effectively,M=N,{\displaystyle M=N,} whereas the overlap-save method needsM<N.{\displaystyle M<N.}

Number-theoretic Hilbert transform

[edit]

The number theoretic Hilbert transform is an extension[62] of the discrete Hilbert transform to integers modulo an appropriate prime number. In this it follows the generalization ofdiscrete Fourier transform to number theoretic transforms. The number theoretic Hilbert transform can be used to generate sets of orthogonal discrete sequences.[63]

See also

[edit]

Notes

[edit]
  1. ^see§ Periodic convolution, Eq.4b
  2. ^A closed form version ofhN[n]{\displaystyle h_{N}[n]} for even values ofN{\displaystyle N} is:[59]hN[n]={2Ncot(πn/N)for n odd,0for n even.{\displaystyle h_{N}[n]={\begin{cases}{\frac {2}{N}}\cot(\pi n/N)&{\text{for }}n{\text{ odd}},\\0&{\text{for }}n{\text{ even}}.\end{cases}}}
  3. ^A closed form version ofhN[n]{\displaystyle h_{N}[n]} for odd values ofN{\displaystyle N} is:[60]hN[n]=1N(cot(πn/N)cos(πn)sin(πn/N)),{\displaystyle h_{N}[n]={\frac {1}{N}}\left(\cot(\pi n/N)-{\frac {\cos(\pi n)}{\sin(\pi n/N)}}\right),}

Page citations

[edit]
  1. ^Due toSchwartz 1950; seePandey 1996, Chapter 3.
  2. ^Zygmund 1968, §XVI.1.
  3. ^E.g.,Brandwood 2003, p. 87.
  4. ^E.g.,Stein & Weiss 1971.
  5. ^E.g.,Bracewell 2000, p. 359.
  6. ^Kress 1989.
  7. ^Bitsadze 2001.
  8. ^abKhvedelidze 2001.
  9. ^Hilbert 1953.
  10. ^Hardy, Littlewood & Pólya 1952, §9.1.
  11. ^Hardy, Littlewood & Pólya 1952, §9.2.
  12. ^Riesz 1928.
  13. ^Calderón & Zygmund 1952.
  14. ^Duoandikoetxea 2000, Chapter 3.
  15. ^King 2009b.
  16. ^Titchmarsh 1948, Chapter 5.
  17. ^Titchmarsh 1948, §5.14.
  18. ^Stein & Weiss 1971, Lemma V.2.8.
  19. ^This theorem is due toRiesz 1928, VII; see alsoTitchmarsh 1948, Theorem 101.
  20. ^This result is due toPichorides 1972; see alsoGrafakos 2004, Remark 4.1.8.
  21. ^See for exampleDuoandikoetxea 2000, p. 59.
  22. ^Titchmarsh 1948, Theorem 102.
  23. ^Titchmarsh 1948, p. 120.
  24. ^Pandey 1996, §3.3.
  25. ^Duistermaat & Kolk 2010, p. 211.
  26. ^Titchmarsh 1948, Theorem 104.
  27. ^Stein 1970, §III.1.
  28. ^SeeBargmann 1947,Lang 1985, andSugiura 1990.
  29. ^Gel'fand & Shilov 1968.
  30. ^Calderón & Zygmund 1952; seeFefferman 1971.
  31. ^Fefferman 1971;Fefferman & Stein 1972
  32. ^Titchmarsh 1948, Chapter V.
  33. ^Titchmarsh 1948, Theorem 95.
  34. ^Titchmarsh 1948, Theorem 103.
  35. ^Titchmarsh 1948, Theorem 105.
  36. ^Duren 1970, Theorem 4.2.
  37. ^seeKing 2009a, § 4.22.
  38. ^Pandey 1996, Chapter 2.
  39. ^Rosenblum & Rovnyak 1997, p. 92.
  40. ^Schreier & Scharf 2010, 14.
  41. ^Bedrosian 1962.
  42. ^Osgood, p. 320
  43. ^Osgood, p. 320
  44. ^Franks 1969, p. 88
  45. ^Tretter 1995, p. 80 (7.9)
  46. ^Carrick, Jaeger & harris 2011, p. 2
  47. ^Rabiner & Gold 1975, p. 71 (Eq 2.195)
  48. ^Oppenheim, Schafer & Buck 1999, p. 794-795
  49. ^Isukapalli, p. 14
  50. ^Isukapalli, p. 18
  51. ^Rabiner & Gold 1975, p. 172 (Fig 3.74)
  52. ^Isukapalli, p. 15
  53. ^Rabiner & Gold 1975, p. 173 (Fig 3.75)
  54. ^Isukapalli, p. 18
  55. ^Carrick, Jaeger & harris 2011, p. 3
  56. ^Rabiner & Gold 1975, p. 175
  57. ^Carrick, Jaeger & harris 2011, p. 3
  58. ^Rabiner & Gold 1975, p. 59 (2.163)
  59. ^Johansson, p. 24
  60. ^Johansson, p. 25
  61. ^MathWorks."hilbert – Discrete-time analytic signal using Hilbert transform".MATLAB Signal Processing Toolbox Documentation. Retrieved2021-05-06.
  62. ^Kak 1970.
  63. ^Kak 2014.

References

[edit]


Further reading

[edit]
  • Benedetto, John J. (1996).Harmonic Analysis and its Applications. Boca Raton, FL: CRC Press.ISBN 0849378796.
  • Carlson; Crilly & Rutledge (2002).Communication Systems (4th ed.). McGraw-Hill.ISBN 0-07-011127-8.
  • Gold, B.; Oppenheim, A. V.; Rader, C. M. (1969). "Theory and Implementation of the Discrete Hilbert Transform".Proceedings of the 1969 Polytechnic Institute of Brooklyn Symposium. New York.
  • Grafakos, Loukas (1994). "An elementary proof of the square summability of the discrete Hilbert transform".American Mathematical Monthly.101 (5). Mathematical Association of America:456–458.doi:10.2307/2974910.JSTOR 2974910.
  • Titchmarsh, E. (1926). "Reciprocal formulae involving series and integrals".Mathematische Zeitschrift.25 (1):321–347.doi:10.1007/BF01283842.S2CID 186237099.

External links

[edit]
Wikimedia Commons has media related toHilbert transform.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Hilbert_transform&oldid=1321854352"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2026 Movatter.jp