MITRES 6 008S11 Lec02
MITRES 6 008S11 Lec02
1. Lecture 2 - 36 minutes
x(O)
x(1)x(2) General Seque
x(n)
nce
Graphical representa-
tion of Discrete-
Time Signals
*a ?III 7 8 91011 n
-3-2-1 0 1 2 3 4 5 6
Unit Sample(Impulse) b(n)
8(n)=1 n=O
=0 Otherwise
-101 - -*-n
-1 0 1 2 3
u(n)
00*
2.1
8(n) :u(n) -u(n-1) The unit-sample sequence
in terms of the unit-
step sequence.
-~~~ - u(n-1)
n1
8(k)
* * wo= 4=
j 0 j nj
2.2
x(-1) ()1)x(2) x(n) Representation of an
arbitrary sequence
as a linear combina-
-10 1
(O) I x(0)8(n)
n tion of delayed unit
samples.
-1 1(2 x(O)8(n)+x(1)8(n-1)
-- X(1I x(1)8n-l) +x(-1)B(n+1)+---
-1 0 12 n =I x(k)8(n-k)
k=-OD
+1)
xee9oo
(-1)8(
n
-1 0 1 2
1-B- 1- n4
N N 0N hk
-101234 k
N h(O-k)
-101 234
00 H h(-4-k)
-1012 34
2. Correction
3. Comments
In this lecture we introduce the class of discrete-time signals and
systems. The unit sample, unit step, exponential and sinusoidal
sequences are basic sequences which play an important role in the
analysis and representation of more complex sequences. The class of
discrete-time systems that we focus on is the class of linear shift-
invariant systems. The representation of this class of systems through
the convolution sum and some properties of convolution are developed.
2.3
4. Reading
Text: Section 2.0 (page 8) through eq. (2.51) page 28 section 2.4.
5. Problems
Problem 2.1
- f)
(b) x(n) = e (n/8
Problem 2.2
-4 -3 -2 -1 0
1 2 3 4
Figure P2.2-1
Problem 2.3
For each of the following systems, y(n) denotes the output and x(n)
the input. Determine for each whether the specified input-output
relationship is linear and/or shift-invariant.
2.4
Problem 2.4
(a)
x(n) 2
-l 0 1 2
h(n) = u(n)
0 1 2
Figure P2.4-1
x(n)
(b) 2
-2 -l 0 1 2
h(n)
-2
Figure P2.4-2
I I I I T
0 0 0
0
Figure P2.4-3
2.5
(d)
x (n) u (n)
* . *
0 1
h (n) 1
3 4 5
-l 0 1 2
-1
Figure P2.4-4
N-1 r 1-aN
aE 1-a , all a
r=0
Problem 2.5
V(n) .. _ y (n)
h (n) = 6(n) - 6 (n - 3)
L I TI T 1*
0
Figure P2.5-l
2.6
(a) Let x(n) = u(n).
Find ya (n) by first convolving x(n) with
h1 (n) and then convolving the result with h 2 (n) i.e.
(b) Again let x(n) = u(n). Find yb(n) by convolving x(n) with the
result of the convolution of h1 (n) and h 2 (n) i.e.
Your results for parts (a) and (b) should be identical, illustrating
the associative property of convolution.
Problem 2.6*
(a) Show that the function x(n) = zn, where z is a complex constant,
is an eigenfunction of a linear shift-invariant discrete-time system.
2.7
MIT OpenCourseWare
http://ocw.mit.edu
The following may not correspond to a particular course on MIT OpenCourseWare, but has been
provided by the author as an individual learning resource.
For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.