6.02
Spring 2011
Home
Announcements
Handouts
»Lectures
»PSets
»Tutorial Problems
*MIT cert required
* Staff only
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 [PDF].
| Lecture | Slides | Notes |
|---|
| L01: Encoding Information |
PDF |
§22.1–22.3 |
| L02: Compression |
PDF |
§22.4 |
| L03: Digital Signaling |
PDF |
-- |
| L04: LTI Systems |
PDF |
§2 |
| L05: ISI & Deconvolution |
PDF |
§2.2–2.3, §3 |
| L06: Noise & Bit Errors |
PDF |
§4 |
| L07: More Noise & Bit Errors |
PDF |
§5.2 |
| L08: Error Correcting Codes |
PDF |
§6 |
| L09: More Error Correcting Codes |
PDF |
§6 |
| L10: Convolutional Codes |
PDF |
§8 |
| L11: Viterbi Decoder |
PDF |
§9 |
| L12: Sharing & MAC Protocols |
PDF |
§10 |
| L13: More MAC Protocols |
PDF |
§10 |
| L14: Frequency Domain |
PDF |
Handout #1
Handout #2
|
| L15: Frequency Response |
PDF |
| L16: Modulation |
PDF |
Handout #3
|
| L17: More Modulation |
PDF |
| L18: Switching |
PDF |
§17 |
| L19: Distance-Vector Routing |
PDF |
§18, §19 |
| L20: Link-state Routing |
PDF |
| L21: Reliable Data Transport |
PDF |
§20 |
| L22: Sliding Window Protocol |
PDF |
§20 |
| L23: Evolution of Networks |
PDF |
-- |
| L24: Wrap-up |
PDF |
-- |
|
|
| PSets |
PSet PS1, due Feburary 10, 2011 @ 0600.
PSet PS2, due Feburary 17, 2011 @ 0600.
PSet PS3, due Feburary 24, 2011 @ 0600.
PSet PS4, due March 10, 2011 @ 0600.
PSet PS5, due March 17, 2011 @ 0600.
PSet PS6, due March 31, 2011 @ 0600.
PSet PS7, due April 7, 2011 @ 0600.
PSet PS8, due April 21, 2011 @ 0600.
PSet PS9, due April 28, 2011 @ 0600.
PSet PS10, due May 5, 2011 @ 0600.
|
|
Tutorial
Problems |
For Quiz 1:
- Encoding Information
- Digital Signaling
- LTI Systems, Intersymbol Interference, Deconvolution
Topic list:
- measuring information received, either as a reduction in equally-probable choices, or as a change in entropy
- Huffman codes, expected message length and its relation to entropy
- LZW encoding and decoding, with emphasis on the relation between what gets sent by the encoder and the entries in the string table, and on what happens to each incoming index at the decoder (entries in its string table, outputs it generates)
- LTI systems, unit sample response, step response, relation between those two responses
- computing response using convolution sum
- series and parallel connections of LTI systems
- eye diagram: notion of "worst-case 0" and "worst-case 1". Width of the eye, choice of threshold to maximize noise margin
- deconvolution, difference equation for w[n], sensitivity to noise (small h[0]), stability criteria
For Quiz 2:
- Noise & Bit Errors
- Error Correcting Codes
- MAC Protocols
- Frequency Domain & Filters
Topic list:
- Relationship between BER and SNR
- Estimating BER using eye diagram and Gaussian CDF
- Choosing digitization threshold to minimize BER
- Hamming distance, relation to error detection and correction
- (n,k,d) block codes
- Single-error correction from syndrome bits, Hamming codes
- Convolutional codes, generators, constraint length (k), code rate (1/r)
- Trellis diagram, most-likely path
- Viterbi algorithm, path metrics, hard & soft branch metrics
- Channel sharing, utilization, fairness
- TDMA
- Contention-based sharing: slotted and unslotted Aloha, stabilization
- CSMA
- Fourier series, analysis and synthesis equations, spectral coefficients
- Frequency response of LTI systems, relation between H(ejΩ) and h[n]
- LTI systems with a frequency response that goes to zero at a pair of frequencies
- Filters, low-pass, high-pass
- series and parallel connection of filters
For Quiz 3:
- Modulation
- Switching, Little's Law
- Routing
- Reliable Data Transport
Topic list:
- Modulation
- modulation of band-limited signals
- frequency domain plots of modulated signals
- demodulation, low-pass filter
- demodulation phase, effect of channel delay
- quadrature demodulation
- Circuit switching
- establish, communicate, tear down
- sharing a link with TDM (guaranteed bandwidth, latency)
- pros and cons
- Packet switching
- addressing, routing, forwarding
- statistical multiplexing, bursty traffic
- queues and Little's Law
- Network routing
- routing table, packet forwarding
- hop counts, dealing with routing loops
- routing
- determining neighbors, HELLO protocol
- sending advertisements
- link state: flood network with each node's neighbor list
- distance vector: send routing table
- integrating advertisements (building/maintaining routing table)
- link state: Dijkstra's shortest-path algorithm
- distance vector: Bellman-Ford, count-to-infinity
- path vector
- bandwidth consumed by routing info, rate of convergence
- Reliable data delivery
- unique pkt sequence numbers for ordering, identifying missing packets
- ACKs from receiver, notion of round trip time, prob of pkt loss
- stop-and-wait protocol, timeouts for missing packets
- choosing timeout, estimating from RTT measurements using EWMA
- sliding window protocol, ideal window size -- Little's Law and delay/bandwidth product, thoughput
|
|