DSP Lecture 13

DIGITAL SIGNAL PROCESSING
Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

Lecture 12: Summary
•Discrete Time Filter Design From Continuous Time
Filters
•Filter Design by Bilinear Transformation
•Design of FIR Filters by Windowing

Lecture 13: Outline
• Properties of Commonly used Windows
• Kaiser Window Filter Design Method
• The Discrete Fourier Series
• The Discrete Fourier Series Example
• Properties of Discrete Fourier Series

FIR Filter Design by
Windowing
Rectangular Window
• Narrowest main lob
• 4/(M+1)
• Sharpest transitions at
discontinuities in
frequency
• Large side lobs
• -13 dB
• Large oscillation around
discontinuities
• Simplest window possible
1 0  n  M
wn  
0 else
Windowing
Bartlett (Triangular) Window
• Medium main lob
• 8/M
• Side lobs
• -25 dB
• Hamming window performs
better
• Simple equation
 2n / M 0  n  M/2

wn  2  2n / M M / 2  n  M
 0 else


Windowing
Hanning Window
• Medium main lob
• 8/M
• Side lobs
• -31 dB
• Hamming window performs
better
• Same complexity as Hamming
1   2n 
 1  cos  0  n  M
wn  2   M 
 0 else


Windowing
Hamming Window
• Medium main lob
• 8/M
• Good side lobs

• -41 dB
• Simpler than Blackman

  2n 
0.54  0.46 cos  0nM
wn    M 
 0 else

Windowing
Blackman Window
• Large main lob
– 12/M
• Very good side lobs
– -57 dB
• Complex equation
ì æ 2p n ö æ 4p n ö
ï 0.42 - 0.5cos ç ÷ + 0.08cos ç ÷ 0£n£M
w [ n] = í è M ø è M ø
ï
î 0 else

Windowing
Kaiser Window Filter Design Method
• Parameterized equation forming a set of windows
• Parameter to change main-lob width and side-lob
area trade-off
  2
 I0  1   n  M / 2  
   M/2  
wn     0nM
 I0 

 0 else
• I0(.) represents zeroth-order modified Bessel

function of 1st kind
Windowing
•M+1= 21 and Different β

Windowing
•M+1= 21 and Different β

Windowing
•β=6 and Different M

Windowing
Determining Kaiser Window Parameters
•Given filter specifications Kaiser developed empirical equations
• Given the peak approximation error  or in dB as A=-
20log10 
• and transition band width
•The shape parameter  should be  s  p
 0.1102A  8.7 A  50

  0.5842A  21  0.07886A  21 21  A  50
0.4
 0 A  21

•The filter order M is determined approximately by
A8
M
2.285
Windowing
EXAMPLE: Kaiser Window Design of Low Pass Filter
• Specifications
w p = 0.4p , ws = 0.6p , d1 = 0.01, d2 = 0.001
• Window design methods assume
d = min(d1, d2 ) = min(0.01, 0.001) = 0.001
• Determine cut-off frequency
• Due to the symmetry we can choose it to be
wc = 0.5(w p + ws ) = 0.5(0.4p + 0.6p ) = 0.5p
• Compute
Dw = ws - w p = 0.6p - 0.4p = 0.2p
A  20 log10   60
Filter Design by Windowing
• And Kaiser window parameters
  5.653 M  37
• Then the impulse response is given as
  2
  n  18.5  
I0 5.653 1   
  18.5  
hn   sin0.5n  18.5   0nM
 n  18.5 I0 5.653
 0 else


Filter Design by Windowing
Approximation
Error

The Discrete Fourier Series
• Given a periodic sequence ~x[n] with period N so that
~
x[n]  ~
x[n  rN]
• The Fourier series representation can be written as
~ 1 ~
x[n]   Xk e j2  / Nkn
N k
• The Fourier series representation of continuous-time
periodic signals require infinite many complex
exponentials
• Not that for discrete-time periodic signals we have
e j2 / Nk mNn  e j2 / Nkne j2mn  e j2 / Nkn
• Due to the periodicity of the complex exponential we
only need N exponentials for discrete time Fourier
series
• A periodic sequence in terms of Fourier series
~ 1 N1 ~
Xk e
coefficients
x[n] 
N

j2  / N kn
k 0
• The Fourier series coefficients can be obtained via
~ N 1
~
Xk   
x[n]e  j2  / Nkn
n0
• For convenience we sometimes use
WN  e j2  / N
• Analysis equation
~ N 1
~
Xk    x[n]Wkn
N
n0
• Synthesis equation
~ 1 N1 ~
x[n]   Xk WNkn
N k 0

EXAMPLE
• DFS of a periodic impulse train
~

1 n  rN
x[n]   n  rN 
r   0 else

EXAMPLE
• DFS of a periodic impulse train
~

1 n  rN
x[n]   n  rN 
r   0 else
• Since the period of the signal is N
~ N 1 N 1
Xk    ~ x[n]e j2  / Nkn   [n]e  j2  / Nkn  e j2  / Nk 0  1
n0 n0
• We can represent the signal with the DFS coefficients

as ~

1 N1
x[n]   n  rN 
r  
 e
N k 0
j2  / N kn

EXAMPLE
• Duality in the Discrete Fourier Series

EXAMPLE
• Substituting DFS coefficients in synthesis equation

EXAMPLE
• DFS of an periodic rectangular pulse train
• The DFS coefficients
~ 1  e j2 / 10k5  j4 k / 10  sink / 2

4
Xk    e  j2  / 10 kn
  e
n0 1  e j2 / 10k sink / 10

EXAMPLE
• DFS of an periodic rectangular pulse train

Properties of DFS
• Linearity ~
x1 n DFS

~
X1 k 
~ ~
x n
2
DFS
  X2 k 
~ ~
a~
x1 n  b~
x2 n  aX1 k   bX2 k 
DFS

• Shift of Sequence
~ ~
x n DFS
 Xk 
~ ~
x n  m  e  j2km / NXk 
DFS

~
e j2 nm / N~
x n DFS
 Xk  m
• Duality
~ ~
x n  
DFS
 Xk 
~
Xn DFS
 N~
x  k 

Properties of DFS
Periodic Convolution
•Take two periodic sequences
~ ~
x1 n DFS  X1 k 

~ ~
x2 n DFS  X2 k 

•Let’s form the product
~ ~ ~
X3 k   X1 k X2 k 
•Periodic sequence with given DFS can be written as
N 1
~
x3 n  ~ ~
x
m0
m
 1 x2 n  m
•Periodic convolution is commutative
N 1
~
x3 n   ~ x2 m~
x1 n  m
m0

Properties of DFS
• Substitute periodic convolution into the DFS equation
~ 
N 1 N 1

X3 k      ~ x1[m]~
x2[n  m]WNkn
n0  m0 
• Interchange summations
~ N 1
~  N1 ~ 
X3 k    x1[m]  x2[n  m]WNkn 
m0  n0 
• The inner sum is the DFS of shifted sequence

km~
N 1
~
 2 N X2 k 
kn
x [n  m]WN  W
n0
~ N 1
~  N 1 ~ kn 
N 1
~ km~ ~ ~
X3 k    x1[m] 2
 x [n  m]WN   x1[m]WN X2 k  X1 k X2 k 
m0  n0  m0

Properties of DFS

Properties of DFS

Properties of DFS
• Symmetry Properties

DSP Lecture 13

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DSP Lecture 13

Uploaded by

Copyright:

Available Formats

DIGITAL SIGNAL PROCESSING

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

• Good side lobs

• Simpler than Blackman

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

• I0(.) represents zeroth-order modified Bessel

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

• We can represent the signal with the DFS coefficients

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

• The DFS coefficients

~ 1  e j2 / 10k5  j4 k / 10  sink / 2

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

• The inner sum is the DFS of shifted sequence

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

Muhammad Majid (m.majid@uettaxila.edu.pk) Digital Signal Processing

You might also like