2/7/2020

Comment on periodicity

EEE F434 –Digital Signal Processing

cos (πn/4)
Lecture session 4 to 7

cos (4πn/17)
Dr. Sarang Dhongdi

cos (0.8n)

Find period of the signal if it is

Sinusoids
periodic

Continuous time sinusoidal signals

• Period of sinusoidal signals can take on any value; integral,
fractional, or even irrational

Discrete time sinusoidal signal

• Period must be an integer (in terms of n)
• i.e. the signal is periodic only if ω is 2π times some rational
number

Even, odd signals Energy and power signals

1
 2/7/2020

Energy and power calculations Operations on signals

2
 2/7/2020

Review of systems

System properties Properties of system

 Linear and Non linear system
 Linearity y (n)  nx(n)
 Time variant and Time Invariant Sys y (n)  x(n)   1 
 x(n  1)
 Static and Dynamic systems

 Causal and Non-causal system

 Time Variance
y (n)  nx(n)
 Stable and Unstable system y (n)  x 2 (n  1)

Properties of system Signals

Static and Dynamic y (n)  nx (n)

  A signal/sequence can be represented as the linear
y (n)  y (n  1)  x(n) combination of shifted impulses
x( n)  ...  x( 3) (n  3)  x( 2) ( n  2)  x( 1) ( n  1)
Causal and y (n)  nx (n)  x(n  1)
  x (0) ( n)  x(1) (n  1)  x ( 2) ( n  2)  ...
Non-causal system y (n)  x (n  1)  x (n)


 Stable and unstable

y (n)  x (n  nd ) x ( n)   x(k ) (n  k )
k  
n
y ( n)  
k 
x[k ]

3
 2/7/2020

System Properties of LTI System

 Commutative property
 Response y[n] of a system to any arbitrary i/p is given
as    x ( n )  h ( n)  h ( n )  x ( n )
y (n)  T {x(n)}  T   x (k ) (n  k )
 k     Distributive property
 x(n)  h1 (n)  h2 (n)  x(n)  h1 (n)  x(n)  h2 (n)
y (n)  T {x(n)}   x(k )T  (n  k )
k    Associative property

x ( n)  h1 ( n)  h2 ( n)    x( n)  h1 (n)   h2 ( n)
y ( n)   x ( k ) h( n  k )
k  

System interconnections Properties of system

x(n)
Series connection
y (n)
h1 (n) h2 (n)  Causal and Non-causal system
h ( n)  0 for n  0

Parallel connection
y (n)   h( k ) x ( n  k )
x(n) h1 (n) y (n) k 0

h2 (n)  Stable and unstable  h(k )  

k  

Impulse Response Properties of system

 If h(n) is non-zero for n=0 to n =N-1, then FIR
 Causal and Non-causal system
N 1
h ( n)  0 for n  0
y ( n)   h(k ) x ( n  k )

y (n)   h( k ) x ( n  k )
k 0

 If h(n) is non-zero for n>0, then IIR k 0

 
y (n)   h(k ) x(n  k )
k 0
 Stable and unstable  h(k )  
k  

4
 2/7/2020

Impulse Response LCCDE Linear Constant coefficient difference equation

 If h(n) is non-zero for n=0 to n =N-1, then FIR  Recursive equation

N M

N 1  ak y(n  k )   bk x(n  k )
y ( n)   h(k ) x ( n  k ) k 0 k 0
N M
k 0
a0 y (n)  a
k 1
k y (n  k )  b
k 0
k x (n  k )
 If h(n) is non-zero for n>0, then IIR
1 M N

y(n)    bk x ( n  k )  a k y (n  k )
 a0  k 0 k 1 
y (n)   h(k ) x(n  k )
k 0 y (n)  x(n)  a1 y (n  1)  a2 y (n  2)

System Representations blocks

 Non Recursive equation x1 (n)
y (n)  x1 (n) x2 (n)
M
bk
y ( n)   x (n  k ) x2 ( n )
Product / Modulation

k  0 a0

y ( n)  1.2 x( n)  0.8 x( n  1)  0.5 x(n  2) x1 (n)

y (n)  x1 (n)  x2 (n)
Summation
x2 ( n )

System Representations blocks Schematic Diagram

y (n)  b0 x(n)  b1 x( n  1)  b2 x (n  2)  a0 y ( n  1)  a1 y (n  2)
x(n) y (n)  Ax(n)
A x(n) y (n)
Scalar Multiplication b0

x (n) y (n)  x(n  1)

Z 1 Z 1
Z 1 Unit Delay y ( n  1)
x( n  1) b1 a0

x(n) x(n)
Z 1 Z 1
Pick-off node
b2 a1 y ( n  2)
x ( n  2)

5
 2/7/2020

Examples of Discrete time systems Examples of Discrete time systems

Accumulator n Recursive or Non-  Taking average on M-point for noise corrupted signal –
 x(l )

y ( n)  recursive?

l    Moving Average filter

y ( n )  y ( n  1)  x ( n ) Recursive or Non-
recursive? x(n)  s(n)  d (n) s(n) – data sample
d(n) – Noise sample

1 n From signal x[n], if we take M-point average (or mean), we can get
y (n)   x(l )   x(l )
l   l 0
reasonably good estimate of uncorrupted signal

M 1
n 1
y (n)  y (1)   x(l )  x(n  l )
Recursive or Non-
n0 y (n)  recursive?

l 0
M l 0

Examples of Discrete time systems

 Moving Average Filter -Simplification Examples of Discrete time systems

1  M 1   Exponentially weighted running average filter

y (n)    x(n  l )  x(n  M )  x(n  M )
M  l 0 
y ( n )   ( y ( n  1))  x ( n ) 0  1
1  M 
y (n)   x(n  l )  x (n )  x(n  M )
M  l 1
y ( n )    y ( n  2)  x ( n  1)   x ( n )


1  M 1

y (n)    x (n  1  l )  x (n )  x (n  M )
M  l0  y ( n )   2 y ( n  2 )   x ( n  1)  x ( n )
1
y ( n )  y ( n  1)  x ( n )  x (n  M ) y ( n )   3 y ( n  3)   2 x ( n  2 )   x ( n  1)  x ( n )
M

Examples of Discrete time systems Examples of Discrete time systems

 Linear Interpolator  Median Filter

x (n ) L y (n ) Median of (2,-3,10,5,-1)

y (n)  x( n ) FIR system  Algorithm

L
 Consider a finite length sequence of length N (0 to N-1)
x(n) = {0, 1 , 5, 10} Interpolate by L=2  And a median filter of length M (M<N, Windowing)
Fill in the (L-1) zeros = y(n) = {0,0,1,0,5,0,10}  Append (M-1)/2 zero valued samples at both ends of x(n)

Fill the places by values obtained by interpolation  Output y(n) will be of length N

1
y ( n )  xu ( n )  xu ( n  1)  xu ( n  1) 
2