6.02
Spring 2012
Home
Announcements
Handouts
»Lectures
»PSets
»Course notes & solutions by chapter
»Practice problems
MIT cert required:
* Online grades
* PSets:
* Help queue
* Lab Hours
* Staff only
6.02 piazza forum
Course info
Course calendar
Course objectives
SW installation
Python
Numpy
Matplotlib
Previous terms
|
6.02 Handouts
Lectures |
The course notes ("text") are in three parts, reflecting the three
themes in 6.02: bits, signals, and packets. Each part has multiple
chapter. The table below specifies the relevant chapters and/or
sections for each lecture. Please send any
questions/comments/suggestions on the notes to hari.
Part 1: Bits: Chapters 1, 2, 3, 4, 5, 6, 7, 8
Part 2: Signals: Chapters
9, 10,
11, 12,
13, 14
Part 3: Packets: Chapters 15, 16, 17, 18, 19
Lecture | Slides | Notes | Quiz |
L01: Overview. Abstractions. Information. |
PDF |
Ch 1, 2, §3.1-3.2 |
Quiz 1
|
L02: Compression |
PDF |
Ch 3 |
L03: Errors in communication |
PDF |
Ch 4 (skim thru §4.3.1), §5.1-5.3 |
L04: Error correction (channel codes): Basics |
PDF |
Ch 5 |
L05: Error correction: Linear block codes |
PDF |
Ch 6 (Not §6.6) |
L06: Error correction: Convolutional coding |
PDF |
Ch 7 |
L07: Viterbi decoding of convolutional codes |
PDF |
Ch 8 |
L08: Noise |
PDF |
Ch 9 |
Quiz 2
|
L09: Transmitting on a physical channel |
PDF |
Ch 10 (§10.1,11.4) |
L10: Linear Time-Invariant (LTI) systems |
PDF |
Ch 10 (§10.2, 11.3) |
L11: LTI channel and intersymbol interference |
PDF |
Ch 11 (§11.1) |
L12: Convolution |
PDF |
Ch 11 (§11.2) |
L13: Frequency response of LTI systems |
PDF |
Ch 12 |
L14: Spectral representation of signals |
PDF |
Ch 13 |
L15: Modulation/demodulation |
PDF |
Ch 14 |
L16: More on modulation/demodulation |
PDF |
Ch 14 |
L17: Medium Access (MAC): Aloha |
PDF |
Ch 15 (§1-2,4-5) |
Quiz 3
|
L18: Mo' MAC: Contention windows, CSMA, TDMA |
PDF |
Ch 15 (rest) |
L19: Packet switching |
PDF |
Ch 16 |
L20: Network routing (without failures) |
PDF |
Ch 17 |
L21: Network routing (handling failures) |
PDF |
Ch 18 |
L22: Reliable Data Transport |
PDF |
Ch 19 (until §19.5) |
L23: Sliding Window Protocol |
PDF |
Ch 19 (§19.5-end) |
L24: Evolution of Networks |
PDF |
No reading! |
L25: Wrap-up |
PDF |
None |
|
|
PSets |
PS1, due February 23, 2012 @ 0600 ("midnight" on Wed February 22, 2012, auto-extended to 6 am the next day!).
PS2, due March 1, 2012 @ 0600.
PS3, due March 8, 2012 @ 0600.
PS4, due March 22, 2012 @ 0600.
PS5, due April 5, 2012 @ 0600.
PS6, due April 13, 2012 @ 0600.
PS7, due April 26, 2012 @ 0600.
PS8, due May 3, 2012 @ 0600.
PS9, due May 10, 2012 @ 0600.
|
|
Course notes by chapter, with solutions |
- Introduction
- Information, Entropy, and the Motivation for Source Codes | Solutions
- Compression Algorithms: Huffman and LZW | Solutions
- Digital Signaling and Communication Abstractions
- Coping with Bit Errors using Error Correction Codes | Solutions
- Linear Block Codes: Encoding and Decoding
- Convolutional Codes: Construction and Encoding
- Viterbi Decoding of Convolutional Codes | Solutions
- Noise
- Models for Physical Communication Channels
- LTI Models and Convolution
- Frequency Response of LTI Systems | Solutions
- Fourier Analysis and Spectral Representation of Signals | Solutions
- Modulation and Demodulation | Solutions
- Sharing a Channel: Media Access (MAC) Protocols | Solutions
- Communication Networks: Sharing and Switches | Solutions
- Network Routing - I: Without Any Failures | Solutions
- Network Routing - II: Routing Around Failures | Solutions
- Reliable Data Transport Protocols | Solutions
|
|
Background and other readings |
The following material may be useful as background or augmentation. They are not required for the course per se.
- Basic probability tutorials:
- Information Science, by David G. Luenberger, esp. Chapters 1-4 & 6.
|
|