In the last session, we demonstrated the versatility of state machines and introduced signals and systems. In this session, we will focus on linear time-invariant (LTI) systems. We'll be able to represent LTI systems using state machines, and introduce other ways to represent LTI systems. Once we know that a system is LTI, we can use what we know about linear time-invariance to analyze and predict the behavior of the system.
The overview handout provides a more detailed introduction, including the big ideas of the session, key vocabulary, what you should understand (theory) and be able to do (practice) after completing this session, and additional resources.
Read sections 5.1-5.4 of the course notes.
These videos have been developed for OCW Scholar, and are designed to supplement the lecture videos.
- Recitation 5: LTI Motivations and Representations (00:12:48)
Recitation 5: LTI Motivations and Representations
- Recitation 6: System Equivalences (00:15:10)
Recitation 6: System Equivalences
The problems in the tables below are taken from the 6.01 Online Tutor, an interactive environment that is not available on OCW. Do not try to answer these questions in the PDF files; answers will not be checked, and cannot be submitted.
- Software Lab 4: Signal Class (PDF)
- Code for Software Lab 4 (ZIP) (This ZIP file contains: 5 .py files.)
|4.1.1||Constructing signals (PDF)|
|4.1.2||Step signal (PDF)|
|4.1.3||Subclasses of signals (PDF)|
|4.1.4||Additional subclasses (PDF)|
|4.1.5||PolyR on signals (PDF)|
- Design Lab 4: Hitting the Wall (PDF)
- Code for Design Lab 4 (ZIP) (This ZIP file contains: 2 .py files.)
Do problem 4.2.1 before the design lab.
|4.2.1||Difference equations (PDF)|
|4.3.1||Wall finder (PDF)|
|4.3.3||State machine composition (PDF)|
|4.3.5||Wall finder state machine (PDF)|
|4.3.6||Wall finder gains (PDF)|
|4.4.2||Implement LTISM (PDF)|
Nano-quiz problems and solutions are taken from a previous version of the 6.01 Online Tutor. Do not try to answer these questions in the PDF files; answers will not be checked, and cannot be submitted.