1 Introduction: A layered view of digital communication  
2 Discrete source encoding Problem set 1 out
3 Memory-less sources, prefix free codes, and entropy  
4 Entropy and asymptotic equipartition property Problem set 1 due and problem set 2 out
5 Markov sources and Lempel-Ziv universal codes  
6 Quantization, high-rate quantizers, and waveform encoding Problem set 2 due and problem set 3 out
7 Fourier series and Fourier transforms  
8 Measure Problem set 3 due and problem set 4 out
9 Discrete-time Fourier transforms and sampling theorem  
10 Degrees of freedom, orthonormal expansions, and aliasing Problem set 4 due and problem set 5 out
11 Signal space, projection theorem, and modulation  
12 Nyquist theory, pulse amplitude modulation (PAM), quadrature amplitude modulation (QAM), and frequency translation Problem set 5 due
13 Random processes Problem set 6 out
14 Jointly Gaussian random vectors and processes and white Gaussian noise (WGN)  
15 Linear functionals and filtering of random processes Problem set 6 due and problem set 7 out
16 Review; introduction to detection  
17 Detection for random vectors and processes Problem set 7 due and problem set 8 out
18 Theorem of irrelevance, M-ary detection, and coding Problem set 8 due and problem set 9 out
19 Review of theorem of irrelevance and introduction to wireless communication  
20 Introduction to wireless communication (cont.) Problem set 9 due and problem set 10 out
21 Discrete-time baseband models for wireless channels  
22 Doppler spread, time spread, coherence time, and coherence frequency Problem set 10 due and problem set 11 out
23 Detection for flat Rayleigh fading and incoherent channels, and Rake receivers  
24 Case study - Code Division Multiple Access (CDMA)  
25 Review Final exam taken 7 days after Ses #25