Lecture 1: The Multiple Access Channel. Copyright G. Caire 12
|
|
- Debra McKenzie
- 5 years ago
- Views:
Transcription
1 Lecture 1: The Multiple Access Channel Copyright G. Caire 12
2 Outline Two-user MAC. The Gaussian case. The K-user case. Polymatroid structure and resource allocation problems. Copyright G. Caire 13
3 Two-user MAC W 1 Tx1 X 1 P Y { W c 1, W c 2 } Y X1,X 2 Rx W 2 Tx2 X 2 Copyright G. Caire 14
4 The networking approach to the MAC The networking approach to the MAC is to avoid multiuser interference in the presence of users random access. Examples: Aloha, CSMA, , Packet-Reservation Multiple-Access, TDMA/FDMA. Another line of thought focused on signal design in order to make interference similar to noise. Examples: CDMA, UWB. Information theory shows that neither of the above approaches is generally optimal (although it can be optimal or near-optimal in some cases). Copyright G. Caire 15
5 Definitions Let {X 1 X 2,P Y X1,X 2, Y} denote a memoryless stationary MAC. A (2 nr 1, 2 nr 2,n) MAC code is defined by the two message sets M 1 = {1,...,2 nr 1 }, M 2 = {1,...,2 nr 2 } Two encoding functions f 1 : M 1! X n 1, f 2 : M 2! X n 2 such that x 1 (m 1 )=f 1 (m 1 ) and x 2 (m 2 )=f 2 (m 2 ). A decoding function g : Y n! M 1 M 2 Copyright G. Caire 16
6 Capacity region The average probability of error is defined as P e (f 1,f 2,g)=P ( M c 1, M c 2 ) 6= (M 1,M 2 ), where M 1,M 2 are independent and uniformly distributed over M 1 and M 2, respectively, and where X n 1 = x 1 (M 1 ),X n 2 = x 2 (M 2 ), ( c M 1, c M 2 )=g(y n ). The MAC capacity region C is the closure of the set of all pairs (R 1,R 2 ) for which there exists a sequence of codes (f (n) 1,f (n) 2,g (n) ) with rates (R 1,R 2 ) and P e (f (n) 1,f (n) 2,g (n) )! 0 as n!1. Copyright G. Caire 17
7 Simple inner and outer bounds Time-sharing inner bound (TDMA): let C 1 = max I(X 1 ; Y X 2 = x 2 ), C 2 = max I(X 2 ; Y X 1 = x 1 ) P X1,x 2 2X 2 P X2,x 1 2X 1 then, the following region is achievable R 1 C 1 + R 2 C 2 apple 1 Sum-rate outer bound: R 1 + R 2 apple where (X 1,X 2 ) P X1 (x 1 )P X2 (x 2 ). max I(X 1,X 2 ; Y ) P X1,P X2 Copyright G. Caire 18
8 How the capacity region looks like? d on the capacity region of any DM-MAC R 2 C 12 Time-division inner bound C 2 Outer bound? R 1 C 1 Notice: from a time-sharing argument we have that C must be a convex region. Copyright G. Caire 19
9 Capacity region of the 2-user MAC Theorem 1. MAC Capacity region: The MAC capacity region is the convex closure of the rates satisfying R 1 apple I(X 1 ; Y X 2,Q), R 2 apple I(X 2 ; Y X 1,Q), R 1 + R 2 apple I(X 1,X 2 ; Y Q) for some P Q P X1 QP X2 Q. } apple apple R 2 I(X 2 ; Y X 1 ) I(X 2 ; Y ) I(X 1 ; Y ) I(X 1 ; Y X 2 ) R 1 Copyright G. Caire 20
10 Proof: Achievability Fix P Q, P X1 Q and P X2 Q. We shall show that any point in the interior of R(X 1,X 2,Q) (pentagon) is achievable. Codebook generation: generate a typical q with i.i.d. components P Q, and independently two codebooks {x 1 (m 1 ):m 1 2 [1 : 2 nr 1]} and {x 2 (m 2 ): m 2 2 [1 : 2 nr 2]} with independent entries P X1 Q( q i ) and P X2 Q( q i ), respectively. Encoding: to send message m 1, encoder 1 transmits x 1 (m 1 ). encoder 2 sends x 2 (m 2 ). Similarly, Decoding: Declare bm 1, bm 2 if this is the unique index pair such that (x 1 ( bm 1 ), x 2 ( bm 2 ), y) 2 T (n) (X 1,X 2,Y q), otherwise declare error. Copyright G. Caire 21
11 By symmetry we have P e = P(E M 1 =1,M 2 = 1) where E = {g(y n ) 6= (1, 1)}. When analyzing the random coding ensemble average error probability, (Q n,x n 1 (m 1 ),X n 2 (m 2 ),Y n ) are random vectors. We consider the possible joint conditional probability distributions of (X n 1 (m 1 ),X n 2 (m 2 ),Y n ) given Q n : m 1 m 2 joint pmf 1 1 P X1 QP X2 QP Y X1,X 2 * 1 P X1 QP X2 QP Y X2,Q 1 * P X1 QP X2 QP Y X1,Q * * P X1 QP X2 QP Y Q Copyright G. Caire 22
12 The error event E is contained in the union of the following events: E1 c = {(Q n,x1 n (1),X2 n (1),Y n ) /2 T (n) (Q, X 1,X 2,Y)} E 2 = {(Q n,x n 1 (m 1 ),X n 2 (1),Y n ) 2 T (n) (Q, X 1,X 2,Y) for some m 1 6=1} E 3 = {(Q n,x n 1 (1),X n 2 (m 2 ),Y n ) 2 T (n) (Q, X 1,X 2,Y) for some m 2 6=1} E 4 = {(Q n,x1 n (m 1 ),X2 n (m 2 ),Y n ) 2 T (n) (Q, X 1,X 2,Y) for some m 1 6=1,m 2 6=1} Copyright G. Caire 23
13 We bound each term: 1. By LLN P(E1 M c 1 =1,M 2 = 1)! P(E 2 M 1 =1,M 2 = 1) apple 2 n(i(x 1;Y X 2,Q) R 1 ( )). 3. P(E 3 M 1 =1,M 2 = 1) apple 2 n(i(x 2;Y X 1,Q) R 2 ( )). 4. P(E 4 M 1 =1,M 2 = 1) apple 2 n(i(x 1,X 2 ;Y Q) R 1 R 2 ( )). The result follows from the union bound. Copyright G. Caire 24
14 Proof: Converse Assume that there is a sequence of (R 1,R 2,n)-codes such that P e (n) n!1.! 0 as The n-letter multivariate joint distribution is given by ny (M 1,M 2,X1 n,x2 n,y n ) 2 n(r 1+R 2 ) P Y X1,X 2 (y i x 1i,x 2i ) 1{X n 1 = x 1 (m 1 )} 1{X n 2 = x 2 (m 2 )} Copyright G. Caire 25
15 Sum rate: from Fano inequality we have: H(M 1,M 2 Y n ) apple 1+n(R 1 + R 2 )P (n) e apple n n H(M 1 Y n,m 2 ) apple H(M 1,M 2 Y n ) apple n n H(M 2 Y n,m 1 ) apple H(M 1,M 2 Y n ) apple n n Therefore: n(r 1 + R 2 ) = H(M 1,M 2 ) H(M 1,M 2 Y n )+H(M 1,M 2 Y n ) apple I(M 1,M 2 ; Y n )+n n nr 1 = H(M 1 M 2 ) H(M 1 Y n,m 2 )+H(M 1 Y n,m 2 ) apple I(M 1 ; Y n M 2 )+n n nr 2 = H(M 2 M 1 ) H(M 2 Y n,m 1 )+H(M 2 Y n,m 1 ) apple I(M 2 ; Y n M 1 )+n n Copyright G. Caire 26
16 Sum rate inequality n(r 1 + R 2 ) apple I(M 1,M 2 ; Y n )+n n nx = I(M 1,M 2 ; Y i Y i 1 )+n n = = = nx I(M 1,M 2,X 1i,X 2i ; Y i Y i 1 )+n n nx I(X 1i,X 2i ; Y i Y i 1 )+I(M 1,M 2 ; Y i Y i 1,X 1i,X 2i )+n n nx I(X 1i,X 2i ; Y i )+n n Copyright G. Caire 27
17 Individual rate inequalities nr 1 apple I(M 1 ; Y n M 2 )+n n nx = I(M 1 ; Y i Y i 1,M 2 )+n n = apple = = = nx I(M 1 ; Y i Y i nx I(M 1,M 2,Y i nx I(X 1i,M 1,M 2,Y i nx 1,M 2,X 2i )+n n 1 ; Y i X 2i )+n n 1 ; Y i X 2i )+n n I(X 1i ; Y i X 2i )+I(M 1,M 2,Y i 1 ; Y i X 1i,X 2i ) nx I(X 1i ; Y i X 2i )+n n + n n Copyright G. Caire 28
18 Multiletter rate inequalities We arrive at R 1 apple 1 n R 2 apple 1 n R 1 + R 2 apple 1 n nx I(X 1i ; Y i X 2i )+ n nx I(X 2i ; Y i X 1i )+ n nx I(X 1i,X 2i ; Y i )+ n Notice that these mutual informations depend on the marginal distributions at time i induced by the joint distribution induced by the specific sequence of codes that we have supposed to exist. Copyright G. Caire 29
19 From multiletter to single-letter Time-sharing argument: define a new random variance Q Uniform[1 : n] independent of (X n 1,X n 2,Y n ). We can write nx R 1 apple 1 n I(X 1i ; Y i X 2i )+ n = I(X 1Q ; Y Q X 2Q,Q)+ n Now we identify X 1 = X 1Q,X 2 = X 2Q,Y = Y Q and, letting n!1, we obtain R 1 apple I(X 1 ; Y X 2,Q) R 2 apple I(X 2 ; Y X 1,Q) R 1 + R 2 apple I(X 1,X 2 ; Y Q) for some (Q, X 1,X 2 ) P Q P X1 QP X2 Q. Copyright G. Caire 30
20 The Gaussian MAC The Gaussian MAC is described by Y = g 1 X 1 + g 2 X 2 + Z Real case: X 1, X 2, Y = R, g 1,g 2 2 R, Z N (0,N 0 /2). Complex circularly symmetric case: X 1, X 2, Y = C, g 1,g 2 2 C, Z CN(0,N 0 ). The input constraints are given by 1 n nx x k,i (m k ) 2 apple E sk, 8 m k 2 [1 : 2 nr k], k =1, 2 Copyright G. Caire 31
21 For the real case, we define S 1 =2g1E 2 s1 /N 0 and S 2 =2g2E 2 s2 /N 0, and the function C(S) = 1 2 log(1 + S). For the complex case, we define S 1 = g 1 2 E s1 /N 0 and S 2 = g 2 2 E s2 /N 0, and the function C(S) = log(1 + S). Choosing X 1,X 2 Gaussian and independent we find the region R 1 apple C(S 1 ) R 2 apple C(S 2 ) R 1 + R 2 apple C(S 1 + S 2 ) It is easy to see that this is in fact the capacity region (no convex hull needed since it is achieved by a single input distribution). Copyright G. Caire 32
22 The Wyner-Cover pentagon apple R 2 C(S 2 ) C(S 2 /(1 + S 1 )) C(S 1 /(1 + S 2 )) C(S 1 ) R 1 Copyright G. Caire 33
23 Comparison with multiaccess techniques R 2 High SNR R 2 Low SNR C(S 2 ) TDMA C(S 2 ) S2 C S 1 +1 S2 C S 1 +1 S1 C S 2 +1 C(S 1 ) Treating other codeword as noise R 1 S1 C S 2 +1 C(S 1 ) R 1 Copyright G. Caire 34
24 Generalization to K users Theorem 2. K-user MAC capacity region. The capacity region of the K-user MAC with common message is given by the convex closure of the set of rates satisfying X R k apple I(X K ; Y X K c,q) k2k for all K [1 : K] (we use the notation X K = {X k : k 2 K}), for some P Q Q K k=1 P X k Q. Copyright G. Caire 35
25 K-user Gaussian MAC The Gaussian MAC with K users is described by Y = KX g k X k + Z k=1 with 1 P n n x k,i(m k ) 2 apple E sk, 8 k =1,...,K and all messages m k. Letting S k =2gk 2E sk/n 0 (real case), or S k = g k 2 E sk /N 0 (complex case), we have: ( X C(S 1,...,S K )= R k apple C X! ) S k 8 K {1,...,K} k2k k2k Copyright G. Caire 36
26 Resource allocation on the Gaussian MAC In resource allocation problems we care about the transmit power (not receive SNR): let k = S k / g k 2, such that X R k apple C X! g k 2 k k2k k2k We are interested in solving problems of the following form: maximize subject to KX w k R k, k=1 R 2 C KX k=1 k apple Copyright G. Caire 37
27 Polymatroid structure of C Definition 1. Sub-modular rank function. Let K =[1: K] and let f :2 [1:K]! R + denote a set function with the following properties: 1. f(;) =0(normalized). 2. f(k) f(k 0 ) if K K 0 (non-decreasing). 3. f(k)+f(k 0 ) f(k [ K 0 )+f(k \ K 0 ) (submodular). Definition 2. Polymatroid. The polyhedron defined by the inequalities x 2 R K +, and X x k apple f(k), 8 K [1 : K] k2k where f :2 [1:K]! R + is a submodular rank function, is called a polymatroid. Copyright G. Caire 38
28 Copyright G. Caire 39
29 Polymatroids and linear programming Suppose that we are interested in the problem of maximizing the weighted rate-sum: KX maximize w k R k, subject to R 2 C k=1 This is a linear program with K! relevant constraints, corresponding to all possible decoding orders. Using the fact that C is a polymatroid, we immediately have the optimal solution: Let denote the permutation of {1,...,K} that sorts the weights in increasing order: w 1 apple w 2 apple apple w K Copyright G. Caire 40
30 Then, the weighted rate-sum is maximized by the vertex R, obtained by decoding in the order, i.e., 1! 2!! K. Namely, we have R sum (w) = =! KX g k 2 w k C k 1+ P K j=k+1 g j 2 j 0 1 KX KX (w k w k 1 g j 2 A j k=1 k=1 j=k where w 0 = w 0 =0. Notice that the solution is a sum of concave functions of 1,..., K, which can be further maximized subject to the constraint P K k=1 k apple, if required. Copyright G. Caire 41
31 End of Lecture 1 Copyright G. Caire 42
Lecture 5: Channel Capacity. Copyright G. Caire (Sample Lectures) 122
Lecture 5: Channel Capacity Copyright G. Caire (Sample Lectures) 122 M Definitions and Problem Setup 2 X n Y n Encoder p(y x) Decoder ˆM Message Channel Estimate Definition 11. Discrete Memoryless Channel
More informationInformation Theory. Lecture 10. Network Information Theory (CT15); a focus on channel capacity results
Information Theory Lecture 10 Network Information Theory (CT15); a focus on channel capacity results The (two-user) multiple access channel (15.3) The (two-user) broadcast channel (15.6) The relay channel
More informationEE 4TM4: Digital Communications II. Channel Capacity
EE 4TM4: Digital Communications II 1 Channel Capacity I. CHANNEL CODING THEOREM Definition 1: A rater is said to be achievable if there exists a sequence of(2 nr,n) codes such thatlim n P (n) e (C) = 0.
More informationLecture 6: Gaussian Channels. Copyright G. Caire (Sample Lectures) 157
Lecture 6: Gaussian Channels Copyright G. Caire (Sample Lectures) 157 Differential entropy (1) Definition 18. The (joint) differential entropy of a continuous random vector X n p X n(x) over R is: Z h(x
More informationDistributed Lossless Compression. Distributed lossless compression system
Lecture #3 Distributed Lossless Compression (Reading: NIT 10.1 10.5, 4.4) Distributed lossless source coding Lossless source coding via random binning Time Sharing Achievability proof of the Slepian Wolf
More informationLECTURE 13. Last time: Lecture outline
LECTURE 13 Last time: Strong coding theorem Revisiting channel and codes Bound on probability of error Error exponent Lecture outline Fano s Lemma revisited Fano s inequality for codewords Converse to
More informationInformation Theory for Wireless Communications. Lecture 10 Discrete Memoryless Multiple Access Channel (DM-MAC): The Converse Theorem
Information Theory for Wireless Communications. Lecture 0 Discrete Memoryless Multiple Access Channel (DM-MAC: The Converse Theorem Instructor: Dr. Saif Khan Mohammed Scribe: Antonios Pitarokoilis I. THE
More informationSimultaneous Nonunique Decoding Is Rate-Optimal
Fiftieth Annual Allerton Conference Allerton House, UIUC, Illinois, USA October 1-5, 2012 Simultaneous Nonunique Decoding Is Rate-Optimal Bernd Bandemer University of California, San Diego La Jolla, CA
More informationLecture 10: Broadcast Channel and Superposition Coding
Lecture 10: Broadcast Channel and Superposition Coding Scribed by: Zhe Yao 1 Broadcast channel M 0M 1M P{y 1 y x} M M 01 1 M M 0 The capacity of the broadcast channel depends only on the marginal conditional
More informationLecture 4 Noisy Channel Coding
Lecture 4 Noisy Channel Coding I-Hsiang Wang Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw October 9, 2015 1 / 56 I-Hsiang Wang IT Lecture 4 The Channel Coding Problem
More informationEE/Stat 376B Handout #5 Network Information Theory October, 14, Homework Set #2 Solutions
EE/Stat 376B Handout #5 Network Information Theory October, 14, 014 1. Problem.4 parts (b) and (c). Homework Set # Solutions (b) Consider h(x + Y ) h(x + Y Y ) = h(x Y ) = h(x). (c) Let ay = Y 1 + Y, where
More informationLecture 6 I. CHANNEL CODING. X n (m) P Y X
6- Introduction to Information Theory Lecture 6 Lecturer: Haim Permuter Scribe: Yoav Eisenberg and Yakov Miron I. CHANNEL CODING We consider the following channel coding problem: m = {,2,..,2 nr} Encoder
More informationError Exponent Region for Gaussian Broadcast Channels
Error Exponent Region for Gaussian Broadcast Channels Lihua Weng, S. Sandeep Pradhan, and Achilleas Anastasopoulos Electrical Engineering and Computer Science Dept. University of Michigan, Ann Arbor, MI
More informationOn the Capacity Region of the Gaussian Z-channel
On the Capacity Region of the Gaussian Z-channel Nan Liu Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 74 nkancy@eng.umd.edu ulukus@eng.umd.edu
More informationECE Information theory Final (Fall 2008)
ECE 776 - Information theory Final (Fall 2008) Q.1. (1 point) Consider the following bursty transmission scheme for a Gaussian channel with noise power N and average power constraint P (i.e., 1/n X n i=1
More informationMulticoding Schemes for Interference Channels
Multicoding Schemes for Interference Channels 1 Ritesh Kolte, Ayfer Özgür, Haim Permuter Abstract arxiv:1502.04273v1 [cs.it] 15 Feb 2015 The best known inner bound for the 2-user discrete memoryless interference
More informationShannon s noisy-channel theorem
Shannon s noisy-channel theorem Information theory Amon Elders Korteweg de Vries Institute for Mathematics University of Amsterdam. Tuesday, 26th of Januari Amon Elders (Korteweg de Vries Institute for
More informationLECTURE 10. Last time: Lecture outline
LECTURE 10 Joint AEP Coding Theorem Last time: Error Exponents Lecture outline Strong Coding Theorem Reading: Gallager, Chapter 5. Review Joint AEP A ( ɛ n) (X) A ( ɛ n) (Y ) vs. A ( ɛ n) (X, Y ) 2 nh(x)
More informationMultiaccess Channels with State Known to One Encoder: A Case of Degraded Message Sets
Multiaccess Channels with State Known to One Encoder: A Case of Degraded Message Sets Shivaprasad Kotagiri and J. Nicholas Laneman Department of Electrical Engineering University of Notre Dame Notre Dame,
More informationA Proof of the Converse for the Capacity of Gaussian MIMO Broadcast Channels
A Proof of the Converse for the Capacity of Gaussian MIMO Broadcast Channels Mehdi Mohseni Department of Electrical Engineering Stanford University Stanford, CA 94305, USA Email: mmohseni@stanford.edu
More informationOptimal Natural Encoding Scheme for Discrete Multiplicative Degraded Broadcast Channels
Optimal Natural Encoding Scheme for Discrete Multiplicative Degraded Broadcast Channels Bike ie, Student Member, IEEE and Richard D. Wesel, Senior Member, IEEE Abstract Certain degraded broadcast channels
More informationInformation Theory for Wireless Communications, Part II:
Information Theory for Wireless Communications, Part II: Lecture 5: Multiuser Gaussian MIMO Multiple-Access Channel Instructor: Dr Saif K Mohammed Scribe: Johannes Lindblom In this lecture, we give the
More informationA Summary of Multiple Access Channels
A Summary of Multiple Access Channels Wenyi Zhang February 24, 2003 Abstract In this summary we attempt to present a brief overview of the classical results on the information-theoretic aspects of multiple
More informationELEC546 Review of Information Theory
ELEC546 Review of Information Theory Vincent Lau 1/1/004 1 Review of Information Theory Entropy: Measure of uncertainty of a random variable X. The entropy of X, H(X), is given by: If X is a discrete random
More informationOn the Duality between Multiple-Access Codes and Computation Codes
On the Duality between Multiple-Access Codes and Computation Codes Jingge Zhu University of California, Berkeley jingge.zhu@berkeley.edu Sung Hoon Lim KIOST shlim@kiost.ac.kr Michael Gastpar EPFL michael.gastpar@epfl.ch
More informationMismatched Multi-letter Successive Decoding for the Multiple-Access Channel
Mismatched Multi-letter Successive Decoding for the Multiple-Access Channel Jonathan Scarlett University of Cambridge jms265@cam.ac.uk Alfonso Martinez Universitat Pompeu Fabra alfonso.martinez@ieee.org
More informationLECTURE 18. Lecture outline Gaussian channels: parallel colored noise inter-symbol interference general case: multiple inputs and outputs
LECTURE 18 Last time: White Gaussian noise Bandlimited WGN Additive White Gaussian Noise (AWGN) channel Capacity of AWGN channel Application: DS-CDMA systems Spreading Coding theorem Lecture outline Gaussian
More informationLecture 3: Channel Capacity
Lecture 3: Channel Capacity 1 Definitions Channel capacity is a measure of maximum information per channel usage one can get through a channel. This one of the fundamental concepts in information theory.
More informationAppendix B Information theory from first principles
Appendix B Information theory from first principles This appendix discusses the information theory behind the capacity expressions used in the book. Section 8.3.4 is the only part of the book that supposes
More informationDraft. On Limiting Expressions for the Capacity Region of Gaussian Interference Channels. Mojtaba Vaezi and H. Vincent Poor
Preliminaries Counterexample Better Use On Limiting Expressions for the Capacity Region of Gaussian Interference Channels Mojtaba Vaezi and H. Vincent Poor Department of Electrical Engineering Princeton
More informationRandom Access: An Information-Theoretic Perspective
Random Access: An Information-Theoretic Perspective Paolo Minero, Massimo Franceschetti, and David N. C. Tse Abstract This paper considers a random access system where each sender can be in two modes of
More informationLECTURE 3. Last time:
LECTURE 3 Last time: Mutual Information. Convexity and concavity Jensen s inequality Information Inequality Data processing theorem Fano s Inequality Lecture outline Stochastic processes, Entropy rate
More informationPerformance-based Security for Encoding of Information Signals. FA ( ) Paul Cuff (Princeton University)
Performance-based Security for Encoding of Information Signals FA9550-15-1-0180 (2015-2018) Paul Cuff (Princeton University) Contributors Two students finished PhD Tiance Wang (Goldman Sachs) Eva Song
More informationUCSD ECE 255C Handout #12 Prof. Young-Han Kim Tuesday, February 28, Solutions to Take-Home Midterm (Prepared by Pinar Sen)
UCSD ECE 255C Handout #12 Prof. Young-Han Kim Tuesday, February 28, 2017 Solutions to Take-Home Midterm (Prepared by Pinar Sen) 1. (30 points) Erasure broadcast channel. Let p(y 1,y 2 x) be a discrete
More informationSuperposition Encoding and Partial Decoding Is Optimal for a Class of Z-interference Channels
Superposition Encoding and Partial Decoding Is Optimal for a Class of Z-interference Channels Nan Liu and Andrea Goldsmith Department of Electrical Engineering Stanford University, Stanford CA 94305 Email:
More informationLecture 4 Capacity of Wireless Channels
Lecture 4 Capacity of Wireless Channels I-Hsiang Wang ihwang@ntu.edu.tw 3/0, 014 What we have learned So far: looked at specific schemes and techniques Lecture : point-to-point wireless channel - Diversity:
More informationLecture 5 Channel Coding over Continuous Channels
Lecture 5 Channel Coding over Continuous Channels I-Hsiang Wang Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw November 14, 2014 1 / 34 I-Hsiang Wang NIT Lecture 5 From
More informationCapacity bounds for multiple access-cognitive interference channel
Mirmohseni et al. EURASIP Journal on Wireless Communications and Networking, :5 http://jwcn.eurasipjournals.com/content///5 RESEARCH Open Access Capacity bounds for multiple access-cognitive interference
More informationDegrees of Freedom Region of the Gaussian MIMO Broadcast Channel with Common and Private Messages
Degrees of Freedom Region of the Gaussian MIMO Broadcast hannel with ommon and Private Messages Ersen Ekrem Sennur Ulukus Department of Electrical and omputer Engineering University of Maryland, ollege
More informationLecture 22: Final Review
Lecture 22: Final Review Nuts and bolts Fundamental questions and limits Tools Practical algorithms Future topics Dr Yao Xie, ECE587, Information Theory, Duke University Basics Dr Yao Xie, ECE587, Information
More informationNational University of Singapore Department of Electrical & Computer Engineering. Examination for
National University of Singapore Department of Electrical & Computer Engineering Examination for EE5139R Information Theory for Communication Systems (Semester I, 2014/15) November/December 2014 Time Allowed:
More informationA Comparison of Superposition Coding Schemes
A Comparison of Superposition Coding Schemes Lele Wang, Eren Şaşoğlu, Bernd Bandemer, and Young-Han Kim Department of Electrical and Computer Engineering University of California, San Diego La Jolla, CA
More informationPolar codes for the m-user MAC and matroids
Research Collection Conference Paper Polar codes for the m-user MAC and matroids Author(s): Abbe, Emmanuel; Telatar, Emre Publication Date: 2010 Permanent Link: https://doi.org/10.3929/ethz-a-005997169
More informationThe Gallager Converse
The Gallager Converse Abbas El Gamal Director, Information Systems Laboratory Department of Electrical Engineering Stanford University Gallager s 75th Birthday 1 Information Theoretic Limits Establishing
More informationChapter 4. Data Transmission and Channel Capacity. Po-Ning Chen, Professor. Department of Communications Engineering. National Chiao Tung University
Chapter 4 Data Transmission and Channel Capacity Po-Ning Chen, Professor Department of Communications Engineering National Chiao Tung University Hsin Chu, Taiwan 30050, R.O.C. Principle of Data Transmission
More informationA Comparison of Two Achievable Rate Regions for the Interference Channel
A Comparison of Two Achievable Rate Regions for the Interference Channel Hon-Fah Chong, Mehul Motani, and Hari Krishna Garg Electrical & Computer Engineering National University of Singapore Email: {g030596,motani,eleghk}@nus.edu.sg
More informationOn Network Interference Management
On Network Interference Management Aleksandar Jovičić, Hua Wang and Pramod Viswanath March 3, 2008 Abstract We study two building-block models of interference-limited wireless networks, motivated by the
More informationOn Multiple User Channels with State Information at the Transmitters
On Multiple User Channels with State Information at the Transmitters Styrmir Sigurjónsson and Young-Han Kim* Information Systems Laboratory Stanford University Stanford, CA 94305, USA Email: {styrmir,yhk}@stanford.edu
More informationLecture 7. Union bound for reducing M-ary to binary hypothesis testing
Lecture 7 Agenda for the lecture M-ary hypothesis testing and the MAP rule Union bound for reducing M-ary to binary hypothesis testing Introduction of the channel coding problem 7.1 M-ary hypothesis testing
More informationAn Achievable Error Exponent for the Mismatched Multiple-Access Channel
An Achievable Error Exponent for the Mismatched Multiple-Access Channel Jonathan Scarlett University of Cambridge jms265@camacuk Albert Guillén i Fàbregas ICREA & Universitat Pompeu Fabra University of
More informationOn the Capacity and Degrees of Freedom Regions of MIMO Interference Channels with Limited Receiver Cooperation
On the Capacity and Degrees of Freedom Regions of MIMO Interference Channels with Limited Receiver Cooperation Mehdi Ashraphijuo, Vaneet Aggarwal and Xiaodong Wang 1 arxiv:1308.3310v1 [cs.it] 15 Aug 2013
More informationOn the K-user Cognitive Interference Channel with Cumulative Message Sharing Sum-Capacity
03 EEE nternational Symposium on nformation Theory On the K-user Cognitive nterference Channel with Cumulative Message Sharing Sum-Capacity Diana Maamari, Daniela Tuninetti and Natasha Devroye Department
More informationNetwork Coding on Directed Acyclic Graphs
Network Coding on Directed Acyclic Graphs John MacLaren Walsh, Ph.D. Multiterminal Information Theory, Spring Quarter, 0 Reference These notes are directly derived from Chapter of R. W. Yeung s Information
More informationThe Capacity Region of the Gaussian Cognitive Radio Channels at High SNR
The Capacity Region of the Gaussian Cognitive Radio Channels at High SNR 1 Stefano Rini, Daniela Tuninetti and Natasha Devroye srini2, danielat, devroye @ece.uic.edu University of Illinois at Chicago Abstract
More informationLecture 8: Channel and source-channel coding theorems; BEC & linear codes. 1 Intuitive justification for upper bound on channel capacity
5-859: Information Theory and Applications in TCS CMU: Spring 23 Lecture 8: Channel and source-channel coding theorems; BEC & linear codes February 7, 23 Lecturer: Venkatesan Guruswami Scribe: Dan Stahlke
More informationX 1 : X Table 1: Y = X X 2
ECE 534: Elements of Information Theory, Fall 200 Homework 3 Solutions (ALL DUE to Kenneth S. Palacio Baus) December, 200. Problem 5.20. Multiple access (a) Find the capacity region for the multiple-access
More informationA Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying
A Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying Ahmad Abu Al Haija, and Mai Vu, Department of Electrical and Computer Engineering McGill University Montreal, QC H3A A7 Emails: ahmadabualhaija@mailmcgillca,
More informationResearch Article Multiaccess Channels with State Known to Some Encoders and Independent Messages
Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and etworking Volume 2008, Article ID 450680, 14 pages doi:10.1155/2008/450680 Research Article Multiaccess Channels with State
More informationA New Metaconverse and Outer Region for Finite-Blocklength MACs
A New Metaconverse Outer Region for Finite-Blocklength MACs Pierre Moulin Dept of Electrical Computer Engineering University of Illinois at Urbana-Champaign Urbana, IL 680 Abstract An outer rate region
More informationOn the Capacity of the Interference Channel with a Relay
On the Capacity of the Interference Channel with a Relay Ivana Marić, Ron Dabora and Andrea Goldsmith Stanford University, Stanford, CA {ivanam,ron,andrea}@wsl.stanford.edu Abstract Capacity gains due
More information(Classical) Information Theory III: Noisy channel coding
(Classical) Information Theory III: Noisy channel coding Sibasish Ghosh The Institute of Mathematical Sciences CIT Campus, Taramani, Chennai 600 113, India. p. 1 Abstract What is the best possible way
More informationOptimal Encoding Schemes for Several Classes of Discrete Degraded Broadcast Channels
Optimal Encoding Schemes for Several Classes of Discrete Degraded Broadcast Channels Bike Xie, Student Member, IEEE and Richard D. Wesel, Senior Member, IEEE Abstract arxiv:0811.4162v4 [cs.it] 8 May 2009
More informationSecrecy in the 2-User Symmetric Interference Channel with Transmitter Cooperation: Deterministic View
Secrecy in the 2-User Symmetric Interference Channel with Transmitter Cooperation: Deterministic View P. Mohapatra 9 th March 2013 Outline Motivation Problem statement Achievable scheme 1 Weak interference
More informationLecture 6 Channel Coding over Continuous Channels
Lecture 6 Channel Coding over Continuous Channels I-Hsiang Wang Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw November 9, 015 1 / 59 I-Hsiang Wang IT Lecture 6 We have
More informationAn Achievable Rate Region for the 3-User-Pair Deterministic Interference Channel
Forty-Ninth Annual Allerton Conference Allerton House, UIUC, Illinois, USA September 8-3, An Achievable Rate Region for the 3-User-Pair Deterministic Interference Channel Invited Paper Bernd Bandemer and
More informationSource-Channel Coding Theorems for the Multiple-Access Relay Channel
Source-Channel Coding Theorems for the Multiple-Access Relay Channel Yonathan Murin, Ron Dabora, and Deniz Gündüz Abstract We study reliable transmission of arbitrarily correlated sources over multiple-access
More informationIN this paper, we show that the scalar Gaussian multiple-access
768 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 5, MAY 2004 On the Duality of Gaussian Multiple-Access and Broadcast Channels Nihar Jindal, Student Member, IEEE, Sriram Vishwanath, and Andrea
More informationECE Information theory Final
ECE 776 - Information theory Final Q1 (1 point) We would like to compress a Gaussian source with zero mean and variance 1 We consider two strategies In the first, we quantize with a step size so that the
More informationLECTURE 15. Last time: Feedback channel: setting up the problem. Lecture outline. Joint source and channel coding theorem
LECTURE 15 Last time: Feedback channel: setting up the problem Perfect feedback Feedback capacity Data compression Lecture outline Joint source and channel coding theorem Converse Robustness Brain teaser
More informationOn Gaussian MIMO Broadcast Channels with Common and Private Messages
On Gaussian MIMO Broadcast Channels with Common and Private Messages Ersen Ekrem Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 20742 ersen@umd.edu
More informationII. THE TWO-WAY TWO-RELAY CHANNEL
An Achievable Rate Region for the Two-Way Two-Relay Channel Jonathan Ponniah Liang-Liang Xie Department of Electrical Computer Engineering, University of Waterloo, Canada Abstract We propose an achievable
More informationInterference channel capacity region for randomized fixed-composition codes
Interference channel capacity region for randomized fixed-composition codes Cheng Chang D. E. Shaw & Co, New York, NY. 20 West 45th Street 39th Floor New York, NY 0036 cchang@eecs.berkeley.edu Abstract
More informationEnergy State Amplification in an Energy Harvesting Communication System
Energy State Amplification in an Energy Harvesting Communication System Omur Ozel Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland College Park, MD 20742 omur@umd.edu
More informationLecture 2. Capacity of the Gaussian channel
Spring, 207 5237S, Wireless Communications II 2. Lecture 2 Capacity of the Gaussian channel Review on basic concepts in inf. theory ( Cover&Thomas: Elements of Inf. Theory, Tse&Viswanath: Appendix B) AWGN
More informationLecture 4 Channel Coding
Capacity and the Weak Converse Lecture 4 Coding I-Hsiang Wang Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw October 15, 2014 1 / 16 I-Hsiang Wang NIT Lecture 4 Capacity
More informationRepresentation of Correlated Sources into Graphs for Transmission over Broadcast Channels
Representation of Correlated s into Graphs for Transmission over Broadcast s Suhan Choi Department of Electrical Eng. and Computer Science University of Michigan, Ann Arbor, MI 80, USA Email: suhanc@eecs.umich.edu
More informationMorning Session Capacity-based Power Control. Department of Electrical and Computer Engineering University of Maryland
Morning Session Capacity-based Power Control Şennur Ulukuş Department of Electrical and Computer Engineering University of Maryland So Far, We Learned... Power control with SIR-based QoS guarantees Suitable
More informationOptimal Power Allocation for Parallel Gaussian Broadcast Channels with Independent and Common Information
SUBMIED O IEEE INERNAIONAL SYMPOSIUM ON INFORMAION HEORY, DE. 23 1 Optimal Power Allocation for Parallel Gaussian Broadcast hannels with Independent and ommon Information Nihar Jindal and Andrea Goldsmith
More informationCapacity Region of Reversely Degraded Gaussian MIMO Broadcast Channel
Capacity Region of Reversely Degraded Gaussian MIMO Broadcast Channel Jun Chen Dept. of Electrical and Computer Engr. McMaster University Hamilton, Ontario, Canada Chao Tian AT&T Labs-Research 80 Park
More informationOn the Secrecy Capacity of Fading Channels
On the Secrecy Capacity of Fading Channels arxiv:cs/63v [cs.it] 7 Oct 26 Praveen Kumar Gopala, Lifeng Lai and Hesham El Gamal Department of Electrical and Computer Engineering The Ohio State University
More informationEE5139R: Problem Set 7 Assigned: 30/09/15, Due: 07/10/15
EE5139R: Problem Set 7 Assigned: 30/09/15, Due: 07/10/15 1. Cascade of Binary Symmetric Channels The conditional probability distribution py x for each of the BSCs may be expressed by the transition probability
More informationNOMA: Principles and Recent Results
NOMA: Principles and Recent Results Jinho Choi School of EECS GIST September 2017 (VTC-Fall 2017) 1 / 46 Abstract: Non-orthogonal multiple access (NOMA) becomes a key technology in 5G as it can improve
More informationOn Capacity Under Received-Signal Constraints
On Capacity Under Received-Signal Constraints Michael Gastpar Dept. of EECS, University of California, Berkeley, CA 9470-770 gastpar@berkeley.edu Abstract In a world where different systems have to share
More informationA Graph-based Framework for Transmission of Correlated Sources over Multiple Access Channels
A Graph-based Framework for Transmission of Correlated Sources over Multiple Access Channels S. Sandeep Pradhan a, Suhan Choi a and Kannan Ramchandran b, a {pradhanv,suhanc}@eecs.umich.edu, EECS Dept.,
More informationAchievable Rates and Outer Bound for the Half-Duplex MAC with Generalized Feedback
1 Achievable Rates and Outer Bound for the Half-Duplex MAC with Generalized Feedback arxiv:1108.004v1 [cs.it] 9 Jul 011 Ahmad Abu Al Haija and Mai Vu, Department of Electrical and Computer Engineering
More informationError Exponent Regions for Gaussian Broadcast and Multiple Access Channels
Error Exponent Regions for Gaussian Broadcast and Multiple Access Channels Lihua Weng, S. Sandeep Pradhan, and Achilleas Anastasopoulos Submitted: December, 5 Abstract In modern communication systems,
More informationCooperative HARQ with Poisson Interference and Opportunistic Routing
Cooperative HARQ with Poisson Interference and Opportunistic Routing Amogh Rajanna & Mostafa Kaveh Department of Electrical and Computer Engineering University of Minnesota, Minneapolis, MN USA. Outline
More informationOn the Optimality of Treating Interference as Noise in Competitive Scenarios
On the Optimality of Treating Interference as Noise in Competitive Scenarios A. DYTSO, D. TUNINETTI, N. DEVROYE WORK PARTIALLY FUNDED BY NSF UNDER AWARD 1017436 OUTLINE CHANNEL MODEL AND PAST WORK ADVANTAGES
More informationChapter 8: Differential entropy. University of Illinois at Chicago ECE 534, Natasha Devroye
Chapter 8: Differential entropy Chapter 8 outline Motivation Definitions Relation to discrete entropy Joint and conditional differential entropy Relative entropy and mutual information Properties AEP for
More informationEfficient Use of Joint Source-Destination Cooperation in the Gaussian Multiple Access Channel
Efficient Use of Joint Source-Destination Cooperation in the Gaussian Multiple Access Channel Ahmad Abu Al Haija ECE Department, McGill University, Montreal, QC, Canada Email: ahmad.abualhaija@mail.mcgill.ca
More informationShannon s Noisy-Channel Coding Theorem
Shannon s Noisy-Channel Coding Theorem Lucas Slot Sebastian Zur February 2015 Abstract In information theory, Shannon s Noisy-Channel Coding Theorem states that it is possible to communicate over a noisy
More informationSource and Channel Coding for Correlated Sources Over Multiuser Channels
Source and Channel Coding for Correlated Sources Over Multiuser Channels Deniz Gündüz, Elza Erkip, Andrea Goldsmith, H. Vincent Poor Abstract Source and channel coding over multiuser channels in which
More informationInformation Theory Meets Game Theory on The Interference Channel
Information Theory Meets Game Theory on The Interference Channel Randall A. Berry Dept. of EECS Northwestern University e-mail: rberry@eecs.northwestern.edu David N. C. Tse Wireless Foundations University
More informationarxiv: v1 [cs.it] 4 Jun 2018
State-Dependent Interference Channel with Correlated States 1 Yunhao Sun, 2 Ruchen Duan, 3 Yingbin Liang, 4 Shlomo Shamai (Shitz) 5 Abstract arxiv:180600937v1 [csit] 4 Jun 2018 This paper investigates
More informationELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications
ELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications Professor M. Chiang Electrical Engineering Department, Princeton University March
More informationLecture 4 Capacity of Wireless Channels
Lecture 4 Capacity of Wireless Channels I-Hsiang Wang ihwang@ntu.edu.tw 3/0, 014 What we have learned So far: looked at specific schemes and techniques Lecture : point-to-point wireless channel - Diversity:
More informationSparse Regression Codes for Multi-terminal Source and Channel Coding
Sparse Regression Codes for Multi-terminal Source and Channel Coding Ramji Venkataramanan Yale University Sekhar Tatikonda Allerton 2012 1 / 20 Compression with Side-Information X Encoder Rate R Decoder
More informationMidterm Exam Information Theory Fall Midterm Exam. Time: 09:10 12:10 11/23, 2016
Midterm Exam Time: 09:10 12:10 11/23, 2016 Name: Student ID: Policy: (Read before You Start to Work) The exam is closed book. However, you are allowed to bring TWO A4-size cheat sheet (single-sheet, two-sided).
More informationEE376A - Information Theory Final, Monday March 14th 2016 Solutions. Please start answering each question on a new page of the answer booklet.
EE376A - Information Theory Final, Monday March 14th 216 Solutions Instructions: You have three hours, 3.3PM - 6.3PM The exam has 4 questions, totaling 12 points. Please start answering each question on
More informationInterference Channel aided by an Infrastructure Relay
Interference Channel aided by an Infrastructure Relay Onur Sahin, Osvaldo Simeone, and Elza Erkip *Department of Electrical and Computer Engineering, Polytechnic Institute of New York University, Department
More information