CHNG 2:

H THNG V TN HIU THI GIAN RI

RC

Tn hiu thi gian ri rc

H thng thi gian ri rc

Tch chp ri rc

Tn hiu thi gian ri rc

(discrete-time signal)

1. Biu din tn hiu thi gian ri rc

2. Tn hiu thi gian ri rc c bn
3. Php x l c bn
4. c im tn hiu thi gian ri rc

Tn hiu ly mu (Sampled signals)

Chuyn i mt tn hiu lin tc (thi gian lin tc) thnh tn hiu ri

rc (thi gian ri rc) bng cch ly mu: xa(t) tn hiu lin tc,
xa(nT) l tn hiu ri rc t xa(t) ti t = nT tn hiu ri rc ch xc
nh vi n nguyn

t
-2T -T

x a (t )

t nT

2T

3T

4T

5T

6T

7T . . .

nT

x a (nT) x (n ), n

Biu din tn hiu ri rc

1. Dng hm

1, n 1,3

x[n ] 4, n 2
0, n

2. Dng bng
n

-1

x[n]

Representations of DT signals

3. Dng dy

x[n] 0 , 1 , 4 , 1

4. Dng hnh hc

1
-1

0 1

1
2

3 4 5

1. Biu din tn hiu thi gian ri rc

2. Tn hiu thi gian ri rc c bn
3. Php x l c bn
4. c im tn hiu thi gian ri rc

Tn hiu ri rc c bn

1. Dy bc n v (Unit step sequence)

2. Xung n v (Unit impulse signal)
3. Tn hiu hnh sin (Sinusoidal signal)
4. Tn hiu hm m (Exponential signal)

Bc n v
1 n 0
u[n]
0 n 0
1

-1

0 1

3 4 5 6

Bc n v dch chuyn trong min

thi gian (Time-shifted unit step)
1, n n 0
u[n n 0 ]
0, n n 0
For n0 > 0
1

-n0-1 n0 n0+1

1, n n 0
u[n n 0 ]
0, n n 0
Vi n0 < 0

-n0-1 n0 n0+1

Xung n v
1 n 0
[ n]
0 n 0

-2

-1 0

Xung n v dch trong min

thi gian
1, n n 0
[n n 0 ]
0, n n 0
Vi n0 > 0

n0-1 n0 n0+1

1, n n 0
[n n 0 ]
0, n n 0

n0-1 n0 n0+1

Quan h gia xung n v v

bc n v

u[n ]

[k ]

[n ] u[n ] u[n 1]
x[n ][n n 0 ] x[n 0 ][n n 0 ]

x[n ][n n

] x[n 0 ]

Tn hiu hnh sin

x (n ) A cos( n ), n
A cos(2Fn ), n
1.5

0.5

-0.5

-1

-1.5
-20

-15

-10

-5

10

15

20

Tn hiu hm m

x[n] Ca n
1. Nu C v a l s thc th x[n] l hm m thc

a > 1 tng
0 < a < 1 gim
-1 < a < 0
a < -1
2. Nu C v a l s phc th x[n] l hm m phc

V d
x[n] (0.2)(1.2) n
120

100

Amplitude

80

60

40

20

10

15
20
Time index n

25

30

35

V d v hm m phc
x[n] 2e

1
j n
12 6

Real part
2
1
0
-1
-2

10

15

20

25

30

35

40

25

30

35

40

Imaginary part
2

-1

10

15

20

Tn hiu hm m tun hon

Tn hiu hnh sin ri rc ch tun hon nu tn s

ca n c dng phn s (rational number)

Xt tn hiu m phc:

x[n] Ce j0n C cos(0n) j sin(0n)

Tn hiu ny tun hon nu :

k
F0
N

or

0
k

2 N

Chu k c bn (fundamental period )

Chu k c bn c tnh nh sau:

k 2
N
0

vi k l s nguyn nh nht N l s nguyn

0 c phi l phn s?
Bc 1:
2
Bc 2: nu ng th tn hiu ny tun hon:

0 k
# cycles

2 N # po int s

V d
Tn hiu sau c tun hon khng ? Nu c, xc nh chu k
c bn

x1[n] e

j n
6

x3[n] cos(2n )

x2 [n] sin n 1
5

x4 [n] cos(1.2n)

1. Representations of DT signals

2. Some elementary DT signals

3. Nhng php ton c bn

4. Classification of DT signals

Nhng php ton c bn

Adding and subtracting signals (cng, tr)

Transformation of time: (bin i trc thi gian)

- Time shifting (dch)

- Time scaling (t l)
- Time reversal (o ngc)

Transformation of amplitude: (bin i bin )

- Amplitude shifting
- Amplitude scaling
- Amplitude reversal

Cng v tr tn hiu

Thc hin theo tng im (point)

V d: x[n] = u[n] u[n-4]

Dch trong min thi gian

x[n] x[n - k]; k l s nguyn

k > 0: dch x[n] sang phi k mu (delay

of signal)

k < 0: dch x[n] sang tri |k| mu

(advance of signal)

V d
x[n]

-1

0 1

x[n-2]

-1

3 4

0 1

3 4

x[n]

-1

x[n+1]

0 1

3 4

3 4

4
1

-1

0 1

T l (scaling)
x[n] y[n] = x[an]

|a| > 1: speed up vi h s a, a l s

nguyn
|a| < 1: slow down vi h s
a = 1/K; K l s nguyn

V d
x[n]

-1

x[2n]

0 1

3 4

x[2n+1]

-1

-1

Cho x[n]

2
1

-7

-6

-5

-4

-3

Tm w1[n] = x[2n]

Tm w1[n/2]?

-2

-1

Cho x[n]

2
1

-7

-6

-5

-4

-3

-2

Tm w2[n] = x[2n+1]

Tm w2[n/2]?

-1

o chiu thi gian

x[n] x[-n]

i xng qua trc tung

V d
x[n]

-1

x[-n]

0 1

3 4

3 4

4
1

-3 -2 -1 0 1

Kt hp dch v o chiu

x[n] y[n] = x[-n-k]

Phng php 1: i xng ri dch

Phng php 2: dch ri i xng

Phng php 1

x[n] y[n] = x[-n-k]

P/p 1: i xng ri dch

Ex. Tm y[n] = x[-n-2] = x[-(n+2)]

x[n]

i xng

x[-n] = w[n]

w[n+2] = x[-(n+2)]
Dch

x[n]
-1

Phng php 2

x[n] y[n] = x[-n-k]

pp 2: dch ri i xng
Ex. Tm y[n] = x[-n-2] = x[-(n+2)]

x[n]

Dch

x[n+2] = w[m]

w[-m] = x[-(n+2)]
i xng

x[n]
1

-1

Combining time shifting and time scaling

x[n] y[n] = x[an-b]

Method 1: time scale then shift

Method 2: shift then time scale
Be careful!!! For some cases, method 1 or 2 doesnt work.
To make sure, plug values into the table to check

Example Method 1
x[n] y[n] = x[an-b]

Method 1: time scale then shift

Ex. Find y[n] = x[2-2n]

y[n] = x[-2(n-1)]
x[n]

x[-2n] = w[n]

Time scale
by -2

Delay
by 1

w[n-1] = x[-2(n-1)]

Example
Method 1

x[n]
-1

Example Method 2
x[n] y[n] = x[an-b]

Method 2: shift then time scale

Ex. Find y[n] = x[2-2n]

y[n] = x[-2(n-1)]
x[n]

Delay
by 1

x[n-1] = w[m]

Time
scale
by -2

w[-2m] = x[-2(n-1)]

x[n]

Example
Method 2

-1

Exercise

Find x[n] (u[n 1] u[n 5])(nu[2 n])

1. Representations of DT signals
2. Some elementary DT signals
3. Simple manipulations of DT signals

4. c im ca tn hiu ri rc

c im ca tn hiu ri rc

Tn hiu chn (even), tn hiu l (odd)

Tn hiu nng lng (energy signal), tn hiu
cng sut (power signal)

Tn hiu chn v tn hiu l

xe[n] l tn hiu chn nu

Even xe [n] xe [n]

xo[n] l tn hiu l nu

Odd xo [n] xo [n]

Mi tn hiu u c th biu din bng tng ca mt tn

hiu chn v mt tn hiu l:

xe [n] 12 ( x[n] x[n])

xo [n] 12 ( x[n] x[n])

x[n] xe [n] xo [n]

Cch tm xe[n] v xo[n] t x[n]?

Bc 1: tm x[-n]

Bc 2: tm

xe [n] 12 ( x[n] x[n])

Bc 3: tm

xo [n] 12 ( x[n] x[n])

V d

Cho x[n]

2
1

-4

-3

-2

-1

Tm x[-n]
2
1

-6

-5

-4

-3

-2

-1

Tnh x[n] + x[-n]

2
1

-4

-3

-2

-1

Tn hiu cng sut v tn hiu

nng lng

Nng lng ca tn hiu:

x[n]

N
1
2
P lim
x
[
n
]

N 2 N 1
n N

Cng sut ca tn hiu:

Nu E hu hn x[n] l tn hiu nng lng

E hu hn P = 0

E v hn P c th hu hn hay v hn. Nu P hu hn
v khc khng x[n] l tn hiu cng sut

V d

Tn hiu di y l cng sut hay nng lng?

(a) bc n v (Unit step)

1 n 0
u[n]
0 n 0

Unit step is a power signal

(b)

(1 / 2) , n 0
x[n ] n

(2) , n 0

n0

if | a | 1

n
a 1 a

n n0

if | a | 1

x[n] is an energy signal


(c) x[n ] cos n (u[n ] u[n 4])
4

2
2
cos n 0 n 3
x[n ] 4
[n ]
[n 1]
[n 3]
2
2
0
otherwise

x[n] is an energy signal

H thng ri rc

1. H thng ri rc
2. c im ca h thng ri rc

Quan h vo ra ca h thng ri rc

K hiu: y[n] = T{x[n]} y[n] l p ng ca h thng T

vi kch thch x[n]
H thng c th xem nh hp en (black box)

x[n]

DT system
T{}

y[n]

V d h thng ri rc
B lc thng thp:
y[n] = 1/5{x[n]+x[n-1]+x[n-2]+x[n-3]+x[n-4]}
1

Trc khi lc
0.5

20

40

60

80

100

120

20

40

60

80

100

120

0.8

Sau khi lc

0.6
0.4
0.2
0

Tng hp h thng ri rc

x[n]
Song song

System1
T1 { }

y[n]

System2
T2 { }

y[n] = y1[n] + y2[n] = T1{x[n]} + T2{x[n]} = (T1 + T2){x[n]}

= T{x[n]}
y[n] = T{x[n]}: h thng ton phn

x[n]

System1
T1{ }

System2
T2 { }

Ni tip

y[n] = T2{y1[n]} = T2{T1{x[n]}} = T{x[n]}

y[n] = T{x[n]}

y[n]

V d
1

y3[n]

x[n]

y2[n]

y4[n]
y[n]

1. H thng ri rc
2. c im ca h thng ri rc

c im
C nh (Memory)
o ngc (Invertibility)
Nhn qu (Causality)
n nh (Stability)

Tuyn tnh (Linearity)

Bt bin thi gian (Time-invariance)

C nh

y[n0] = f(x[n0]) h thng khng c nh (memoryless)

Ngc li, ta c h thng c nh (memory), ngha l u ra
c ph thuc vo u vo ti cc thi im khc vi thi
im hin ti.

Ex:

a) y[n] = x[n] + 5: khng nh

b) y[n]=(n+5)x[n]: khng nh

c) y[n]=x[n+5]: c nh

o ngc (Invertibility)

Mt h thng c xem l o ngc c nu

vi nhng u vo khc nhau s cho u ra khc
nhau
Ex.: y[n] = |x[n]| khng o ngc c

x[n]

x[n]
T()
System

Ti()
Inverse system

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

V d
Cc h thng di y c th o ngc c khng ?
a) y[n] = x[n+1]

b) y[n]

x[k ]

c) y[n] = |x[n]|

Nhn qu

u ra ti mi thi im ca mt h thng nhn qu

khng ph thuc vo u vo trong tng lai.

Tt c cc h thng khng nh u l nhn qu

H thng nhn qu c th c nh hoc khng.

V d
Xt tnh nhn qu ca cc tn hiu sau:

a) y[n] = x[-n]
b) y[n] = (n+1)x[n-1]

c) y[n] = x[(n-1)2]
d) y[n] = cos(w0n+x[n])
e) y[n] = 0.5y[n-1] + x[n-1]

n nh

BIBO stability: bounded input bounded output

tn hiu vo hu hn th to ra tn hiu ra hu hn
Nu u vo hu hn m u ra v hn th h thng
c gi l khng n nh.

V d
Xc nh h thng sau c n nh khng ?
a) y[n] = x[n-1]
b) y[n] = cos(x[n])
c) y[n] = ln(x[n])

d) y[n] =exp(x[n])

Tuyn tnh

H thng T c xem l tuyn tnh nu tha mn tnh cht sau:

Nu T(x1[n]) = y1[n] v T(x2[n]) = y2[n]

th T(ax1[n] + bx2[n]) = ay1[n] + by2[n]

Bt bin thi gian

nu T(x[n]) = y[n]
th T(x[n-n0]) = y[n-n0]

p ng/Hot ng ca h thng khng thay i theo thi gian

V d v tuyn tnh v bt bin thi

gian
Xc nh tnh tuyn tnh v bt bin thi gian ca cc h thng
sau:

a) y[n] nx[n]
2
b) y[n] x [n]

c)

y[n] br x[n r ]
r 0

V d v cc c im ca h thng ri rc
Xt cc c im ca h thng:

n 2.5
y[ n ]
x[n ]

n 1.5
2

a) It is memoryless
b) It is invertible its inverse system is:

c) It is causal

n 2.5
n 1.5

d) It is stable
For |x[n]| M then |y[n]|

100

200

300

400

500

600

700

800

900

1000

d) For n = 0 y[0] = 2.778x[0]

For n = -1 y[-1] = 9x[-1]

not time invariant

e) Superposition linear

n 2.5
a1 x1[n] a2 x2 [n]
a1 x1[n ] a2 x2 [n ]

n 1.5
2

n 2.5
n 2.5
a1
x1[n ] a2
x2 [ n ]

n 1.5
n 1.5
a1 y1[n ] a2 y2 [n ]
2

Tch chp

1. Cng thc tch chp

2. Tnh cht
3. Thc hin tnh tch chp
4. Tnh cht h thng LTI thng qua p ng
xung

Cng thc tch chp

Tch chp (Convolution): l php ton gia tn hiu vo v

p ng xung ca mt h thng v cho kt qu u ra

x[n]

x[k ] [n k ]

H thng
tuyn tnh,
bt bin thi gian

K hiu: y[n] = x[n] * h[n]

y[n]

x[k ]h[n k ]

Tch chp

Mt cht chi tit

y[0] = x[0] * h[0]

= + x[-2]h[2] + x[-1]h[1] + x[0]h[0]

+ x[1]h[-1] + x[2]h[-2] + +

Cng thc u ra tng qut:

y[n] = + x[-2]h[n+2] + x[-1]h[n+1] + x[0]h[n]

+ x[1]h[n-1] + x[2]h[n-2] + + x[n-1]h[1]

+ x[n]h[0] + x[n+1]h[-1] + x[n+2]h[-2]

1. DT convolution formula
2. Tnh cht
3. Computing the convolution sum
4. DT LTI properties from impulse response

Tnh cht ca tch chp

[n] * x[n] = x[n]

[n-m] * x[n] = x[n-m]
[n] * x[n-m] = x[n-m]

Giao hon (Commutative)

Kt hp (Associative)

Phn b (Distributive)

Giao hon

x[n] * h[n] h[n] * x[n]

h[n]
x[n]

y[n]

x[n]
h[n]

y[n]

Kt hp
( x[n] * h1[n]) * h2 [n] x[n] * (h1[n] * h2 [n])
h1[n]

x[n]

x[n]

x[n]

h2[n]

h1[n]*h2[n]

h2[n]

y[n]

y[n]

h1[n]

y[n]

Phn b
x[n] * (h1[n] h2 [n]) ( x[n] * h1[n]) ( x[n] * h2 [n])

x[n]

h1[n] + h2[n]

y[n]

h1[n]
y[n]

x[n]
h2[n]

1. DT convolution formula
2. DT convolution properties
3. Thc hin tnh ton
4. DT LTI properties from impulse response

y[n]

x[k ]h[n k ]

y[n0 ]

x[k ]h[n

1. ly i xng h[k] c h[-k]

2. Dch h[-k] sang phi (tri) nu n0 dng (m) c h[n0-k]
3. Nhn x[k] vi h[n0-k] c

x[k].h[n0-k]
4. ly tng vi mi k c y[n0]
Lp li t bc 2 n bc 4 cho tt c cc gi tr ca n

k]

Chiu di ca kt qu tch chp

y[n] x[n] h[n]

x[k ]h[n k ]

Ny = Nx + Nh 1
Ny : chiu di ca y
Nx : chiu di ca x
Nh : chiu di ca h

V d
Tm y[n] = x[n]*h[n] vi

x[n] u[n 1] u[n 3] [n]

h[n] 2 u[n] u[n 3]

x[n]
n

-1 0 1 2 3
h[n]
n

-1 0 1 2 3

Ex1 (cont)
x[k]

-1 0 1 2 3

h[k]

-1 0 1 2 3 k
h[-k]

-2 -1 0 1 k

y[0] = 6;

Ex1 (cont)
x[k]

-1 0 1 2 3

h[-k]

-2 -1 0 1

h[-1-k]

-4 -3 -2 -1 0

y[-1] = 2;

Ex1 (cont)
x[k]

-1 0 1 2 3

h[-k]

-2 -1 0 1

h[1-k]

-2 -1 0 1 2

y[1] = 8;

Ex1 (cont)
x[k]

-1 0 1 2 3

h[-k]

-2 -1 0 1

h[2-k]

-2 -1 0 1 2

y[2] = 8;

Ex1 (cont)
x[k]

-1 0 1 2 3

h[-k]

-2 -1 0 1

h[3-k]

-2 -1 0 1 2

y[3] = 4;

Ex1 (cont)
x[k]

-1 0 1 2 3

h[-k]

-2 -1 0 1

h[3-k]

-2 -1 0 1 2

y[4] = 2;

Ex 2
vi x[n] a u[n]
n

Tm y[n] = x[n]*h[n]

Ch :

h[n] u[n]

n0

if | a | 1

n
a 1 a

n n0

if | a | 1

( n1 n0 1)

1 a
a a

1 a
n n0
n1

n0

Example 2
First flip x[n] and do the convolution

Therefore

a n 1 1
u[n ]
y[n ]
a 1

Factor out an to
get form you know

Example 2
First flip h[n] and do the convolution
you know this
form

Therefore

a n 1 1
u[n ]
y[n ]
a 1

Tip: first flip the simpler signal!!!

Example 3
Find y[n] = x[n]*h[n] where x[n] = bnu[n] and h[n] = anu[n+2]

|a| < 1, |b| < 1, a b

Factor out bn to
get form you know

Therefore

a 2bn 2 a n 1b1
u[n 2]
y[n]
1
1 ab

Example 4
Compute output of a system with impulse response

h[n] = anu[n-2], |a| < 1 when the input is x[n] = u[-n]

Flipping x[n] because it is simpler

Therefore

a2
an
u[2 n]
u[n 3]
y[n]
1 a
1 a
A constant

Varies with n

1. DT convolution formula
2. DT convolution properties
3. Computing the convolution sum
4. Tnh cht ca h thng LTI thng qua
p ng xung

p ng xung

u vo l xung n v => u ra l p ng xung

h[n] = T{[n]}

C hai loi h thng LTI (tuyn tnh, bt bin thi gian):

1. p ng xung hu hn (Finite Impulse Response FIRsystem)

2. p ng xung v hn (Infinite Impulse Response IIRsystem)

Tnh p ng xung
p dng xung n v cho u vo
Ex.:

y[n ]

1
1
1
y[n 1] x[n ] x[n 1]
4
2
2

Gi s y[n] = 0 vi n<0

y[n] (1 / 2) [n] (1 / 4) n1 (5 / 8)u[n 1]

Tnh cht ca h thng LTI thng qua

p ng xung
H thng khng nh: p ng xung c dng nh sau

h[n] = K[n]

H thng o ngc c: h thng h[n] o ngc c

nu tn ti p ng xung hi[n] sao cho:

h[n]*hi[n] = [n]

 H thng nhn qu: h[n] =0 vi mi n<0

H thng nhn qu u ra khng ph thuc vo cc
gi tr u vo tng lai
y[n0 ]

h[k ]x[n

k ] h[k ]x[n0 k ]
k 0

h[k ]x[n

k]

{h[0]x[n0 ] h[1]x[n0 1] ...} {h[1]x[n0 1] h[2]x[n0 2] ...}

u vo hin ti v qu kh

u vo tng lai

=>Nu tn ti t nht mt gi tr k m h[k] khc khng th h thng khng

nhn qu

 H thng n nh: u vo hu hn, u ra hu hn

iu kin:

h[n]

V d

Xt tnh nhn qu v n nh ca cc h thng sau:

1. h[n] = 0.5nu[n]
2. h[n] = 3nu[n]
3. h[n] = 3nu[-n]

Bi tp

Xt cc c im ca cc h thng sau y:

Khng nh

o ngc

Nhn qu

n nh

Bt bin thi gian

Tuyn tnh

a) y[n] x(e|n| )
b) y[n] 0.5 x[n] 0.5 x[n 1]