DOC PREVIEW
MIT 6 003 - Discrete-Time Systems

This preview shows page 1-2-3-4-5-33-34-35-36-67-68-69-70-71 out of 71 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 71 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 71 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 71 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 71 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 71 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 71 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 71 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 71 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 71 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 71 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 71 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 71 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 71 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 71 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 71 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

6.003: Signals and SystemsDiscrete-Time SystemsSeptember 15, 2009Discrete-Time SystemsWe start with discrete-time systems because they• are conceptually simpler than continuous-time systems• illustrate the same important modes of thinking• are increasingly important (digital electronics and computation)Example: Population GrowthMultiple Representations of Discrete-Time SystemsSystems can be represented in different ways to more easily addressdifferent types of issues.Verbal description: ‘To reduce the number of bits needed to storea sequence of large numbers that are nearly equal, record the firstnumber, and then record successive differences.’Difference equation:y[n] = x[n] − x[n − 1]Block diagram:−1Delay+x[n] y[n]We will exploit particular strengths of each of these representations.Difference EquationsDifference equations are mathematically precise and compact.Example:y[n] = x[n] − x[n − 1]Difference EquationsDifference equations are mathematically precise and compact.Example:y[n] = x[n] − x[n − 1]Let x[n] equal the “unit sample” signal δ[n],δ[n] =1, if n = 0;0, otherwise.−1 0 1 2 34nx[n] = δ[n]We will use the unit sample as a “primitive” (building-block signal)to construct more complex signals.Difference EquationsDifference equations are mathematically precise and compact.Example:y[n] = x[n] − x[n − 1]Let x[n] equal the “unit sample” signal δ[n],δ[n] =1, if n = 0;0, otherwise.−1 0 1 2 34nx[n] = δ[n]We will use the unit sample as a “primitive” (building-block signal)to construct more complex signals.Step-By-Step SolutionsDifference equations are convenient for step-by-step analysis.−1 0 1 2 34nx[n] = δ[n]−1 0 1 2 34ny[n]Find y[n] given x[n] = δ[n]: y[n] = x[n] − x[n − 1]y[−1] = x[−1] − x[−2]= 0 − 0 = 0y[0] = x[0] − x[−1]= 1 − 0 = 1y[1] = x[1] − x[0]= 0 − 1 = −1y[2] = x[2] − x[1]= 0 − 0 = 0y[3] = x[3] − x[2]= 0 − 0 = 0. . .Step-By-Step SolutionsDifference equations are convenient for step-by-step analysis.−1 0 1 2 34nx[n] = δ[n]−1 0 1 2 34ny[n]Find y[n] given x[n] = δ[n]: y[n] = x[n] − x[n − 1]y[−1] = x[−1] − x[−2]= 0 − 0 = 0y[0] = x[0] − x[−1]= 1 − 0 = 1y[1] = x[1] − x[0]= 0 − 1 = −1y[2] = x[2] − x[1]= 0 − 0 = 0y[3] = x[3] − x[2]= 0 − 0 = 0. . .Step-By-Step SolutionsDifference equations are convenient for step-by-step analysis.−1 0 1 2 34nx[n] = δ[n]−1 0 1 2 34ny[n]Find y[n] given x[n] = δ[n]: y[n] = x[n] − x[n − 1]y[−1] = x[−1] − x[−2]= 0 − 0 = 0y[0] = x[0] − x[−1]= 1 − 0 = 1y[1] = x[1] − x[0]= 0 − 1 = −1y[2] = x[2] − x[1]= 0 − 0 = 0y[3] = x[3] − x[2]= 0 − 0 = 0. . .Step-By-Step SolutionsDifference equations are convenient for step-by-step analysis.−1 0 1 2 34nx[n] = δ[n]−1 0 1 2 34ny[n]Find y[n] given x[n] = δ[n]: y[n] = x[n] − x[n − 1]y[−1] = x[−1] − x[−2]= 0 − 0 = 0y[0] = x[0] − x[−1]= 1 − 0 = 1y[1] = x[1] − x[0]= 0 − 1 = −1y[2] = x[2] − x[1]= 0 − 0 = 0y[3] = x[3] − x[2]= 0 − 0 = 0. . .Step-By-Step SolutionsDifference equations are convenient for step-by-step analysis.−1 0 1 2 34nx[n] = δ[n]−1 0 1 2 34ny[n]Find y[n] given x[n] = δ[n]: y[n] = x[n] − x[n − 1]y[−1] = x[−1] − x[−2]= 0 − 0 = 0y[0] = x[0] − x[−1]= 1 − 0 = 1y[1] = x[1] − x[0]= 0 − 1 = −1y[2] = x[2] − x[1]= 0 − 0 = 0y[3] = x[3] − x[2]= 0 − 0 = 0. . .Step-By-Step SolutionsDifference equations are convenient for step-by-step analysis.−1 0 1 2 34nx[n] = δ[n]−1 0 1 2 34ny[n]Find y[n] given x[n] = δ[n]: y[n] = x[n] − x[n − 1]y[−1] = x[−1] − x[−2]= 0 − 0 = 0y[0] = x[0] − x[−1]= 1 − 0 = 1y[1] = x[1] − x[0]= 0 − 1 = −1y[2] = x[2] − x[1]= 0 − 0 = 0y[3] = x[3] − x[2]= 0 − 0 = 0. . .Step-By-Step SolutionsDifference equations are convenient for step-by-step analysis.−1 0 1 2 34nx[n] = δ[n]−1 0 1 2 34ny[n]Find y[n] given x[n] = δ[n]: y[n] = x[n] − x[n − 1]y[−1] = x[−1] − x[−2]= 0 − 0 = 0y[0] = x[0] − x[−1]= 1 − 0 = 1y[1] = x[1] − x[0]= 0 − 1 = −1y[2] = x[2] − x[1]= 0 − 0 = 0y[3] = x[3] − x[2]= 0 − 0 = 0. . .Step-By-Step SolutionsBlock diagrams are also useful for step-by-step analysis.Represent y[n] = x[n] − x[n − 1] with a block diagram:−1Delay+x[n] y[n]−1 0 1 2 34nx[n] = δ[n]−1 0 1 2 34ny[n]Step-By-Step SolutionsBlock diagrams are also useful for step-by-step analysis.Represent y[n] = x[n] − x[n − 1] with a block diagram: start “at rest”−1Delay+x[n] y[n]0−1 0 1 2 34nx[n] = δ[n]−1 0 1 2 34ny[n]Step-By-Step SolutionsBlock diagrams are also useful for step-by-step analysis.Represent y[n] = x[n] − x[n − 1] with a block diagram: start “at rest”−1Delay+1 1−10−1 0 1 2 34nx[n] = δ[n]−1 0 1 2 34ny[n]Step-By-Step SolutionsBlock diagrams are also useful for step-by-step analysis.Represent y[n] = x[n] − x[n − 1] with a block diagram: start “at rest”−1Delay+1 → 0−10 → −1−1 0 1 2 34nx[n] = δ[n]−1 0 1 2 34ny[n]Step-By-Step SolutionsBlock diagrams are also useful for step-by-step analysis.Represent y[n] = x[n] − x[n − 1] with a block diagram: start “at rest”−1Delay+1 → 0−100 → −1−1 0 1 2 34nx[n] = δ[n]−1 0 1 2 34ny[n]Step-By-Step SolutionsBlock diagrams are also useful for step-by-step analysis.Represent y[n] = x[n] − x[n − 1] with a block diagram: start “at rest”−1Delay+0−10−1−1 0 1 2 34nx[n] = δ[n]−1 0 1 2 34ny[n]Step-By-Step SolutionsBlock diagrams are also useful for step-by-step analysis.Represent y[n] = x[n] − x[n − 1] with a block diagram: start “at rest”−1Delay+0−10−1 → 0−1 0 1 2 34nx[n] = δ[n]−1 0 1 2 34ny[n]Step-By-Step SolutionsBlock diagrams are also useful for step-by-step analysis.Represent y[n] = x[n] − x[n − 1] with a block diagram: start “at rest”−1Delay+0 00−1 → 0−1 0 1 2 34nx[n] = δ[n]−1 0 1 2 34ny[n]Step-By-Step SolutionsBlock diagrams are also useful for step-by-step analysis.Represent y[n] = x[n] − x[n − 1] with a block diagram: start “at rest”−1Delay+0 000−1 0 1 2 34nx[n] = δ[n]−1 0 1 2 34ny[n]Step-By-Step SolutionsBlock diagrams are also useful for step-by-step analysis.Represent y[n] = x[n] − x[n − 1] with a block diagram: start “at rest”−1Delay+0 000−1 0 1 2 34nx[n] = δ[n]−1 0 1 2 34ny[n]Step-By-Step SolutionsBlock diagrams are also useful for step-by-step analysis.Represent y[n] = x[n] − x[n − 1] with


View Full Document

MIT 6 003 - Discrete-Time Systems

Documents in this Course
Control

Control

11 pages

PROBLEMS

PROBLEMS

14 pages

QUIZ I

QUIZ I

9 pages

Modes

Modes

11 pages

Load more
Download Discrete-Time Systems
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Discrete-Time Systems and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Discrete-Time Systems 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?