ECE287A: Course Information

Professor Young-Han Kim, UCSD, Spring Quarter 2008–09

Course Description

This course studies information theoretic limits of communication (channel coding) and compression (source coding) in networks. The focus is on basic coding techniques for simple network models, with the ultimate goal of understanding fundamental principles behind information flow over general networks. Topics include multiple access channels, broadcast channels, interference channels, relay channels; channels with state, feedback and two-way channels; Slepian-Wolf distributed data compression, source coding with side information, multiple descriptions; multiple-antenna (MIMO) Gaussian networks, network information flow, asymptotic capacity of large wireless networks.

Lectures

TuTh 11:00 am-12:20 pm, Center Hall 224C.

Course Requirements and Grading

Weekly homework assignments: Homework will be normally be assigned each Thursday and due the following Thursday in class. Late homework will not be accepted. You are allowed, even encouraged, to work on the homework in small groups, but you must write up your own homework to hand in. Only two random homework assignments (per students) will be graded on a scale of 1–5. (Missing assignments will get zero score.)

Final project: During the last week of the quarter, you should present in-depth survey of a topic not covered in the lecture notes or new research results in a related area. The project should be done in groups of two students. Details including potential project topics will be annouced later.

Grading: Homework 1/4, final 3/4. We reserve the right to change the weights later.

Prerequisite

ECE255AN (Information Theory) or equivalent. A student with no prior exposure to information theory can barely survive this course.