This document provides an overview of discrete-time signals and systems. It introduces common signal types like the unit sample, unit step, exponential, and sinusoidal sequences. It defines linear and shift-invariant systems and describes representing systems using convolution. It provides examples of representing sequences as linear combinations of delayed unit samples and calculating outputs of linear shift-invariant systems. It also defines eigenfunctions and discusses whether certain sequences are eigenfunctions. The document includes reading assignments, practice problems, and notes on topics covered in the lecture.
This document provides an overview of discrete-time signals and systems. It introduces common signal types like the unit sample, unit step, exponential, and sinusoidal sequences. It defines linear and shift-invariant systems and describes representing systems using convolution. It provides examples of representing sequences as linear combinations of delayed unit samples and calculating outputs of linear shift-invariant systems. It also defines eigenfunctions and discusses whether certain sequences are eigenfunctions. The document includes reading assignments, practice problems, and notes on topics covered in the lecture.
1. Lecture 2 - 36 minutes x(O) x(1) General Seque x(2) x(n) 7 8 91011 n -3-2-1 0 1 2 3 4 5 6 -101 -1 0 1 2 3 nce Graphical representa- tion of Discrete- Time Signals Unit Sample(Impulse) b(n) 8(n)=1 n=O =0 Otherwise - -*-n u(n) 00* 2.1 *a ?III 8(n) :u(n) -u(n-1) 21111 ... u(n)= Z 8(k) n<( | 1 8(k n1 The unit-sample sequence in terms of the unit- step sequence. u (n) The unit-step sequence in terms of the unit- sample sequence. 8(k) Rea O n I Exponential x(n)= (n Exponential and Sinusoidal sequences. Sinusoidal x(n)=Acos(wen+O) * * wo= 4= j 0 nj j 2.2 -~~~ - u(n-1) x(-1) ()1)x(2) x(n) -10 1 n (O) I x(0)8(n) -1 1(2 -- X(1I x(1)8n-l) n -1 0 1 2 xee9oo n -1 0 1 2 x(-2 x(-2) 8 (n+2) 1-B- 1- n4 -1a 1 2 Representation of an arbitrary sequence as a linear combina- tion of delayed unit samples. x(O)8(n)+x(1)8(n-1) +x(-1)B(n+1)+--- = I x(k)8(n-k) k=-OD y(n)= E x(k)h(n-k) k =-O xxxxxxxxxxx xWk Illustration of folding and shifting for linear convolu- tion. -101234 k N N 0N hk -101234 k N h(O-k) -101 234 h(-4-k) -1012 34 2. Correction In the lecture I indicate that the sinusoidal sequence A cos(w n + #) with w = 3ff/7 and # = - Tr/8 is not periodic. In fact it is peri 8 dic although Rot with a period of 2rr/we. (See problem 2.1(a)). For w0 = 3/7 the sinusoidal sequence will not be periodic. 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 00 H " (-1)8( +1) 4. Reading Text: Section 2.0 (page 8) through eq. (2.51) page 28 section 2.4. 5. Problems Problem 2.1 Determine whether or not each of the following sequences is periodic. If your answer is yes, determine the period. (a) x(n) = A cos (- n-) (b) x(n) = e (n/8 - f) Problem 2.2 A sequence x(n) is shown below. Express x(n) as a linear combination of weighted and delayed unit samples. -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. (a) y(n) = 2x(n) + 3 (b) y(n) = x(n) sin(2 n + ) (c) y(n) = (x(n)]2 n (d) y (n) =, x x(m) m=-_O 2.4 Problem 2.4 For each of the following pairs of sequences, x(n) represents the input to an LSI system with unit-sample response h(n). Determine each output y(n). Sketch your results. (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 x(n) = an u(n) (c) 0 < a < l I I I I T h(n) = n u(n) ; 0 < < ; / a 0 0 0 0 Figure P2.4-3 2.5 x (n) u (n) * . * 0 1 h (n) 1 3 4 5 -l 0 1 2 -1 Figure P2.4-4 The following formulas may be useful: C a = , [a| < 1 E 1-a r=0 N-1 r 1-aN aE 1-a , all a r=0 Problem 2.5 The system shown below contains two linear shift-invariant subsystems with unit sample responses h 1 (n) and h2 (n), in cascade. V(n) .. _ y (n) h (n) = 6(n) - 6 (n - 3) 0 h 2 (n) = (.8)n u(n) L I I T T 1* 0 Figure P2.5-l 2.6 (d) (a) Let x(n) = u(n). Find ya (n) by first convolving x(n) with h 1 (n) and then convolving the result with h 2 (n) i.e. ya(n) = [x(n) * h 1 (n)] * h 2 (n) (b) Again let x(n) = u(n). Find yb(n) by convolving x(n) with the result of the convolution of h 1 (n) and h 2 (n) i.e. yb(n) = x(n) * [h 1 (n) * h 2 (n)] Your results for parts (a) and (b) should be identical, illustrating the associative property of convolution. Problem 2.6* If the output of a system is the input multiplied by a complex constant then that input function is called an eigenfunction of the system. (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. (b) By constructing a counterexample, show that z nu(n) is not an eigenfunction of a linear shift-invariant discrete-time system. * Asterisk indicates optional problem. 2.7 MIT OpenCourseWare http://ocw.mit.edu Resource: Digital Signal Processing Prof. Alan V. Oppenheim 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.