InfoCoBuild

6.02 Introduction to EECS II: Digital Communication Systems

6.02 Introduction to EECS II: Digital Communication Systems (Fall 2012, MIT OCW). Instructors: Prof. Hari Balakrishnan and Prof. George Verghese. An introduction to several fundamental ideas in electrical engineering and computer science, using digital communication systems as the vehicle. The three parts of the course - bits, signals, and packets - cover three corresponding layers of abstraction that form the basis of communication systems like the Internet.

The course teaches ideas that are useful in other parts of EECS: abstraction, probabilistic analysis, superposition, time and frequency-domain representations, system design principles and trade-offs, and centralized and distributed algorithms. The course emphasizes connections between theoretical concepts and practice using programming tasks and some experiments with real-world communication channels. (from ocw.mit.edu)

Lecture 22 - Sliding Window Analysis, Little's Law

This lecture continues with an analysis of sliding window protocol and how it handles packet loss. Little's Law is introduced to relate the average number of packets to the average service rate and average delay of a stable system.


Go to the Course Home or watch other lectures:

Lecture 01 - Overview: Information and Entropy
Lecture 02 - Compression: Huffman and LZW
Lecture 03 - Errors, Channel Codes
Lecture 04 - Linear Block Codes, Parity Relations
Lecture 05 - Error Correction, Syndrome Decoding
Lecture 06 - Convolutional Codes
Lecture 07 - Viterbi Decoding
Lecture 08 - Noise
Lecture 09 - Transmitting on a Physical Channel
Lecture 10 - Linear Time-Invariant (LTI) Systems
Lecture 11 - LTI Channel and Intersymbol Interference
Lecture 12 - Filters and Composition
Lecture 13 - Frequency Response of LTI Systems
Lecture 14 - Spectral Representation of Signals
Lecture 15 - Modulation/Demodulation
Lecture 16 - More on Modulation/Demodulation
Lecture 17 - Packet Switching
Lecture 18 - MAC Protocols
Lecture 19 - Network Routing (Without Failures)
Lecture 20 - Network Routing (With Failures)
Lecture 21 - Reliable Transport
Lecture 22 - Sliding Window Analysis, Little's Law
Lecture 23 - A Brief History of the Internet
Lecture 24 - History of the Internet (cont.), Course Summary