E2 301 : Topics in Multi User Communication

August - December 2007

Instructor

Rajesh Sundaresan

Teaching Assistant

Premkumar K.

Announcements

Due date for term paper on research theme: 4 PM, Wednesday 31, October 2007.
Due date for report on term paper: 4 PM on the 7th day after your presentation.
Due date for HW2: 4 PM, Tuesday 16, October 2007.
Due date for programming assignment: 4 PM, Thursday 04, October 2007.
Research paper and team selection meeting: September 06, 2007, 5:30-6:30 PM
Homework 1: Deadline: September 06, 2007, 4:00 PM
Problem session: September 05, 2007, 5:30-6:30 PM

Lecture Hours

4:00 - 5:30 PM on Tuesdays and Thursdays
Make up classes: 4:00 - 5:30 PM on Wednesdays

Location

ECE 1.07

About the Course

Multiple-access channels - capacity analysis, structural properties, superposition
Interference channels
Broadcast channels - review and capacity analysis
Multiterminal source coding
CEO problem

Prerequisites

Random Processes (E2-202)
Information Theory (E2-201) or Information and Coding Theory 1 (E2-206)

Course Grade

30% - Review report of a research paper
20% - Presentation
20% - Report on a research theme
30% - Three home works (one programming assignment)

Lecture Notes

Lecture 0: Organisational meeting
Lecture 1: Multiple access channels - examples, definitions
Lecture 2: Capacity region - convexity, achievability
Lecture 3: Frequency typicality
Lecture 4: Capacity region - achievability, converse
Lecture 5: Polymatroids, Convex hull and time-sharing variable
Lecture 6: Equivalence of convex hull and time-sharing, auxiliary variable size, superposition coding
Lecture 7: Han's generalisations
Lecture 8: Interference channels
Lecture 9: Modified interference channels
Lecture 10: Fourier-Motzkin elimination, outer bounds of interference channels
Lecture 11: Gaussian interference channels, degraded interference channels, Z-channel
Lecture 12: Broadcast channels - examples, definitions
Lecture 13: Broadcast channels - outer bounds
Lecture 14: Marton's achievability region for broadcast channel
Lecture 15: Korner-Marton, ElGamal converses for broadcast channel
Lecture 16: MIMO Broadcast channels - discussion on capacity analysis (No lecture notes)
Lecture 17: Multiterminal distributed source coding
Lecture 18: Slepian Wolf theorem - converse, generalization
Lecture 19: Network - cutset bounds
Lecture 20: Multi-terminal source coding over a network to a single destination
Lecture 21: Source coding networks - networks with helpers
Lecture 22: Distributed function computation

Homework/Assignment

Student presentations

Credit presentation: 1 hr. 10 minutes. Questions: 10-minutes
Audit presentation: 40 minutes. Questions: 5 minutes

Presentation schedule:

Date	Presenter	Title	Report due
Thursday 04 Oct 2007, 4 PM	Venkatesan	E.Kushilevitz, "Communication complexity - survey."
Thursday 06 Nov 2007, 4 PM	Vinodh	G.Kramer, M.Gastpar, and P.Gupta, "Cooperative strategies and capacity theorems for relay networks," IEEE Trans. Inform. Theory, vol. IT-51, pp. 3037-3063, Sep. 2005.	13 Nov 2007, 4 PM
Tuesday 08 Nov 2007, 4 PM	Arun	S.Venkatesan and V.Anantharam, "The common randomness capacity of a network of discrete-memoryless channels," IEEE Trans. Inform. Theory, vol. IT-46, pp. 367-387, Mar. 2000.	15 Nov 2007, 4 PM
Tuesday 13 Nov 2007, 4 PM	Krishnakumar	A.Ozgur, O.Leveque, and D.Tse, "Hierarchical cooperation achieves optimal capacity scaling in adhoc networks," IEEE Trans. Inform. Theory, vol. IT-53, pp. 3549-3572, Oct. 2007.	20 Nov 2007, 4 PM
Tuesday 20 Nov 2007, 4 PM	Chandramani	R.J.La and V.Anantharam, ''A game-theoretic look at the Gaussian multiaccess channel," Chapter in Advances in Network Information Theory, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 66, published by AMS.
Tuesday 20 Nov 2007, 4:45 PM	Vineeth	Y.-S.Liu and B.L.Hughes, "A new universal random coding bound for the multiple access channel," IEEE Trans. Inform. Theory, Vol. IT-42, pp. 376-386, Mar. 1996.
Thursday 15 Nov 2007, 5:30 PM	Avhishek	D.Tse, P.Viswanath and L.Zheng, "Diversity-multiplexing tradeoff in multiple access channels," IEEE Trans. Inform. Theory, vol. IT-50, pp. 1859-74, Sep. 2004.
Wednesday 21 Nov 2007, 5:00 PM	Sreeram	A.S.Avestimehr, S.N.Diggavi, and D.N.C.Tse, "A Deterministic Approach to Wireless Relay Networks," Submitted, IEEE Trans. Inform. Theory
Wednesday 21 Nov 2007, 5:45 PM	Birenjith	N.Jindal, S.Vishwanath, and A.Goldsmith, "On the Duality of Gaussian Multiple-Access and Broadcast Channels", IEEE Trans. Inform. Theory, Vol.IT-50, May 2004.
Thursday 22 Nov 2007, 4 PM	Naveen	A.S.Avestimehr and D.N.C.Tse, "Outage Capacity of the Fading Relay Channel in the Low-SNR Regime," IEEE Trans. Inform. Theory, Vol.IT-53, Apr. 2007.
Thursday 22 Nov 2007, 4:45 PM	Premkumar	M.Franceschetti, O.Dousse, D.Tse, and P.Thiran, "Closing the gap in the capacity of wireless networks via percolation theory," IEEE Trans. Inform. Theory, Vol. IT-53, pp. 1009-1018, Mar. 2007.

Reference:

T.M.Cover, and J.A.Thomas, Elements of information theory, McGraw Hill, Wiley, 2006.
E.C.van der Meulen, "A survey of multi-way channels in information theory: 1961-1976," IEEE Trans. Inform. Theory, Vol. IT-23, pp.1-37, Jan. 1977.
T.S.Han, "The capacity region of general multiple-access channel with certain correlated sources," Information and Control, Vol. 40, Issue 1, pp. 37-60, Jan. 1979.
A.J.Grant, B.Rimoldi, R.L.Urbanke, and P.A.Whiting, "Rate-splitting multiple access channels for discrete memoryless channels," IEEE Trans. Inform. Theory, Vol. IT-47, pp. 873-890, Mar. 2001.
B.Rimoldi and R.Urbanke ''A rate-splitting approach to the Gaussian multiple-access channel,'' IEEE Trans. Inform. Theory, Vol. IT-42, pp. 364-375, Mar. 1996.
T.S.Han and K.Kobayashi ''A new achievable rate region for the interference channel,'' IEEE Trans. Inform. Theory, Vol. IT-27, pp. 49-60, Jan. 1981.
M.H.M.Costa, "On the Gaussian interference channel," IEEE Trans. Inform. Theory, vol. IT-31, pp.607-615, Sep. 1985.
H.Sato, "On degraded Gaussian two-user channels", IEEE Trans. Inform. Theory, vol. IT-24, pp. 637-640, Sep. 1978.
G.Kramer, "Outer bounds on the capacity of Gaussian interference channels", IEEE Trans. Inform. Theory, vol. IT-50, pp. 581-586, Mar. 2004.
I.Sason, "On achievable rate regions for the Gaussian interference channel", IEEE Trans. Inform. Theory, vol. IT-50, pp. 1345-1356, Jun. 2004.
E.Telatar and D.Tse, "Bounds on the capacity region of a class of interference channels", ISIT 2007, Nice, France, Jun. 2007.
K.Marton, "A coding theorem for the discrete memoryless broadcast channel", IEEE Trans. Inform. Theory, vol. IT-25, pp.306-311, May. 1979.
A.A.El Gamal, "The capacity of a class of braodcast channels", IEEE Trans. Inform. Theory, vol. IT-25, pp.166-169, Mar. 1979.
H.Weingarten, Y.I.Steinberg, and S.Shamai, "The capacity region of the Gaussian MIMO broadcast channel", IEEE Trans. Inform. Theory, vol. IT-52, pp. 3936-3964, Sep. 2006.
C.Nair and A.A.El Gamal, "An outer bound to the capacity region of the broadcast channel", IEEE Trans. Inform. Theory, vol.IT-53, Jan. 2007.
M. van Dijk, "On a special class of broadcast channels with confidential messages", IEEE Trans. Inform. Theory, vol.IT-43, Mar. 1997.
T.S.Han, "Slepian-Wolf-Cover theorem for networks of channels", Information and control, vol. 47, pp. 67-83, 1980.
I.Csiszar and J.Korner, "Towards a general theory of source networks", IEEE Trans. Inform. Theory, vol.IT-26, Mar. 1980.
T.S.Han and K.Kobayashi, "A dichotomy of functions F(X,Y) of correlated sources (X,Y) from the viewpoint of the achievable rate region", IEEE Trans. Inform. Theory, Vol.IT-33, Jan. 1987.

Links

For updating this page contact