Review of discrete time systems

Dr Malaya Kumar Hota (Prof., SENSE, VIT University)

Discrete-Time Systems

x(n) T[] y(n)=T[x(n)]

Mathematically modeled as a unique

transformation or operator.

DR. MALAYA KUMAR HOTA (PROF., SENSE) 2

Classification of Discrete-Time
Systems
Static versus Dynamic Systems

Time-invariance versus Time-variant Systems

Linear versus Non-linear Systems

Causal versus Non-causal Systems

Stable versus Unstable Systems

Recursive versus Non-recursive Systems

DR. MALAYA KUMAR HOTA (PROF., SENSE) 3

Static versus Dynamic Systems
 Static or memoryless system: A discrete time system is
called static if its output at any specific time depends on
the input at that particular time, but not on past or future
value of the input. E.g.: y (n)  nx(n)  bx3 (n)
 Dynamic system or system with memory: The output of
the dynamic system at any specific time depend on the
inputs at that specific time & at other times. E.g.,
n
y ( n)   x ( n  k )
k 0
DR. MALAYA KUMAR HOTA (PROF., SENSE) 4
Time-invariance versus Time-variant
Systems
x(n) y(n)=T[x(n)]
T[]

x(n-k) y(n-k)

A time invariant system is one whose input-output

relationship does not vary with time. A time invariant
system is also called a fixed system.

DR. MALAYA KUMAR HOTA (PROF., SENSE) 5

Time-invariance versus Time-variant
Systems
Differentiator: y(n)  x(n)  x(n  1)
x ( n) 
 x(n)  x(n  1)
T

x( n  k ) 
 x(n  k )  x(n  k  1) ..... (1)
T

y (n  k )  x(n  k )  x(n  k  1) ..... (2)

replace n by n  k
eq (1)  eq (2)
n n

This system is time invariant.

DR. MALAYA KUMAR HOTA (PROF., SENSE) 6
Time-invariance versus Time-variant
Systems
Time Multiplier: y ( n)  n x ( n)
x ( n) 
 n x(n)
T

x(n  k ) 
 n x(n  k ) ..... (1)
T

y (n  k )  (n  k ) x(n  k ) ..... (2)

replace n by n  k
eq (1)  eq (2)
n n

This system is time variant.

DR. MALAYA KUMAR HOTA (PROF., SENSE) 7
Linear versus Non-linear Systems
A system is linear if it satisfies superposition principle i.e.,

T[a1 x1 (n)  a2 x2 (n)]  a1T [ x1 (n)]  a2T [ x2 (n)]

DR. MALAYA KUMAR HOTA (PROF., SENSE) 8

 Linear versus Non-linear Systems
Time Multiplier: y ( n)  n x ( n)
T [a1 x1 (n)  a2 x2 (n)]  n [a1 x1 (n)  a2 x2 (n)]
 a1nx1 (n)  a2 nx2 (n) ..... (1)
a1T [ x1 (n)]  a2T [ x2 (n)]  a1 y1 (n)  a2 y2 (n)
 a1nx1 (n)  a2 nx2 (n) ..... (2)

eq (1)  eq (2)
n n

This system is Linear.

DR. MALAYA KUMAR HOTA (PROF., SENSE) 9
 Linear versus Non-linear Systems
y ( n )  x ( n) 2

T [a1 x1 (n)  a2 x2 (n)]  [a1 x1 (n)  a2 x2 (n)]2

 a1 x1 (n)  a2 x2 (n) 2  2 a1a2 x1 (n) x2 (n) ..... (1)
2 2 2

a1T [ x1 (n)]  a2T [ x2 (n)]  a1 y1 (n)  a2 y2 (n)

 a1 x1 (n)  a2 x2 (n) ..... (2)
2 2

eq (1)  eq (2)
n n

This system is non-linear.

DR. MALAYA KUMAR HOTA (PROF., SENSE) 10
Causal versus Non-causal Systems
A system is said to be causal if the o/p of the system at
any time n [i.e.,y(n)] depends on present i/p, past i/ps &
past o/ps [i.e., x(n), x(n-1), x(n-2),…, y(n-1), y(n-2),…],
but does not depend on future i/ps [x(n+1), x(n+2),…] &
future o/ps [y(n+1), y(n+2),…].
A causal system is physically realizable for real time
signal processing applications.

DR. MALAYA KUMAR HOTA (PROF., SENSE) 11

 Causal versus Non-causal Systems
n
y ( n)   x(k )
k  
Causal

y ( n)  x ( n 2 ) Noncausal y (2)  x(22 )  x(4)

y(n)  x(n) Noncausal y(2)  x(2)

DR. MALAYA KUMAR HOTA (PROF., SENSE) 12

Stable versus Unstable Systems
A system is said to be bounded i/p bounded o/p (BIBO)
stable, if & only if every bounded i/p produces a bounded
o/p.

DR. MALAYA KUMAR HOTA (PROF., SENSE) 13

Recursive versus Non-recursive
Systems
A causal or practically realizable discrete time system is
called recursive if its o/p at any specific time depends on
the past value of the o/p. E.g.,
y(n)  x(n)  0.5 y(n  1)
A causal or practically realizable discrete time system is
called non-recursive if its o/p at any specific time depends
only on the present & past value of the i/p. E.g.,
y(n)  x(n)  0.75 x(n  1)

DR. MALAYA KUMAR HOTA (PROF., SENSE) 14

Representation of general sequence as a
linear combination of delayed impulse

x ( n)   x ( k ) ( n  k )
k  

x(n)
a-3
a1
2 7 n
-8 -7 -6 -5 -4 -3 -2 -1 1 3 4 5 6 8 9 10

a2 a7

x(n)  a3 (n  3)  a1 (n  1)  a2 (n  2)  a7 (n  7)

DR. MALAYA KUMAR HOTA (PROF., SENSE) 15

Impulse Response
x(n)=(n) h(n)=T[(n)]
T[]

0 0

x(n)=(n-k) h(n-k)=T[(n-k)]

0 0

DR. MALAYA KUMAR HOTA (PROF., SENSE) 16

 Convolution

xn   xk  n  k   n h n
k  
 n  k  h n  k 
   
y  n   T   x  k   n  k    x  k T   n  k 
 k   k 

  x k  h n  k   x n  h n
k 
convolution
A LTI system is completely characterized by its impulse response.

DR. MALAYA KUMAR HOTA (PROF., SENSE) 17

Characterize a System

x(n) h(n) x(n)*h(n)

DR. MALAYA KUMAR HOTA (PROF., SENSE) 18

Properties of Convolution Math

y ( n)   x(k )h(n  k )  x(n) * h(n)
k  


y ( n)   h( k ) x ( n  k )  h( n) * x ( n)
k  

x(n) * h(n)  h(n) * x(n)

DR. MALAYA KUMAR HOTA (PROF., SENSE) 19

Properties of Convolution Math

x(n) h1(n) h2(n) y(n)

x(n) h2(n) h1(n) y(n)

x(n) h1(n)*h2(n) y(n)

These systems are identical.

DR. MALAYA KUMAR HOTA (PROF., SENSE) 20

Properties of Convolution Math
h1(n)

x(n) + y(n)
h2(n)

x(n) h1(n)+h2(n) y(n)

These two systems are identical.

DR. MALAYA KUMAR HOTA (PROF., SENSE) 21

Example
x(n)  u (n)  u(n  N )

a n n0
h( n)   y(n)=?
0 n0
0 1 2 3 4 5 6

0 1 2 3 4 5 6

DR. MALAYA KUMAR HOTA (PROF., SENSE) 22

Example

y ( n)  x ( n) * h( n)   x(k )h(n  k )
k  

x(k)
k
0 1 2 3 4 5 6

h(k) k
0 1 2 3 4 5 6

h(0k) k
0 1 2 3 4 5 6

DR. MALAYA KUMAR HOTA (PROF., SENSE) 23

Example

y ( n)  x ( n) * h( n)   x(k )h(n  k )
k  

x(k)
k
0 1 2 3 4 5 6
compute y(0)
h(0k) k
0 1 2 3 4 5 6
compute y(1)
h(1k) k
0 1 2 3 4 5 6

DR. MALAYA KUMAR HOTA (PROF., SENSE) 24

Example Three conditions have to be considered.


y ( n)  x ( n) * h( n)   x(k )h(n  k )
k  

x(k)
k
0 1 2 3 4 5 6
compute y(0)
h(0k) k
0 1 2 3 4 5 6
compute y(1)
h(1k) k
0 1 2 3 4 5 6
How to computer y(n)?

DR. MALAYA KUMAR HOTA (PROF., SENSE) 25

Example

y ( n)  x ( n) * h( n)   x(k )h(n  k )
k  

For n  0, y ( n)  0
For 0  n  N  1,
 ( n 1) 1
n n
1  a a n
 a
y (n)   a n  k a n  a  k a n 1

k 0 k 0 1 a 1  a 1
For n  N  1 or n  N ,
N n N
N 1 N 1
1  a a n
 a
y (n)   a n  k a n  a  k a n 1

k 0 k 0 1 a 1  a 1
DR. MALAYA KUMAR HOTA (PROF., SENSE) 26
Example

 0 , n0
 a n  a 1
y ( n)   1
, 0  n  N 1
1
 n  a
n N
 a  a
, n  N 1
 1  a 1
5
4
3
2
1
0
0 5 10 15 20 25 30 35 40 45 50

DR. MALAYA KUMAR HOTA (PROF., SENSE) 27

Example
Determine the impulse response for the cascade of two LTI
systems having impulse responses
n n
1 1
h1 (n)    u (n) h2 (n)    u (n)
2 4

x(n) h1(n) h2(n) y(n)

x(n) h(n)=h1(n)*h2(n) y(n)

DR. MALAYA KUMAR HOTA (PROF., SENSE) 28

Example

h(n)  h1 (n) * h2 (n)   h (k )h (n  k )
k  
1 2

 k nk u(k)
1 1
    u (k )  u (n  k )
k    2  4 -1 0 1 2 3 k
u(n-k)
h( n)  0 for n0
n k
k nk
n
1 1
For n  0, h( n)      
k 0  2   4 

DR. MALAYA KUMAR HOTA (PROF., SENSE) 29

 Example
k nk n n k k n n k
n
1 1 1 1 1 1 1
h( n)                   4
k

k 0  2   4  4 k 0  2   4  4 k 0  2 

 1  2 n 1 
n n k n n n
1 4 1 1
        2   
k
 
4 k 0  2  4 k 0 4  1 2 
n
 1  n 1
   2 1   for n0
4
n
 1  n 1

h( n)    2  1 u ( n) ;  for all n
4

DR. MALAYA KUMAR HOTA (PROF., SENSE) 30

Example
Determine the linear convolution
x(n)  1 2 3 4 h(n)  1 2 1 2
y ( n)  x ( n) * h( n) Length of y (n)  4  4  1  7

DR. MALAYA KUMAR HOTA (PROF., SENSE) 31