ECE 729 Theory of Information Processing and Transmission, Spring 1997


Books to be placed on reserve
Syllabus
Class Schedule for Spring 1997
1/21	Went over syllabus.  Survey of course topics.
	Introduction to variable-length codes, p. 1 through top half of p. 3.

1/23	Covered pages 3 - top of 9.

1/28 Covered pages 9 - first example on p. 13. 1/30 Finished handout on variable-length codes. Started handout on fixed-length codes, pages 1 - top of 2. Assigned HW #1. DUE Thur. 2/6.
2/4 Proved the source coding theorem in the fixed-length code handout. Handed out notes for results proved last time about closure and convexity of the set of achievable rates. Handed out notes for next section on the discrete memoryless channel (DMC). Began motivation for DMC model. 2/6 Covered pages 1-6 in DMC handout.
2/11 Covered pages 6-10.2 in DMC handout. 2/13 Class attended seminar on Pilot Symbol Assisted Modulation.
2/18 Covered pages 10.2 - 14 in DMC handout. Assigned HW #2. DUE Thur. 2/27. 2/20 Stated Lemma and proof to go on the back of p. 13 in the DMC handout. Also gave "grand scenario" for a binary source sequence broken into blocks for transmission over a DMC. Also connected this to the source coding theorem. Covered pages 14-17 in the handout.
2/25 Covered pages 17-most of 22. Properties of entropy and mutual information. Fano's inequality. Exam scheduled for Tues. Mar. 11. 2/27 Covered pages 22-top of 27.
3/4 Finished discussion of BEC on p. 27. Began covering the Arimoto- Blahut Alg. pages 28-30. 3/6 Covered direct maximization of I(p x W) -- Not in handouts. Finished covering Arimoto-Blahut Alg., pages 31-34. Handed out review sheet for exam 1.
3/10 Monday: Exam 1 Review in room 2265 Engr. Hall at 5pm. 3/11 Exam 1, in class 3/13 Went over exam. Covered pages 35-36 of DMC handout on the maximal probability of error criterion. Distributed handout on the Gaussian channel.
3/18 Finished DMC handout, maximal prob. of error. Began handout on Gaussian channel pages 1-5. 3/20 Covered pages 5-10 and page 12. 3/21 Friday: Last day to drop - undergraduates and specials
3/25 No class - Spring Recess 3/27 No class - Spring Recess
4/1 Finished Gaussian Channel handout. 4/3 Reviewed handout on convexity. Discussed A/D-D/A systems and introduced quantization. Derived the Lloyd-Max Algorithm. Distributed handout on Rate Distortion Theory. Assigned HW #5. DUE Thur. 4/10.
4/8 Distributed handout on the Lloyd-Max Algorithm. Covered pages 1-4 of the Rate Distortion Handout. 4/10 Covered pages 5-7 of Rate Distortion Handout.
4/15 Covered pages 8-15 of Rate Distortion Handout (mostly the proof of the forward theorem). 4/17 Finished Rate Distortion Handout. Don't worry about the Shannon Lower Bound or the Arimoto-Blahut Algorithm for computing \tilde R(D). 4/18 Friday: Last day to drop - graduate students
4/22 Source Coding Revisited - Discrete Stationary Sources Covered everything but the proof of the Shannon-McMillan-Breiman Theorem. 4/24 Proved the Shannon-McMillan-Breiman Theorem. Distributed handout on the Lempel-Ziv Algorithm and Multiple-Access Channel. Began discussion of Lempel-Ziv Alg. Assigned HW #6 and #7(Problems 1 and 2 only). DUE Thur. 5/1.
4/29 Distributed corrections to Lempel-Ziv Handout. Discussed them and Lemma on p. 4. Distributed handout on Caratheodory's Theorem. 5/1 Multiple-Access Channel. Assigned HW #7(Problem 3) and HW #8. DUE Thur. 5/8.
5/6 Proved that R* is convex (pp. 17-19), proved that the set V in definition of R* can be restricted to have cardinality 3 (pp. 20-22). 5/8 Proved convex-hull characterization of R*. Derived capacity region of noiseless adder MAC. Distributed take-home final.