6.02
Fall 2011

Home
Announcements

Handouts
»Lectures
»PSets
»Course notes & solutions by chapter
»Practice problems
»Recitation notes

*MIT cert required
* Online grades
* PSets:
1, 2, 3, 4, 5,
6, 7, 8, 9, 10
* Help queue
* Lab Hours
* Staff only

6.02 piazza forum

Course info
Course calendar
Course description

SW installation
Python
Numpy
Matplotlib

Previous terms

6.02 Handouts

Lectures The section numbers in the Notes column refer to chapters and sections in the 6.02 notes. The relevant chapters are linked below. Please send any questions/comments/suggestions on the notes to hari.

LectureSlidesNotesQuiz
L01: Information & entropy PDF Ch. 1, 2, §3.1-3.2 Quiz 1
L02: Compression PDF Ch. 3
L03: Abstractions, layering, and digital signaling PDF Ch. 4
L04: Noise PDF Ch. 5
L05: Error correction (channel codes): Basics PDF Ch. 6 (to §6.4.1)
L06: Error correction: Linear block codes PDF Ch. 6 (§6.4-end)
L07: Error correction: Convolutional coding PDF Ch. 7
L08: Viterbi decoding of convolutional codes PDF Ch. 8
L09: Shannon capacity of the BSC channel PDF Not on Quiz 2
L10: Linear Time-Invariant (LTI) systems PDF Ch. 10 Quiz 2
L11: Convolution PDF Ch. 11
L12: Frequency response PDF Ch. 12
L13: Discrete-time Fourier series PDF Formulas
FAQ
L14: Spectral representation of signals PDF
L15: Modulation/Demodulation PDF Notes
L16: More on modulation/demodulation PDF
L17: Medium Access (MAC): TDMA, Aloha PDF Ch. 16 (to §16.5) Quiz 3
L18: Mo' MAC: Aloha, contention windows, CSMA PDF Ch. 16
L19: Packet switching PDF Ch. 17
L20: Network routing (without failures) PDF Ch. 18
L21: Network routing (handling failures) PDF Ch. 19
L22: Reliable Data Transport PDF Ch. 20 (until §20.5.1)
L23: Sliding Window Protocol PDF Ch. 20 (§20.5-end)
L24: Evolution of Networks PDF Ch. 21
L25: Wrap-up PDF None

PSets PSet PS1, due September 15, 2011 @ 0600 ("midnight" on Wed Sept 14, auto-extended to 6 am the next day!).
PSet PS2, due September 29, 2011 @ 0600.
PSet PS3, due October 6, 2011 @ 0600.
PSet PS4, due October 13, 2011 @ 0600.
PSet PS5, due October 27, 2011 @ 0600.
PSet PS6, due November 3, 2011 @ 0600.
PSet PS7, due November 11, 2011 @ 0600.
PSet PS8, due November 24, 2011 @ 0600.
PSet PS9, due December 1, 2011 @ 0600.
PSet PS10, due December 8, 2011 @ 0600.
Course notes by chapter
  1. Introduction
  2. Information, Entropy, and the Motivation for Source Codes | Solutions
  3. Compression Algorithms: Huffman and LZW | Solutions
  4. Digital Signaling and Communication Abstractions
  5. Noise
  6. Coping with Bit Errors using Error Correction Codes | Solutions
  7. Convolutional Codes: Construction and Encoding
  8. Viterbi Decoding of Convolutional Codes | Solutions
  9. Shannon Capacity for Binary Symmetric Channels
  10. LTI Models for Communication Channels
  11. Characterizing LTI Systems in the Time Domain: Convolution
  12. Convolution and Frequency Response of LTI Systems
  13. Discrete-Time Fourier Series, Spectral Representation
  14. Modulation and Demodulation
  15. This chapter intentionally left blank!
  16. Sharing a Channel: Media Access (MAC) Protocols | Solutions
  17. Communication Networks: Sharing and Switches | Solutions
  18. Network Routing - I: Without Any Failures | Solutions
  19. Network Routing - II: Routing Around Failures | Solutions
  20. Reliable Data Transport Protocols | Solutions
Notes from recitation sections These notes are provided by the recitation instructors describing what they covered. Each recitation instructor has considerable latitude and flexibility in determining their teaching plan and choosing the problems they cover. Some of this material may be specific to a particular section, and such material will not be required for the quizzes or problem sets.
Background and other readings The following material may be useful as background or augmentation. They are not required for the course per se.