The Hilbert Transform

Similar documents
Representation of Signals & Systems

Summary of Fourier Transform Properties

ENSC327 Communications Systems 2: Fourier Representations. Jie Liang School of Engineering Science Simon Fraser University

ENSC327 Communications Systems 2: Fourier Representations. School of Engineering Science Simon Fraser University

Question Paper Code : AEC11T02

Fourier Series and Transform KEEE343 Communication Theory Lecture #7, March 24, Prof. Young-Chai Ko

E2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2)

Lecture 8 ELE 301: Signals and Systems

Lecture Schedule: Week Date Lecture Title

Continuous-Time Fourier Transform

06/12/ rws/jMc- modif SuFY10 (MPF) - Textbook Section IX 1

GATE EE Topic wise Questions SIGNALS & SYSTEMS

4 The Continuous Time Fourier Transform

Fourier Transform for Continuous Functions

ECE-700 Review. Phil Schniter. January 5, x c (t)e jωt dt, x[n]z n, Denoting a transform pair by x[n] X(z), some useful properties are

Chapter 3 Convolution Representation

arxiv: v1 [math.ca] 6 Feb 2015

The Hilbert Transform

Communication Signals (Haykin Sec. 2.4 and Ziemer Sec Sec. 2.4) KECE321 Communication Systems I

Math 3313: Differential Equations Laplace transforms

ELEG 3124 SYSTEMS AND SIGNALS Ch. 5 Fourier Transform

ω 0 = 2π/T 0 is called the fundamental angular frequency and ω 2 = 2ω 0 is called the

Notes 07 largely plagiarized by %khc

Review of Fourier Transform

The Discrete-time Fourier Transform

A system that is both linear and time-invariant is called linear time-invariant (LTI).

2.161 Signal Processing: Continuous and Discrete Fall 2008

2.1 Basic Concepts Basic operations on signals Classication of signals

Ver 3808 E1.10 Fourier Series and Transforms (2014) E1.10 Fourier Series and Transforms. Problem Sheet 1 (Lecture 1)

ESS Dirac Comb and Flavors of Fourier Transforms

6 The Fourier transform

(f g)(t) = Example 4.5.1: Find f g the convolution of the functions f(t) = e t and g(t) = sin(t). Solution: The definition of convolution is,

The Discrete Fourier Transform. Signal Processing PSYCH 711/712 Lecture 3

Introduction to Image Processing #5/7

EE 3054: Signals, Systems, and Transforms Summer It is observed of some continuous-time LTI system that the input signal.

Homework 4. May An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt

Frequency Response (III) Lecture 26:

1 Understanding Sampling

2 Frequency-Domain Analysis

REVIEW OF DIFFERENTIAL CALCULUS

3.2 Complex Sinusoids and Frequency Response of LTI Systems

A523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011

Vectors in Function Spaces

Continuous-time Fourier Methods

Fourier Series. Spectral Analysis of Periodic Signals

Functions not limited in time

Two Channel Subband Coding

Solutions to Problems in Chapter 4

Conformal maps. Lent 2019 COMPLEX METHODS G. Taylor. A star means optional and not necessarily harder.

ECE 3084 QUIZ 2 SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING GEORGIA INSTITUTE OF TECHNOLOGY APRIL 2, Name:

EC Signals and Systems

x(t) = t[u(t 1) u(t 2)] + 1[u(t 2) u(t 3)]

EE401: Advanced Communication Theory

Signals and Systems: Part 2

Fourier Series and Transforms. Revision Lecture

Es e j4φ +4N n. 16 KE s /N 0. σ 2ˆφ4 1 γ s. p(φ e )= exp 1 ( 2πσ φ b cos N 2 φ e 0

LTI Systems (Continuous & Discrete) - Basics

Representation of Signals and Systems. Lecturer: David Shiung

Lecture 27 Frequency Response 2

Practice Problems For Test 3

Review: Continuous Fourier Transform

Therefore the new Fourier coefficients are. Module 2 : Signals in Frequency Domain Problem Set 2. Problem 1

Hilbert Transforms in Signal Processing

Chapter 5 Frequency Domain Analysis of Systems

LINEAR SYSTEMS. J. Elder PSYC 6256 Principles of Neural Coding

Continuous Time Signal Analysis: the Fourier Transform. Lathi Chapter 4

Laplace Transforms and use in Automatic Control

Ch 4: The Continuous-Time Fourier Transform

Generation of bandlimited sync transitions for sine waveforms

ECEN 420 LINEAR CONTROL SYSTEMS. Lecture 2 Laplace Transform I 1/52

8.1 Circuit Parameters

The Continuous-time Fourier

Grades will be determined by the correctness of your answers (explanations are not required).

Practice Problems For Test 3

6.003 Homework #10 Solutions

Lecture 7 ELE 301: Signals and Systems

8: Correlation. E1.10 Fourier Series and Transforms ( ) Fourier Transform - Correlation: 8 1 / 11. 8: Correlation

Chapter 5 Frequency Domain Analysis of Systems

HIGHER-ORDER LINEAR ORDINARY DIFFERENTIAL EQUATIONS IV: Laplace Transform Method David Levermore Department of Mathematics University of Maryland

Fourier Series Example

Computational Methods for Astrophysics: Fourier Transforms

be the set of complex valued 2π-periodic functions f on R such that

The Laplace Transform

A Family of Nyquist Filters Based on Generalized Raised-Cosine Spectra

Chapter 7: Filter Design 7.1 Practical Filter Terminology

Chapter 4 The Fourier Series and Fourier Transform

A review: The Laplacian and the d Alembertian. j=1

System Identification & Parameter Estimation

HIGHER-ORDER LINEAR ORDINARY DIFFERENTIAL EQUATIONS IV: Laplace Transform Method. David Levermore Department of Mathematics University of Maryland

A6523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2013

EE303: Communication Systems

Discrete-Time Signals and Systems. Efficient Computation of the DFT: FFT Algorithms. Analog-to-Digital Conversion. Sampling Process.

Generalized sources (Sect. 6.5). The Dirac delta generalized function. Definition Consider the sequence of functions for n 1, Remarks:

Fourier transform representation of CT aperiodic signals Section 4.1

ENGIN 211, Engineering Math. Laplace Transforms

Review of Concepts from Fourier & Filtering Theory. Fourier theory for finite sequences. convolution/filtering of infinite sequences filter cascades

Fourier transforms. Definition F(ω) = - should know these! f(t).e -jωt.dt. ω = 2πf. other definitions exist. f(t) = - F(ω).e jωt.

Convolution. Define a mathematical operation on discrete-time signals called convolution, represented by *. Given two discrete-time signals x 1, x 2,

1 otherwise. Note that the area of the pulse is one. The Dirac delta function (a.k.a. the impulse) can be defined using the pulse as follows:

5 Analog carrier modulation with noise

Transcription:

The Hilbert Transform Frank R. Kschischang The Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto October 22, 2006; updated March 0, 205 Definition The Hilbert transform H[g(t)] of a signal g(t) is defined as H[g(t)] = g(t) = g(τ) t τ dτ = g(t τ) τ dτ. () The Hilbert transform of g(t) is the convolution of g(t) with the signal /. It is the response to g(t) of a linear time-invariant filter (called a Hilbert transformer) having impulse response /. The Hilbert transform H[g(t)] is often denoted as ĝ(t) or as [g(t)]. A technicality arises immediately. The alert reader will already be concerned with the definition () as the integral is improper: the integrand has a singularity and the limits of integration are infinite. In fact, the Hilbert transform is properly defined as the Cauchy principal value of the integral in (), whenever this value exists. The Cauchy principal value is defined for the first integral in () as ( H[g(t)] = t ɛ ) lim g(τ) t+/ɛ ɛ 0 + t /ɛ t τ dτ + g(τ) t+ɛ t τ dτ. (2) We see that the Cauchy principal value is obtained by considering a finite range of integration that is symmetric about the point of singularity, but which excludes a symmetric subinterval, taking the limit of the integral as the length of the interval approaches while, simultaneously, the length of the excluded interval approaches zero. Henceforth, whenever we write an integral as in (), we will mean the Cauchy principal value of that integral (when it exists).

2 Some Basic Properties Some obvious properties of the Hilbert transform follow directly from the definition. Clearly the Hilbert transform of a time-domain signal g(t) is another time-domain signal ĝ(t). If g(t) is real-valued, then so is ĝ(t). Linearity: The Hilbert transform is linear, i.e., if a and a 2 are arbitrary (complex) scalars, and g (t) and g 2 (t) are signals, then [a g (t) + a 2 g 2 (t)] = a ĝ (t) + a 2 ĝ 2 (t). (This follows immediately from the fact that the Hilbert transform is the output of a linear system.) The Hilbert transform of a constant signal: Note that, for any constant c, the Hilbert transform of the constant signal g(t) = c is ĝ(t) = ĉ = 0. (See Exercise 2.) From linearity it follows that H[g(t) + c] = ĝ(t) + ĉ = ĝ(t). Thus, like an ideal differentiator, a Hilbert transformer loses dc offsets. Later we will define an inverse Hilbert transform which can recover the original signal up to an additive constant (in the same way that integration can undo differentiation only up to an additive constant). Time-shifting and time-dilation: If g(t) has Hilbert transform ĝ(t), then g(t t 0 ) has Hilbert transform ĝ(t t 0 ), and g(at) has Hilbert transform sgn(a)ĝ(at) (assuming a 0). Convolution: The Hilbert transform behaves nicely with respect to convolution, since [g (t) g 2 (t)] = ĝ (t) g 2 (t) = g (t) ĝ 2 (t). To see this, observe from the associative and commutative properties of convolution that [g (t) g 2 (t)] can be written as [g (t) ] g 2(t) or as g (t) [g 2 (t) ]. Time-derivative: The Hilbert transform of the derivative of a signal is the derivative of the Hilbert transform, i.e., H[ d dt g(t)] = d dt H[g(t)]. To see this, recall Leibniz s Integral Rule, which states that d dc b(c) a(c) f(x, c) dx = b(c) a(c) c f(x, c) dx + f(b, c) d dc b(c) f(a, c) d dc a(c). 2

In particular, if a and b are definite limits (independent of c), we have Now where g (t) = d dt g(t). d dc b a f(x, c) dx = b a f(x, c) dx. c d dt H[g(t)] = d g(t τ) dτ = g (t τ) dτ = H[g (t)], dt τ τ We may also reason as follows. Let δ (t) denote the so-called doublet, i.e., the operator for which g(t) δ (t) = g (t). Then we see that H[g (t)] = [g(t) δ (t)] = [g(t) ] δ (t) = d dtĝ(t). 3 Interaction with the Fourier Transform The signal /() has Fourier transform j sgn(f) = j, if f > 0 0, if f = 0 j, if f < 0 If g(t) has Fourier transform G(f), then, from the convolution property of the Fourier transform, it follows that ĝ(t) has Fourier transform Ĝ(f) = j sgn(f)g(f). Thus, the Hilbert transform is easier to understand in the frequency domain than in the time domain: the Hilbert transform does not change the magnitude of G(f), it changes only the phase. Fourier transform values at positive frequencies are multiplied by j (corresponding to a phase change of /2) while Fourier transform values at negative frequencies are multiplied by j (corresponding to a phase change of /2). Stated yet another way, suppose that G(f) = a + bj for some f. Then Ĝ(f) = b aj if f > 0 and Ĝ(f) = b + aj if f < 0. Thus the Hilbert transform essentially acts to exchange the real and imaginary parts of G(f) (while changing the sign of one of them). Energy Spectral Density: Suppose that g(t) is an energy signal. Then, since Ĝ(f) = G(f), both Ĝ(f) and G(f) have exactly the same energy spectral density. Thus, for example, if G(f) is bandlimited to B Hz then so is Ĝ(f). It also follows that ĝ(t) has exactly the same energy as g(t). 3

Symmetry Properties: If g(t) is real-valued, then G(f) exhibits Hermitian symmetry, i.e., G( f) = G (f). Of course then Ĝ( f) = j sgn( f)g( f) = [ j sgn(f)g(f)] = Ĝ(f), so Ĝ(f) also exhibits Hermitian symmetry, as expected. Let g(t) be a real-valued signal. Recall that if g(t) is even (so that g( t) = g(t)) then G(f) is purely real-valued while if g(t) is odd (so that g( t) = g(t)) then G(f) is purely imaginaryvalued. Now if G(f) is purely real-valued then certainly Ĝ(f) is purely imaginary-valued (and vice-versa). Thus if g(t) is even, then ĝ(t) is odd and if g(t) is odd, then ĝ(t) is even. Orthogonality: If g(t) is a real-valued energy signal, then g(t) and ĝ(t) are orthogonal. To see this recall that g(t), ĝ(t) = = = = = 0, g(t)ĝ (t) dt G(f)Ĝ (f) df G(f)[ j sgn(f)g(f)] df j G(f) 2 sgn(f) df where we have used the property that, since G(f) 2 is an even function of f, G(f) 2 sgn(f) is an odd function of f and hence the value of the integral is zero. Low-pass High-pass Products: Let g(t) be signal whose Fourier transform satisfies G(f) = 0 for f W and let h(t) be a signal with H(f) = 0 for f < W. Then H[g(t)h(t)] = g(t)ĥ(t), i.e., to compute the Hilbert transform of the product of a low-pass signal with a high-pass signal, only the high-pass signal needs to be transformed. To see this, let s(t) = g(t)h(t) so that S(f) = G(f) H(f) = G(f) [H(f) u(f) + H(f) u( f)], where u denotes the unit step function. It is easy to see that G(f) (H(f) u(f)) is zero if 4

f < 0; similarly G(f) (H(f) u( f)) is zero if f > 0. Thus Ŝ(f) = j sgn(f)s(f) = jg(f) (H(f) u(f)) + jg(f) (H(f) u( f)) = G(f) [ jh(f) u(f) + jh(f) u( f)] = G(f) [ j sgn(f)h(f)] = G(f) Ĥ(f). An important special case of this arises in the case of QAM modulation. Assuming that m I (t) and m Q (t) are bandlimited to W Hz, then, if f c > W, we have H[m I (t) cos(2f c t) + m Q (t) sin(2f c t)] = m I (t) sin(2f c t) m Q (t) cos(2f c t). (3) Amplitude-modulated Signals: The Hilbert transform of a general amplitude-modulated signal is given by [] [ H[g(t) cos(2f c t + θ)] = g(t) cos(2f ] ct) cos(2f c t + θ) [ + g(t) sin(2f ] ct) sin(2f c t + θ). To see this, write g(t) as g(t) = g L (t) + g H (t), where g L (t), the low-pass component of g(t), is given as g L (t) = g(t) 2f c sinc(2f c t) = g(t) sin(2f ct) and g H (t), the high-pass component of g(t), is given as g H (t) = g(t) g L (t) = g(t) [δ(t) 2f c sinc(2f c t)]. Clearly g L (t) contains all frequency components of g(t) from dc up to frequency f c, while g H (t) contains the remaining components at higher frequencies. We have H[g(t) cos(2f c t + θ)] = H[g L (t) cos(2f c t + θ)] + H[g H (t) cos(2f c t + θ)] = g L (t)h[cos(2f c t + θ)] + H[g H (t)] cos(2f c t + θ) where the second equality follows from application of the low-pass high-pass product result. 5

Clearly H[cos(2f c t + θ)] = sin(2f c t + θ). It remains to find H[g H (t)]. This is given as H[g H (t)] = g(t) [δ(t) 2f c sinc(2f c t)] = g(t) [ 2f c sinc(2f c t) ] (a) = g(t) [ 2f c sinc(f c t) sin(f c t)] = g(t) [ ( 2 sin2 (f c t)] = g(t) cos(2f ct), and the main result follows directly. In the equality (a), we have used the fact that H[sinc(t)] = sinc(t/2) sin(/2); see Exercise 6. Inverse Hilbert Transform: Note that [Ĝ(f)] = ( j sgn(f)) 2 G(f) = sgn 2 (f)g(f). Except at f = 0, sgn 2 (f) =. Thus, unless G(f) has some sort of singularity (e.g., a delta function) at f = 0, we get H[H[g(t)]] = g(t). A delta function at f = 0 corresponds to a nonzero dc offset; which, as already remarked upon, is lost by the Hilbert transform. Thus, assuming that g(t) has zero mean, we may recover g(t) from ĝ(t): the inverse Hilbert transform is given by applying the Hilbert transform again, and negating the result: In general, we have, for some constant c, g(t) = H[ĝ(t)] = ĝ(t). g(t) = ĝ(t) + c. Zero-mean signals g(t) and ĝ(t) are often referred to as a Hilbert transform pair. For every Hilbert transform pair g(t) and ĝ(t) there is also the dual pair ĝ(t) and g(t). Table lists some Hilbert transform pairs. Fig. plots rect(t) and H[rect(t)] = ln (2t + )/(2t ). (The rectangular pulse rect(t) is defined as u(t + /2) u(t /2), where u(t) is the unit step.) T/2 The mean of g(t) is defined as lim T T g(t) dt, when this limit exists. T/2 6

2 2.5 0.5 0.5.5 2 t 2 Figure : The function rect(t) (dashed) and its Hilbert transform ln (2t + )/(2t ). 4 Single-sideband Modulation For any signal g(t), let g + (t) = [g(t) + jĝ(t)] 2 g (t) = [g(t) jĝ(t)] 2 be two complex-valued signals associated with g(t). The significance of these two signals can be seen from their Fourier transforms. We have G + (f) = 2 [G(f) + jĝ(f)] = 2 [G(f) j2 sgn(f)g(f)] = G(f) [ + sgn(f)] 2 = G(f) u(f) where u(f) is the unit step function, and, similarly, G (f) = G(f) u( f). Thus g + (t) has spectral components (equal to those of g(t)) at positive frequencies only, i.e., g + (t) has a right-sided spectrum. Similarly, g (t) has spectral components (equal to those of g(t)) at negative frequencies only and hence has a left-sided spectrum. These spectra are illustrated in Fig. 2. It is now straightforward to express upper- and lower-sideband signals in terms of g + (t) and g (t). Let g(t) be the modulating signal, assumed bandlimited to W Hz, and let f c > W be the carrier frequency. In the frequency domain, the upper sideband signal is given by S USB (f) = G + (f f c ) + G (f + f c ), 7

G(f) G + (f) G (f) W f f W W W (a) (b) (c) f Figure 2: Signal spectra: (a) G(f), (b) the right-sided spectrum G + (f), (c) the left-sided spectrum G (f). and the lower sideband signal is given by as sketched in Fig. 3 below. S LSB (f) = G (f f c ) + G + (f + f c ), S USB (f) f c f c f (a) S LSB (f) f c f c f (b) Figure 3: Single-sideband spectra: (a) upper-sideband, (b) lower-sideband. It follows from the frequency-shifting property of the Fourier transform that s USB (f) = g + (t) exp(j2f c t) + g (t) exp( j2f c t) = 2 (g(t) + jĝ(t)) exp(j2f ct) + 2 (g(t) jĝ(t)) exp( j2f ct) = g(t) 2 [exp(j2f ct) + exp( j2f c t)] + ĝ(t) 2 [j exp(j2f ct) j exp( j2f c t)] = g(t) cos(2f c t) ĝ(t) sin(2f c t). A similar derivation shows that s LSB (f) = g(t) cos(2f c t) + ĝ(t) sin(2f c t). Thus we see that single-sideband modulation can be regarded and implemented as a form of quadrature amplitude modulation (QAM), with the modulating signal g(t) placed in the in-phase channel and the Hilbert transform of g(t) (or its negative) placed in the quadrature channel. A block diagram illustrating this approach is given in Fig. 4. 8

Table : Hilbert transform pairs. (See also [2].) g(t) ĝ(t) a g (t) + a 2 g 2 (t); a, a 2 C a ĝ (t) + a 2 ĝ 2 (t) h(t t 0 ) ĥ(t t 0 ) h(at); a 0 d h(t) dt sgn(a)ĥ(at) d dtĥ(t) δ(t) e jt je jt e jt je jt cos(t) sin(t) rect(t) ln (2t + )/(2t ) sinc(t) 2 sinc2 (t/2) = sin(/2) sinc(t/2) /( + t 2 ) t/( + t 2 ) product modulator message signal cos(2f c t) g(t) + H + /2 + LSB sin(2f c t) USB ĝ(t) product modulator Figure 4: Generation of an SSB-modulated signal. 9

5 Exercises. Give an expression for the Cauchy principal value of the second integral in (). 2. Show that ĉ = 0 for any constant c. 3. Find the Hilbert transform of g(t) = /t. 4. Verify that H[rect(t)] = ln (2t + )/(2t ). 5. Verify that H[/( + t 2 )] = t/( + t 2 ). 6. Verify that H[sinc(t)] = sin(/2) sinc(t/2). 7. If sin(2w t) h L (t) = is the impulse response of an ideal lowpass filter with cutoff frequency W, what operation does the LTI system with impulse response h H (t) = cos(2w t) perform? Show that h H (t) implements the Hilbert transform of the output of an ideal highpass filter with cutoff frequency W. 6 Solutions to Exercises. ( g(t τ) ɛ g(t τ) dτ = lim dτ + ) /ɛ g(t τ) dτ. τ ɛ 0 + /ɛ τ ɛ τ 2. We have ĉ = lim ɛ 0 + = lim ɛ 0 + = lim ɛ 0 + = 0 ( ( ( ɛ /ɛ /ɛ ɛ /ɛ ɛ c τ dτ + /ɛ c ɛ c τ dτ + ( c τ c τ ) dτ /ɛ ɛ ) τ dτ ) c τ dτ ) 0

3. We have H[δ(t)] =, and H[ ] = δ(t). Thus H[/t] = δ(t). 4. Let g(t) = rect(t). Then There are four cases. ĝ(t) = t+/2 t /2 τ dτ. In case t > /2, this integral evaluates to ln((t + /2)/(t /2)). By symmetry, in case t < /2, this integral evaluates to ln((t /2)/(t+/2)), which can be written as ln((t + /2)/(t /2)). In case 0 < t < /2, the region of integration spans the singularity at τ = 0. The Cauchy principal value of the integral over the interval [t /2, t + /2] is zero; therefore what remains is the integral over the interval ( t + /2, t + /2), which evaluates to ln((t + /2)/( t + /2)). By symmetry, in case /2 < t < 0, we find that the integral over the interval [ t /2, t + /2] is zero; therefore what remains is the integral over the interval [t /2, t /2], which evaluates to ln(( t+/2)/(t+/2) = ln((t+/2)/( t+ /2)). These four cases can be combined by writing ĝ(t) = ln (t + /2)/(t /2) = ln (2t + )/(2t ). 5. Let g(t) = 2/(+t 2 ), so that g(t) = jt + +jt. We have F[/( jt)] = 2e 2f u(f). By the time-reversal property of the Fourier transform, we get F[/(+jt)] = 2e 2f u( f), and hence G(f) = 2e 2f u(f) + 2e 2f u( f). Multiplying by j sgn(f), we get Ĝ(f) = j2e 2f u(f) + j2e 2f u( f), so ĝ(t) = j jt + j + jt = 2t + t. 2 6. From the identity sinc(t) = sinc(t/2) cos(/2), apply the low-pass high-pass product result to get H[sinc(t)] = sinc(t/2) sin(/2). 7. An ideal highpass filter with cutoff frequency W has frequency response H(f) = rect(f/2w ), and hence has impulse response δ(t) 2W sinc(2w t). Convolving this

with /() (to get the Hilbert transform) we get h H (t) = 2W sinc(2w t) = 2W sinc(w t) sin(w t) = ( 2 sin2 (W t)) = cos(2w t) References [] S. L. Hahn, Comments on A Tabulation of Hilbert Transforms for Electrical Engineers, IEEE Trans. on Commun., vol. 44, p. 768, July 996. [2] S. L. Hahn, Hilbert transforms, in The Transforms and Applications Handbook (A. Poularakis, Ed.), Boca Raton FL: CRC Press, 996, ch. 7. 2