Phan Tich Tinhieu Tren Mien Thoi Gian

CHAPTER
Discrete-Time Signals and

System
in the Time Domain
1
Company
Discrete-time signal
LOGO
Representation by a Sequence
• Discrete-time signal
 Concerned with processing signals that are
represented by sequences.
x  {x(n)},   n  
x  {x(2), x(1), x(0), x(1), x(2)},   n  
www.company.com
Company
LOGO
Representation by a Sequence
Example:

x(n)  1,1,2, 1, 1, 2, 2,2,1


n
1
x ( n)    ,n  0
2
x(n)
3 4 5 6 7 n
-8 -7 -6 -5 -4 -3 -2 -1 1 2 8 9 10
www.company.com
Company Discrete-time signal
LOGO
Important Sequences
• Unit-sample sequence (n)
 Sometime call (n)
a discrete-time impulse; or an impulse
1 ,n  0
 ( n)  
0 ,n  0
(n)
n
-8 -7 -6 -5 -4 -3 -2 -1 1 2 3 4 5 6 7 8 9 10
www.company.com
LOGO
Important Sequences
• Unit-step sequence u(n)
 Fact:
1 ,n  0
u ( n)  
(n)  u (n)  u (n  1)
0 ,n  0
u(n)
n
-8 -7 -6 -5 -4 -3 -2 -1 1 2 3 4 5 6 7 8 9 10
www.company.com
LOGO
Important Sequences
• Ramp signal r(n)
n ,n  0
r (n)  n.u (n)  
0 ,n  0
r(n)
n
0 1 2 3 4 5
www.company.com
LOGO
Important Sequences
• Real exponential sequence
n
x(n)  a
x(n)
...
... n
-8 -7 -6 -5 -4 -3 -2 -1 1 2 3 4 5 6 7 8 9 10
www.company.com
LOGO
Important Sequences
• Sinusoidal sequence
x(n)  A cos(n0  )
x(n)
www.company.com
LOGO
Important Sequences
• Periodic sequence
 A sequence x(n) is defined to be periodic with
period N if x(n)  x(n  N ) for all N
j0 n
x ( n)  e
x ( n )  e j 0 n  e j  0 ( n  N )  e j  0 N e j  0 n  x ( n  N
• Example: consider
• 2 k 2 must be a rational
 0 N  2 k N 
0 0 number
www.company.com
LOGO
Important Sequences
• periodic sequence:
www.company.com
LOGO
Energy of a sequence
• Energy of a sequence is defined by

 2
 x
  x ( n)
n  

x(n)  1,1,2, 1, 1, 2, 2,2,1


www.company.com
LOGO
Energy of a sequence
• Example: Find Energy of x(n)
• A. 
x( n)  1,1,2,  1, 0,1


2 2 2 2 2 2
Ex  1  1   2   1  0  1
n
1
• B. x ( n)    , n  0
2 2
n
1
1 2

Ex     
n0  2 
1
1
www.company.com
2
Company
LOGO Power of a Sequence
The average power of an aperiodic sequence
2
1 N
 lim . 
 x N  2 N  1 n   N x ( n )
www.company.com
Company
LOGO Power of a Sequence
The average power of a periodic sequence with a

period N
1 N 1
 x ( n)
2
x  N n 0
www.company.com
LOGO
Operations on Sequences
• The addition of two sequences
y (n)  x(n)  h(n)}
• The product of two sequences

y (n)  x(n).h(n)
• The multiplication of a sequence

www.company.com y (n)  A.x(n)
LOGO
• Time shifting y (n)  x(n  n0 )

n0  0 : delay of the sequence
n0  0 : advance of the sequence
• Time-reversal of a sequence x[n] y ( n)  x (  n)
• Time Scaling of a sequence x[n] y (n)  x(a.n)

n
www.company.com y (n)  x( )
a
LOGO
Sequence Representation Using delay unit

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  3)  a7 (n  7)

www.company.com
Company Discrete-Time Systems
LOGO
 A Discrete-Time System is a mathematical

operation that maps a given input sequence x[n]
into an output sequence y[n]
x(n) T[] y(n)=T[x(n)]
Mathematically modeled as a unique

transformation or operator.
www.company.com
LOGO
Characterize a System
x(n) h(n) x(n)*h(n)
www.company.com
LOGO
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)
www.company.com
LOGO
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.

www.company.com
LOGO
h1(n)
x(n) + y(n)
h2(n)
x(n) h1(n)+h2(n) y(n)
These two systems are identical.

www.company.com
LOGO
Example
x ( n)  u ( n)  u ( n  N )
n
a n0
h
(n) y(n)=?
0 1 2 3 4 5 6 0 n0
0 1 2 3 4 5 6
www.company.com
LOGO
Example

y ( n)  x ( n) * h( n)   x(k )h(n  k )
k  
n<N
 ( n 1) n 1
n n
1  a a  a
y (n)   a n  k a n  a  k a n 1

k 0 k 0 1 a 1  a 1
nN
N n n N
N 1 N 1
1  a a  a
y (n)   a n  k a n  a  k a n 1

k 0 k 0 1 a 1  a 1
www.company.com
LOGO
Example

y ( n)  x ( n ) * h( n)   x(k )h(n  k )
k  
5
4
n<N
 ( n 1) n 1
3 n n
1  a a  a
2 y (n)   a n  k a n  a  k a n 1

1
0
k 0 k 0 1 a 1  a 1
0 5 10 15 20 25 30 35 40 45 50
nN
N n n N
N 1 N 1
1  a a  a
y (n)   a n  k a n  a  k a n 1

k 0
www.company.com k 0 1 a 1  a 1
LOGO
Convolution
Direct form

y ( n)  x ( n) * h( n )   x(k )h(n  k )
k  
The causal filter FIR, order M: h = [h0 h1 h2 h3 … hM]
min(n , M )
y ( n)   hmxn  m
m  max(0 , n  L 1)
With n = 0, 1, …, L + M – 1
www.company.com
LOGO
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
www.company.com
LOGO
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
www.company.com How to computer y(n)?
Discrete-Time Systems
Company
LOGO
Convolution
Convolution table:
y ( n)   h(i) x( j )
i, j
i  j n
x0 x1 x2 x3 x4
h0 h0x0 h0x1 h0x2 h0x3 h0x4
www.company.com
Company
LOGO
Convolution
• Example : find convolution of y(n)= x(n)*h(n)

h(n) = [1, 2, -1, 1] và x(n) = [1, 1, 2, 1, 2, 2, 1, 1]
h x 1 1 2 1 2 2 1 1
1 1 1 2 1 2 2 1 1
2 2 2 4 2 4 4 2 2
-1 -1 -1 -2 -1 -2 -2 -1 -1
1 1 1 2 1 2 2 1 1
y = [1 3 3 5 3 7 4 3 3 0 1]
www.company.com
Company
LOGO
Convolution
LTI : Linear Time Invariant

y n    xm hn  m 
m
x = [x0 x1 x2 x3 x4 ]
or
x(n) = x0.(n) + x1. (n–1) + x2.(n–2) + x3.(n–3) + x4.(n-4)
y(n) = x0.h(n) + x1. h(n–1) + x2.h(n–2) + x3.h(n–3) + x4.h(n-4)
www.company.com
Company
LOGO
Convolution
h0` h1 h2 h3 h4
x0.h0 x0.h1 x0.h2 x0.h3 x0.h4
x1.h0 x1.h1 x1.h2 x1.h3 x1.h4
x2.h0 x2.h1 x2.h2 x2.h3 x2.h4
x3.h0 x3.h1 x3.h2 x3.h3 x3.h4
x4.h0 x4.h1 x4.h2 x4.h3 x4.h4
www.company.com
Company
LOGO
Convolution
Plot table
h0 h1 h2 h3 0 0 0 0
x0 x0h0 x0h1 x0h2 x0h3
yn y0 y1 y2 y3 y4 y5 y6 y7
www.company.com
Company
LOGO
Convolution
• Example: find convolution of y(n)= x(n)*h(n)

h(n) = [1, 2, -1, 1] và x(n) = [1, 1, 2, 1, 2]
1 2 -1 1 0 0 0 0
1 1 2 -1 1
1 1 2 -1 1
2 2 4 -2 2
1 1 2 -1 1
2 2 4 -2 2
yn 1 3 3 5 3 5 -1 2
www.company.com
Company
LOGO
Convolution
Flip and slide

yn = h0xn + h1xn-1 + … + hMxn-M
h3 h23 h123 h012 h01 h0 h3 h2 h1 h0 h3 h2 h1 h0
0 0 0 x0 x1 x2 … xn-3 xn-2 xn-1 xn xL-1 0 0 0
y0 y1 y2 yn yL-1+M
www.company.com
Company
LOGO
Convolution
Overlap-add block
- Khối dữ liệu vào x được chia thành các khối có chiều dài L.
L
x= Khối x0 Khối x1 Khối x2
ytemp
y0 = L+M
y1 = L+M
y2 = L+M
n=0 n=L n = 2L n = 3L
www.company.com
Company
LOGO
Convolution
• Example: find convolution of y(n)= x(n)*h(n)

x(n) = [1, 1, 2, 1, 2, 2, 1, 1] , h(n) = [1, 2, -1, 1] using Overlap-
add block, choose L = 3
x =[ 1, 1, 2, 1, 2, 2, 1, 1, 0 ]
www.company.com
Company
LOGO
Convolution
Block 0 Block 1 Block 2

h x 1 1 2 1 2 2 1 1 0
1 1 1 2 1 2 2 1 1 0
2 2 2 4 2 4 4 2 2 0
-1 -1 -1 -2 -1 -2 -2 -1 -1 0
1 1 1 2 1 2 2 1 1 0
n 0 1 2 3 4 5 6 7 8 9 10
y0 1 3 3 4 -1 2
y1 1 4 5 3 0 2
y2 1 3 1 0 1
y 1 3 3 5 3 7 4 3 3 0 1
www.company.com
Company
LOGO Block diagram representation of system
Addtion:
±
x1(n) x1(n) ± x2(n)
A constant multiplier: x2(n)
a
x(n) ax(n)
www.company.com
Company
A signal multiplier :
x1(n) x1(n). x2(n)
x2(n)
Square
x1(n) x1(n). x1(n)
www.company.com
Company
Unit delay
x(n) z-1 x(n-1)
x(n) z-k y(n)=x(n-k)
y(n)=x(n-2)
x(n) z-1 z-1
www.company.com
Company
Unit advance:
x(n) z1 x(n+1)
x(n) zk y(n)=x(n+k)
y(n)=x(n+2)
x(n) z1 z1
www.company.com
LOGO
Linear - Nonlinear
Linear (nonlinear) discrete-time system

x1(n) a
x(n)
H y(n)
x2(n) b
x1(n) y1(n) a
H
ay1(n)+by2(n)
x2(n) y2(n) b
H
www.company.com
LOGO
Linear - Nonlinear
Linear discrete-time system

y1[n] and y2[n] are the responses to the input sequences x1[n]
and x2[n],
x1(n)  y1(n),x2(n)  y2(n)
If an input x(n) = ax1(n) + bx2(n)
the response is given by  y(n) = ay1(n) + by2(n)
Example: Ideal Delay System y[n]  x[n  no ]
www.company.com
LOGO
Time invariant -Time varying
Time invariant (time varying) system

x(n) y(n)=T[x(n)]
T[]
x(n-k) y(n-k)
x(n) y(n)
x(n-1) y(n-1)
x(n-2) y(n-2)
www.company.com
LOGO
Time invariant (varying) system
Time invariant system

 A time shift at the input causes corresponding
time-shift at output x(n)  x1 (n  k )
y (n)  y1 (n  k )
www.company.com
LOGO
A linear time-invariant (LTI)
 A linear time-invariant (LTI)

• Satisfies
the linearity
the time-invariance
www.company.com
LOGO
Memoryless System
 A system is memoryless if the output y[n] at

every value of n depends only on the input x[n] at
the same value of n
 A system whose output depends on past values of
the input signal is said to have memory.
Example :
y[n]  x[n]
2
Square
• Ideal Delay System y[n]  x[n  no ]
www.company.com
LOGO
Stability
• Stable BIBO systems

 A system is said to be BIBO (bounded-input
bounded-output) stable if and only if the output
signal is bounded whenever the input signal is
bounded.
• If a bounded input produces an unbounded output,

the system is unstable.
www.company.com
LOGO
Stability
 Necessary and sufficient condition for a BIBO
 
S  | h( k ) |  
k  
www.company.com
LOGO
Causal - Anti-causal
• Causal systems --- output for y(n ) depends only on x(n)

0
with n n0.
 Or A system is causal if it’s output is a function of
only the current and previous samples
 A causal system whose impulse response h(n)
satisfies h(n)  0 for n  0
• Example: y(n)= x(n)-2x(n-1): causal system
y(n)= x(n)-2x(n+1): anti- causal
system
www.company.com
LOGO
Causal - Anti-causal
• Causal signal x(n)
-2 -1 0 1 2 3 4 5 n
• Anti-causal signal x(n)
-4 -3 -2 -1 0 1 2 3 n
www.company.com
LOGO
Causal - Stable
Example:
h(n) = (0.5)nu(n)
h(n) = -(0.5)nu(-n-1)
h(n) = 2nu(n)
h(n) = -2nu(-n-1)
www.company.com
LOGO
Recursive - Nonrecursive
 Recursive (Nonrecursive) system

The output system not only in terms of the
present and past values of the input but also in
terms of the already available past output values
 Example:
y(n)= x(n) -2x(n-1) +x(n+1) Recursive system
y(n)= x(n)- x(n-2) +y(n-1) Nonrecursive system
.
www.company.com
LOGO
FIR - IIR
 Finite Impulse Response system (FIR):

A finite impulse response (FIR) system if its
impulse response h[n] is of finite length.
Otherwise, it is an infinite impulse response (IIR)
system
 Example:
y(n) = 2x(n) + 4x(n – 1) – 5x(n – 2) + 7x(n – 3)
www.company.com
Company Linear Constant-Coefficient Difference
LOGO
Equations
Discrete-time LTI systems can be represented by

constant-coefficient linear difference equations.
N M
a
k 0
k y (n  k )  bk x( n  k )
k 0
N
ak M
bk
y ( n)    y ( n  k )   x ( n  k )
k 1 a0 k  0 a0
www.company.com
LOGO
Impulse Response
• Impulse Response
x(n)=(n) h(n)=T[(n)
T[] ]
0 0
0 0
www.company.com

Phan Tich Tinhieu Tren Mien Thoi Gian

Uploaded by

Document Information

Original Description:

Original Title

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

Phan Tich Tinhieu Tren Mien Thoi Gian

Uploaded by

Copyright:

Available Formats

CHAPTER

Discrete-Time Signals and

x  {x(2), x(1), x(0), x(1), x(2)},   n  

• Energy of a sequence is defined by

The average power of an aperiodic sequence

The average power of a periodic sequence with a

• The product of two sequences

• The multiplication of a sequence

• Time shifting y (n)  x(n  n0 )

n0  0 : advance of the sequence

• Time-reversal of a sequence x[n] y ( n)  x (  n)

• Time Scaling of a sequence x[n] y (n)  x(a.n)

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

 A Discrete-Time System is a mathematical

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

Mathematically modeled as a unique

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

Properties of Convolution Math

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.

Properties of Convolution Math

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

These two systems are identical.

The causal filter FIR, order M: h = [h0 h1 h2 h3 … hM]

• Example : find convolution of y(n)= x(n)*h(n)

LTI : Linear Time Invariant

y(n) = x0.h(n) + x1. h(n–1) + x2.h(n–2) + x3.h(n–3) + x4.h(n-4)

x0.h0 x0.h1 x0.h2 x0.h3 x0.h4

x1.h0 x1.h1 x1.h2 x1.h3 x1.h4

x2.h0 x2.h1 x2.h2 x2.h3 x2.h4

x3.h0 x3.h1 x3.h2 x3.h3 x3.h4

x4.h0 x4.h1 x4.h2 x4.h3 x4.h4

• Example: find convolution of y(n)= x(n)*h(n)

Flip and slide

h3 h23 h123 h012 h01 h0 h3 h2 h1 h0 h3 h2 h1 h0

0 0 0 x0 x1 x2 … xn-3 xn-2 xn-1 xn xL-1 0 0 0

x= Khối x0 Khối x1 Khối x2

• Example: find convolution of y(n)= x(n)*h(n)

Block 0 Block 1 Block 2

A constant multiplier: x2(n)

x(n) z-k y(n)=x(n-k)

Linear (nonlinear) discrete-time system

Linear discrete-time system

Example: Ideal Delay System y[n]  x[n  no ]

Time invariant (time varying) system

Time invariant system

 A linear time-invariant (LTI)

 A system is memoryless if the output y[n] at

• Stable BIBO systems

• If a bounded input produces an unbounded output,

 Necessary and sufficient condition for a BIBO

• Causal systems --- output for y(n ) depends only on x(n)

• Causal signal x(n)

• Anti-causal signal x(n)

 Recursive (Nonrecursive) system

 Finite Impulse Response system (FIR):

Discrete-time LTI systems can be represented by

You might also like