0% found this document useful (0 votes)
599 views15 pages

Hilbert Transform in Signal Processing

The Hilbert transform: 1. Performs a 90° phase shift on the frequency components of a signal, transforming cosines to sines and vice versa. 2. Does not involve a change of domain like other transforms, as it operates on signals in the time domain. 3. Results in a signal that is orthogonal to the original signal due to the phase shift introducing.

Uploaded by

harsha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
599 views15 pages

Hilbert Transform in Signal Processing

The Hilbert transform: 1. Performs a 90° phase shift on the frequency components of a signal, transforming cosines to sines and vice versa. 2. Does not involve a change of domain like other transforms, as it operates on signals in the time domain. 3. Results in a signal that is orthogonal to the original signal due to the phase shift introducing.

Uploaded by

harsha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd

HILBERT TRANSFORM

 Fourier, Laplace, and z-transforms change


from the time-domain representation of a
signal to the frequency-domain representation
of the signal
 The resulting two signals are equivalent
representations of the same signal in
terms of time or frequency
 In contrast, The Hilbert transform does not
involve a change of domain, unlike many
other transforms
1
HILBERT TRANSFORM
 Strictly speaking, the Hilbert transform is
not a transform in this sense
First, the result of a Hilbert transform is not
equivalent to the original signal, rather it
is a completely different signal
Second, the Hilbert transform does not
involve a domain change, i.e., the Hilbert
transform of a signal x(t) is another signal
denoted by xˆ (t ) in the same domain
(i.e.,time domain)

2
HILBERT TRANSFORM
 The Hilbert transform of a signal x(t) is a
signal xˆ (t ) whose frequency components lag
the frequency components of x(t) by 90
xˆ (t ) has exactly the same frequency components
present in x(t) with the same amplitude–except
there is a 90 phase delay
 TheHilbert transform of x(t) = Acos(2f0t + ) is
Acos(2f0t +  - 90) = Asin(2f0t + )

3
HILBERT TRANSFORM
 A delay of /2 at all frequencies
 ej2f0t will become e j 2f0t  2   je j 2f0t
 e-j2f0t will become e j ( 2f t  )  je j 2f t

0 2 0

 At positive frequencies, the spectrum of the signal is


multiplied by -j
 At negative frequencies, it is multiplied by +j
 Thisis equivalent to saying that the spectrum
(Fourier transform) of the signal is multiplied by
-jsgn(f).

4
HILBERT TRANSFORM
 Assume that x(t) is real and has no DC component : X(f)|f=0 = 0,
then
 Sgn(t)(2/jw)(F.T) F xˆ(t )   j sgn( f ) X ( f )
 Jsgn(t)2/w(F.T)
F 1  j sgn( f ) 
1
 Jsgn(w)(1/2pi)*(2/t) (F.T) t
 -jsgn(w)1/pi*t(F.T) 1 1  x( )
xˆ (t )   x(t ) 
t   t   d

 The operation of the Hilbert transform is equivalent to a


convolution, i.e., filtering

5
Example 2.6.1
 Determine the Hilbert transform of the signal x(t) = 2sinc(2t)
 Solution
 We use the frequency-domain approach . Using the scaling property of the
Fourier transform, we have
1 f f   1  1
F x(t )  2         f     f  
2 2 2  2  2
 In this expression, the first term contains all the negative frequencies and
the second term contains all the positive frequencies
 To obtain the frequency-domain representation of the Hilbert transform of
x(t), we use the relation F xˆ(t ) = -jsgn(f)F[x(t)], which results in
 1  1
F xˆ (t )  j f    j f  
 2  2
 Taking the inverse Fourier transform, we have
xˆ (t )  je jt sinc (t )  je jt sinc (t )   j (e jt  e  jt )sinc (t )
  j  2 j sin( t )sinc (t )  2 sin( t )sinc (t )

6
HILBERT TRANSFORM
 Obviously performing the Hilbert transform on a signal is
equivalent to a 90 phase shift in all its frequency components
 Therefore, the only change that the Hilbert transform
performs on a signal is changing its phase
 The amplitude of the frequency components of the signal do
not change by performing the Hilbert-transform
 On the other hand, since performing the Hilbert transform
changes cosines into sines, the Hilbert transform xˆ (t ) of a
signal x(t) is orthogonal to x(t)
 Also, since the Hilbert transform introduces a 90 phase shift,
carrying it out twice causes a 180 phase shift, which can
cause a sign reversal of the original signal
7
HILBERT TRANSFORM - ITS PROPERTIES

 Evenness and Oddness


 The Hilbert transform of an even signal is odd, and the
Hilbert transform of an odd signal is even
 Proof
 If x(t) is even, then X(f) is a real and even function

 Therefore, -jsgn(f)X(f) is an imaginary and odd function

 Hence, its inverse Fourier transform x ˆ (t ) will be odd


 If x(t) is odd, then X(f) is imaginary and odd

 Thus -jsgn(f)X(f) is real and even

 Therefore, x ˆ (t ) is even

8
HILBERT TRANSFORM - ITS PROPERTIES

 Sign Reversal
 Applying the Hilbert-transform operation to a signal
twice causes a sign reversal of the signal, i.e.,
xˆˆ (t )   x(t )
 Proof

F[ x(t )]   j sgn( f ) X ( f )
ˆ
ˆ 2

F[ xˆˆ (t )]   X ( f )
 X( f ) does not contain any impulses at the origin

9
HILBERT TRANSFORM - ITS PROPERTIES

 Energy
 The energy content of a signal is equal to the energy content
of its Hilbert transform
 Proof
 Using Rayleigh's theorem of the Fourier transform,
 
Ex   x(t ) dt   X ( f ) df
2 2
 
  
Exˆ   xˆ(t ) dt    j sgn( f ) X ( f ) df   X ( f ) df
2 2 2
  

 Using the fact that |-jsgn(f)|2 = 1 except for f = 0, and the


fact that X(f) does not contain any impulses at the origin
completes the proof

10
HILBERT TRANSFORM - ITS PROPERTIES

 Orthogonality
 The signal x(t) and its Hilbert transform are orthogonal
 Proof
 Using Parseval's theorem of the Fourier transform, we
obtain
 
 x(t ) xˆ (t )dt   X ( f )[ j sgn( f ) X ( f )]* df
*
 
0 
  j  X ( f ) df  j  X ( f ) df  0
2 2
 0

 In the last step, we have used the fact that X(f) is Hermitian;
| X(f)|2 is even

11
Ideal filters
 Ideal lowpass filter
 An LTI system that can pass all frequencies less
than some W and rejects all frequencies beyond W
 W is the bandwidth of the filter.

12
Ideal filters
 Ideal highpass filter
 There is unity outside the interval -W  f W and zero inside

 Ideal bandpass filter


 have a frequency response that is unity in some interval
–W1  |f| W2 and zero otherwise
 The bandwidth of the filter is W2 – W1

13
Nonideal filters – 3dB bandwidth
 For nonideal filters, the bandwidth is usually defined as the band of
frequencies at which the power of the filter is at least half of the maximum
power
 This bandwidth is usually called the 3 dB bandwidth of the filter, because
reducing the power by a factor of two is equivalent to decreasing it by 3 dB
on the logarithmic scale

14
LOWPASS AND BANDPASS SIGNALS
 Lowpass signal
 A signal in which the spectrum (frequency content) of the
signal is located around the zero frequency

 Bandpass signal
 A signal with a spectrum far from the zero frequency
 The frequency spectrum of a bandpass signal is usually
located around a frequency fc
 fc is much higher than the bandwidth of the signal

15

You might also like