EE210 S22 LecSlides 01 2pp

SJSU, EE210
Linear Systems Theory

Prof. Essam Marouf
Lecture Slides 01
Discrete-Time Signals & Systems 1
O&S 2.1-2.3, M&I 2.2-2.5
Figure 2.2 (a) Segment of a continuous-time speech signal xa(t ). (b) Sequence of samples x[n] = xa(nT ) obtained
from the signal in part (a) with T = 125 µs.
Discrete-Time Signal Processing, Third Edition Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc.
Alan V. Oppenheim • Ronald W. Schafer 2 All rights reserved.
1
Figure 2.1 Graphic representation of a discrete-time signal.
3
Alan V. Oppenheim • Ronald W. Schafer All rights reserved.
4
5
6
7
8
Figure 2.3 Some basic sequences. The sequences shown play important roles in the analysis and representation of
discrete-time signals and systems.
fin)
Nn)
an 1914
10
11
12
13
14
15
16
17
18
Figure 2.5 cos ω0n for several different values of ω0. As ω0 increases from zero toward π (parts a-d), the sequence
oscillates more rapidly. As ω0 increases from π to 2π (parts d-a), the oscillations become slower.
20
21
22
Figure 2.6 Representation of a discrete-time system, i.e., a transformation that maps an input sequence x[n] into a
unique output sequence y[n].
S{ . }
23
24
25
x(n)
26
Y#
27
Figure 2.8 Representation of the output of an LTI system as the superposition of responses to individual samples of
the input.
Xln ) hen)
xtzlhcntz ) ①
xcntxt-218cm -1271
xco )8Cm→
+ xcolh.cn) ②
+2113784 3) -
y
X Lcn 3) ③ -
xcn ) yln7=①t②t③
'
m m
x x
29
-
D - X
Example:
y[n] = x[n] * h[n]
∑
= x[k]h[n− k]
k= −∞
hlrdxln R] -
↳
here
form used
From Manolakis & Ingle, 2012

30
Figure 2.10 Sequence involved in computing a discrete convolution. (a)–(c) The sequences x[k] and h[n− k] as a
function of k for different values of n. (Only nonzero samples are shown.) (d) Corresponding output sequence as a
function of n.
h(n-k) x(k)
Similar
Example
in O&S
ycn) =
EE # lklhcn )
- k
y(n)=x(n)*h(n)
'
M m .sn M -
-
A o
32
N O
G. attyis
aus
discussed below)
sum of geometric series of finite

number of terms
33
⇐ • if and
only if
•
necessary and sufficient
condition
implies
17
hold
34
must for ALL bounded
-
input
signals
35
<x
t
missing please add
; .
b
€0
if
(
36
causal & BIBO stable from
y
slide 36
=
heh i)
-
-
t
37
zh Ln -
3)
O&S Example: The Accumulator System
- input/output equation:
n n−1
∑
y(n) = x(k)
∑
y(n) = x(k) + x(n)
k= −∞ k= −∞
y(n) = y(n− 1) + x(n)
- Special case of a family of LTI discrete-time systems

described by the difference equation
N M
∑ ∑
y(n) = − am y(n− m) + bm x(n− m)
m= 1 m= 0
where the a’s and b’s are constants (a1 = -1, b0 = 1, all others = 0)
38
Is the Accumulator System Linear?
Linearity: Check Superposition & Homogeneity
Yes, linear since

Combined Check
39
Is the Accumulator System Time-Invariant?
time shifted output
response to time shifted input
Thus, time-invariant since

y1(n) = y(n− n0)
40
What is Accumulator System Impulse Response h(n)?
∞ n
∑ ∑
y(n) = x(n) * h(n) = x(k)h(n− k) = x(k) accumulator
k= −∞ k= −∞
to
Thus, h(n) = u(n) (unit step) compare ; we will learn how
to automatically compute
h ( n) from the difference
Realization equation later !
n n−1 Figure 2.15 Block diagram of a recursive difference equation representing an accumulator.
∑ ∑
y(n) = x(k) = x(k) + x(n)
k= −∞ k= −∞
y(n) = y(n− 1) + x(n) ¥7ference egri

feedback path; IIR system
41
You may want to show that all systems described

by the general difference equation
-
N M
∑ ∑
y(n) = − am y(n− m) + bm x(n− m)
m= 1 m= 0
where the a’s and b’s are constants, are LTI systems
42
O&S Example: Moving Average System (Filter)
- Input/output equation:
M
1
∑
y(n) = x(n− m)
M + 1 m= 0
- Also a special case of LTI discrete-time systems described by the

difference equation
-
N M
∑ ∑
y(n) = − am y(n− m) + bm x(n− m)
m= 1 m= 0
where the a’s and b’s are constants

43
Moving-Average System
∞ M
1
∑ ∑
y(n) = h(n) * x(n) = h(k)x(n− k) = x(n− m)
k= −∞
M + 1 m= 0
Impulse Response
M
1 1
∑
h(n) = [u(n) − u(n− M − 1)] = δ(n− m)
M+ 1 M + 1 m= 0
finite impulse response (FIR) filter
h(n)
1/(M+1)
44
Tapped delay-line realization of the FIR system (filter)
M M
∑ ∑
h(n) = bmδ(n− m), y(n) = bm x(n− m)
m= 0 m= 0
M=3
No feedback paths; all paths are feedforward

45
46
Figure 2.12 (a) Cascade combination of two LTI systems. (b) Equivalent cascade. (c) Single equivalent system.
47
Figure 2.11 (a) Parallel combination of LTI systems. (b) An equivalent system.
48
Response to Complex Exponentials & sinusoids
↳
←
= Hlejoo)
- TIL Wo ⇐ IT
49
50
=
→ ⇐ atjb
.
CE a j b
-
E + C* = 2A
→
e%EeiktB
-
51

EE210 S22 LecSlides 01 2pp

Uploaded by

Document Information

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

EE210 S22 LecSlides 01 2pp

Uploaded by

Copyright:

Available Formats

SJSU, EE210

Linear Systems Theory

O&S 2.1-2.3, M&I 2.2-2.5

Figure 2.1 Graphic representation of a discrete-time signal.

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

From Manolakis & Ingle, 2012

sum of geometric series of finite

O&S Example: The Accumulator System

y(n) = y(n− 1) + x(n)

- Special case of a family of LTI discrete-time systems

Linearity: Check Superposition & Homogeneity

Yes, linear since

Is the Accumulator System Time-Invariant?

time shifted output

response to time shifted input

Thus, time-invariant since

y(n) = y(n− 1) + x(n) ¥7ference egri

You may want to show that all systems described

- Also a special case of LTI discrete-time systems described by the

where the a’s and b’s are constants

finite impulse response (FIR) filter

No feedback paths; all paths are feedforward

You might also like