Professional Documents
Culture Documents
Reference:
Sections 2.1-2.5 of
University of Toronto
1 / 63
2 / 63
1,
0,
n, for n 0
0, for n < 0
u(n) =
for n 0
for n < 0
u(n) = ur (n + 1) ur (n)
Professor Deepa Kundur (University of Toronto)
3 / 63
4 / 63
Signal Symmetry
Signal Symmetry
Even signal:
x(n) = x(n)
Even signal component: xe (n) = 12 [x(n) + x(n)]
x(n)
x(n)
-7
-6
-5
-4
-3
-2
-1
-7
-6
-5
-4
-3
-2
-1
-7
-6
-5
-4
-3
-2
-1
5 / 63
x(n)
I
0.5
-6 -5 -4 -3 -2 -1 0 1
-0.5
2 3 4
5 6
7 8
7 / 63
Question: what if 6 Z?
x(n)
Question: what if k 6 Z?
time scale: n n, Z
I
time shift: n n k, k Z
I
-1
6 / 63
Signal Symmetry
1
8 / 63
Find x( 32 n + 1).
x(n)
3
2
1
-3 -2 -1 0 1
2 3 4
-1
5 6
15
7 8 9 10
20
-1
-2
-2
-3
x(n)
2 3 4
5 6
9 / 63
15
7 8 9 10
20
-1
0 if
3n
2
0 if
3n
2
5
2
4
11
2
17
2
10
23
2
13
29
2
16
35
2
19
> 19
x( 3n
+ 1)
2
+ 1 is an integer; undefined otherwise
undefined
x(1) = 1
undefined
x(4) = 2
undefined
x(7) = 3
undefined
x(10) = 2
undefined
x(13) = 1
undefined
x(16) = 1
undefined
x(19) = 2
+ 1 is an integer; undefined otherwise
10 / 63
-1
-1
-x(n+1)
3
2
1
-3 -2 -1 0 1
-1
+1
< 12
12
1
-3 -2 -1 0 1
3n
2
x(n)-x(n+1)
-3
n
< 1
-1
0
1
2
3
4
5
6
7
8
9
10
11
12
> 12
2 3 4
5 6
-2
-3
7 8 9
10
11
12
13 14
-1
-2
11 / 63
12 / 63
Terminology: Implication
Terminology: Equivalence
If A then B
Shorthand: A = B
If A then B
Shorthand: A = B
and
Example 1:
it is snowing = it is at or below freezing temperature
If B then A
Example 2:
5.2 = is positive
Note: For both examples above, B 6= A
Shorthand: B = A
can be rewritten as
Shorthand: A B
A if and only if B
We can also say:
13 / 63
A is EQUIVALENT to B
A=B
x(n)
Discrete-time
System
y(n)
output/
response
Discrete-time
signal
Discrete-time
signal
14 / 63
x(n) y (n)
Professor Deepa Kundur (University of Toronto)
15 / 63
16 / 63
vs.
dynamic
time-invariant
vs.
time-variant
linear
vs.
nonlinear
causal
vs.
non-causal
stable
vs.
unstable systems
..
.
Professor Deepa Kundur (University of Toronto)
..
.
Discrete-Time Signals and Systems
17 / 63
y (n)
N, M > 0
I
I
18 / 63
19 / 63
I
I
I
y (n) = A x(n), A 6= 0
y (n) = A x(n) + B, A, B, 6= 0
20 / 63
I
I
I
I
T
I
I
y (n) = A x(n), A 6= 0
y (n) = A x(n) + B, A, B, 6= 0
21 / 63
22 / 63
Homogeneity: Let a2 = 0.
T [a1 x1 (n)] = a1 T [x1 (n)]
23 / 63
24 / 63
Linearity
Additivity: Let a1 = a2 = 1.
Homogeneity
Additivity
x1 (n) y1 (n)
T
x2 (n) y2 (n)
Need both!
If a system is not homogeneous, it is not linear.
If a system is not additive, it is not linear.
25 / 63
26 / 63
y (n) = A x(n), A 6= 0
y (n) = A x(n) + B, A, B, 6= 0
y (n) = e 3x(n)
P
y (n) = nk= x(k)
for all n
Ans: Y, N, Y, Y, Y, N, N, Y
27 / 63
28 / 63
y (n) = A x(n), A 6= 0
y (n) = A x(n) + B, A, B, 6= 0
y (n) = e 3x(n)
P
y (n) = nk= x(k)
for all n.
Ans: Y, Y, Y, N, N, N, Y, Y
29 / 63
x[n]
I
I
|x[n]|
|x[n]|
I
n
I
I
x[n]
x[n]
I
I
BOUNDED SIGNAL
30 / 63
y (n) = A x(n), A 6= 0
y (n) = A x(n) + B, A, B, 6= 0
UNBOUNDED SIGNAL n
Ans: Y, Y, Y, Y, Y, N, Y, N
Professor Deepa Kundur (University of Toronto)
31 / 63
32 / 63
Final Remarks
33 / 63
34 / 63
(n) h(n)
Recall:
x(n) =
(n k) h(n k)
x(k)(n k)
(n k) h(n k)
k=
X
X
T
x(k)(n k)
x(k)h(n k)
k=
k=
T
x(n) y (n)
35 / 63
36 / 63
Properties of Convolution
Associative and Commutative Laws:
x(n) h(n) = h(n) x(n)
[x(n) h1 (n)] h2 (n) = x(n) [h1 (n) h2 (n)]
Therefore,
y (n) =
x(n)
h1(n)
k=
y(n)
h2(n)
37 / 63
h2(n)
h1(n)
y(n)
38 / 63
Properties of Convolution
Distributive Law:
For a causal system, y (n) only depends on present and past inputs
values. Therefore, for a causal system, we have:
h1(n) + h2(n)
h(k)x(n k)
k=
h1(n)
x(n)
y(n)
h2(n)
1
X
h(k)x(n k) +
k=
h(k)x(n k)
k=0
h(k)x(n k)
k=0
39 / 63
40 / 63
M1
X
h(k)x(n k)
k=0
h(k)x(n k)
k=0
41 / 63
42 / 63
System Realization
y (n) =
M1
X
All systems
nonrecursive systems
k=0
)
h(k)x(n k)
recursive systems
k=0
43 / 63
44 / 63
System Realization
System Realization
All systems
All systems
All LTI systems
Systems
Described
by LCCDEs
45 / 63
46 / 63
System Realization
General expression for Nth-order LCCDE:
N
M
X
X
ak y (nk) =
bk x(nk)
k=0
a0 , 1
2.5 Implementation of
Discrete-time Systems
k=0
47 / 63
48 / 63
Adder:
Unit delay:
Signal multiplier:
49 / 63
n
1 X
y (n) =
x(k) n = 0, 1, 2, . . .
5 k=n4
50 / 63
h[n]
n
1 X
h(n) =
(k)
5 k=n4
1/5
1
1
1
(n 4) + (n 3) + (n 2) +
5
5
5
1
1
(n 1) + (n)
5
5
1 2 3 4
n
Indeed FIR!
51 / 63
52 / 63
y (n)
n
n
X
1 X
1
x(k) =
x(k)
5
5
k=n4
y (n) =
k=n4
1
1
1
x(n 4) + x(n 3) + x(n 2) +
5
5
5
1
1
x(n 1) + x(n)
5
5
1/5
+
53 / 63
y (n) =
Adder:
54 / 63
...
Unit delay:
Infinite Impulse Response Systems and Recursive Implementation
+
Constant multiplier:
Unit advance:
Requires:
I M multiplications
I M 1 additions
I M 1 memory elements
Professor Deepa Kundur (University of Toronto)
bk x(n k)
...
+
1/5
k=0
1/5
1/5
Signal multiplier:
55 / 63
56 / 63
Consider an accumulator:
y (n) =
n
X
x(k) n = 0, 1, 2, . . .
for y (1) = 0.
y (n) =
k=0
n
X
x(k) n = 0, 1, 2, . . .
for y (1) = 0.
k=0
I
Consider an accumulator:
n
X
(k) = (n) + (n 1) + (n 2) +
k=0
=
1 n0
0 n<0
h[n]
1
...
0 1 2 3 4
n
57 / 63
y (n) =
k=0
n1
X
y (n) =
N
X
k=1
bk x(n k)
k=0
M
X
bk x(n k)
nonrecursive
| {z }
k=0
input 1
N
X
y (n)
=
ak y (n k) + v (n) recursive
|{z}
|{z}
k=1
output 2
input 2
v (n)
=
|{z}
output 1
k=0
recursive implementation
ak y (n k) +
M
X
x(k) + x(n)
= y (n 1) + x(n)
y (n) = y (n 1) + x(n)
58 / 63
x(k)
n
X
59 / 63
60 / 63
61 / 63
Unit delay:
Constant multiplier:
Unit advance:
Unit advance:
...
...
Signal multiplier:
...
...
For N>M
Unit delay:
Constant multiplier: +
Signal multiplier:
Adder:
63 / 63
Adder:
...
...
...
...
...
...
...
...
62 / 63