NIT-multiple Access Channel

Faculty of
Electrical Engineering and

Computer Systems
Department of Telecommunication
Systems
Information and Communication

Theory
Prof. Dr. Giuseppe Caire
Einsteinufer 25
10587 Berlin
Telefon +49 (0)30 314-29668

Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Lecture 1:
Sekretariat HFT6
Patrycja Chudzik
Telefon +49 (0)30 314-28459

Telefax +49 (0)30 314-28320
sekretariat@mk.tu-berlin.de
The Multiple Access Channel
Copyright G. Caire 12
Outline
Faculty of
Computer Systems
Systems

Theory
Einsteinufer 25
10587 Berlin
• Two-user MAC.
Telefon +49 (0)30 314-29668
Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
Patrycja Chudzik
Telefon +49 (0)30 314-28459

Telefax +49 (0)30 314-28320
• The Gaussian case.
• The K-user case.
• Polymatroid structure and resource allocation problems.
Two-user MAC
Faculty of
Computer Systems
Systems

Theory
Einsteinufer 25
10587 Berlin
Telefon +49 (0)30 314-29668

Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
Patrycja Chudzik
Telefon +49 (0)30 314-28459

Telefax +49 (0)30 314-28320
W1 X1
Tx1
c1 , W
{W c2 }
PY |X1 ,X2 Y
Rx
W2 X2
Tx2
The “networking” approach to the MAC
Faculty of
Computer Systems
Systems

Theory
Einsteinufer 25
10587 Berlin
• The networking approach to the MAC is to avoid multiuser interference in the

Telefon +49 (0)30 314-29668
Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
presence of users’ random access.

Patrycja Chudzik
Telefon +49 (0)30 314-28459

Telefax +49 (0)30 314-28320
• Examples: Aloha, CSMA, 802.11, 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).
Definitions
Faculty of
Computer Systems
Systems

Theory
• Let {X1 ⇥ X2, PY |X1,X2 , Y} denote a memoryless stationary MAC.

Einsteinufer 25
10587 Berlin
Telefon +49 (0)30 314-29668

Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
Patrycja Chudzik
Telefon +49 (0)30 314-28459

Telefax +49 (0)30 314-28320
• A (2nR1 , 2nR2 , n) MAC code is defined by the two message sets

M1 = {1, . . . , 2nR1 }, M2 = {1, . . . , 2nR2 }
• Two encoding functions
f1 : M1 ! X1n, f2 : M2 ! X2n
such that x1(m1) = f1(m1) and x2(m2) = f2(m2).
• A decoding function
g : Y n ! M1 ⇥ M 2
Capacity region
Faculty of
Computer Systems
Systems

Theory
Einsteinufer 25
10587 Berlin
• The average probability of error is defined as

Telefon +49 (0)30 314-29668
Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
Patrycja Chudzik
Telefon +49 (0)30 314-28459
⇣ ⌘
Telefax +49 (0)30 314-28320
c1, M
Pe(f1, f2, g) = P (M c2) 6= (M1, M2) ,
where M1, M2 are independent and uniformly distributed over M1 and M2,
respectively, and where
c1, M
X1n = x1(M1), X2n = x2(M2), (M c2) = g(Y n).
• The MAC capacity region C is the closure of the set of all pairs (R1, R2) for
(n) (n)
which there exists a sequence of codes (f1 , f2 , g (n)) with rates (R1, R2)
(n) (n)
and Pe(f1 , f2 , g (n)) ! 0 as n ! 1.
Simple inner and outer bounds
Faculty of
Computer Systems
Systems

Theory
Einsteinufer 25
• Time-sharing inner bound (TDMA): let

10587 Berlin
Telefon +49 (0)30 314-29668

Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
Patrycja Chudzik
Telefon +49 (0)30 314-28459

Telefax +49 (0)30 314-28320
C1 = max I(X1; Y |X2 = x2), C2 = max I(X2; Y |X1 = x1)

PX1 ,x2 2X2 PX2 ,x1 2X1
then, the following region is achievable
R1 R2
+ 1
C1 C2
• Sum-rate outer bound:
R1 + R2  max I(X1, X2; Y )

PX1 ,PX2
where (X1, X2) ⇠ PX1 (x1)PX2 (x2).
coding theorem, we can show that the maximum sum rate is upper bounded by
How the
R1 + R2capacity
 C12 := region looks
max I(X 1, X2like?
;Y )
p(x1 )p(x2 )
• Using these rates, we can derive the following time-division inner bound and
Faculty of
Computer Systems
Systems
general outer bound on the capacity region of any DM-MAC

Theory
10587 Berlin
R2
Einsteinufer 25
Telefon +49 (0)30 314-29668

Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Time-division
Sekretariat HFT6
Patrycja Chudzik
Telefon +49 (0)30 314-28459

Telefax +49 (0)30 314-28320
C12 inner bound
C2 Outer bound
R1
C1
LNIT: Multiple Access Channels (2010-06-22 08:45) Page 4 – 4

• Notice: from a time-sharing argument we have that C must be a convex
region.
Capacity region of the 2-user MAC
Faculty of
Computer Systems
Systems

Theory
Theorem 1.Single-Letter
MAC CapacityCharacterization
region: The MACofcapacity
the Capacity
region isRegion
the convex
Einsteinufer 25
10587 Berlin
closure of the rates satisfying

Telefon +49 (0)30 314-29668
Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
Patrycja Chudzik
• Let (X1, X2) ⇠ p(x1)p(x2). Define R(X1, X2) as the set of (R1, R2) rate pairs
Telefon +49 (0)30 314-28459
Telefax +49 (0)30 314-28320
such that R1  I(X1; Y |X2, Q),

R1  I(X1; Y |X2), R2  I(X2; Y |X1),
R2  I(X2; Y |X1, Q),
R1 + R2  I(X1, X2; Y )
R1 + R2  I(X1, X2; Y |Q)
• This set is in general a pentagon with a 45 side because
for somemax{I(X
PQPX1|Q1;PYX|X ⇤1)
2.), I(X2; Y |X1 )}  I(X1, X2 ; Y )  I(X1; Y |X2 )+I(X2; Y |X
2 |Q
R2
I(X2; Y |X1)
I(X2; Y )
I(X1; Y ) I(X1; Y |X2) R1
• Theorem 2 (Ahlswede [2], Liao [3]): The capacity region C for the DM-MAC is
Copyright G. Caire
the convex closure of the union of the regions R(X1, X2) over all p(x1 )p(x2) 20
Proof: Achievability
Faculty of
Computer Systems
Systems

Theory
Einsteinufer 25
10587 Berlin
• Fix PQ, PX1|Q and PX2|Q. We shall show that any point in the interior of
Telefon +49 (0)30 314-29668
Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
R(X1, X2, Q) (pentagon) is achievable.

Patrycja Chudzik
Telefon +49 (0)30 314-28459

Telefax +49 (0)30 314-28320
• Codebook generation: generate a typical q with i.i.d. components ⇠ PQ,

and independently two codebooks {x1(m1) : m1 2 [1 : 2nR1 ]} and {x2(m2) :
m2 2 [1 : 2nR2 ]} with independent entries ⇠ PX1|Q(·|qi) and ⇠ PX2|Q(·|qi),
respectively.
• Encoding: to send message m1, encoder 1 transmits x1(m1). Similarly,

encoder 2 sends x2(m2).
• Decoding: Declare m b 2 if this is the unique index pair such that

b 1, m
(n)
b 2), y) 2 T✏ (X1, X2, Y |q), otherwise declare error.
b 1), x2(m
(x1(m
Faculty of
Computer Systems
Systems

Theory
Einsteinufer 25
10587 Berlin
• By symmetry we have P e = P(E|M1 = 1, M2 = 1) where E = {g(Y n) 6=

Telefon +49 (0)30 314-29668
Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
Patrycja Chudzik
(1, 1)}.
Telefon +49 (0)30 314-28459
Telefax +49 (0)30 314-28320
• When analyzing the random coding ensemble average error probability,

(Qn, X1n(m1), X2n(m2), Y n) are random vectors.
• We consider the possible joint conditional probability distributions of

(X1n(m1), X2n(m2), Y n) given Qn:
m1 m2 joint pmf
1 1 PX1|QPX2|QPY |X1,X2
* 1 PX1|QPX2|QPY |X2,Q
1 * PX1|QPX2|QPY |X1,Q
* * PX1|QPX2|QPY |Q
Faculty of
Computer Systems
Systems

Theory
Einsteinufer 25
10587 Berlin
• The error event E is contained in the union of the following events:

Telefon +49 (0)30 314-29668
Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
Patrycja Chudzik
Telefon +49 (0)30 314-28459

Telefax +49 (0)30 314-28320
E1c = {(Qn, X1n(1), X2n(1), Y n) 2

/ T✏(n)(Q, X1, X2, Y )}
E2 = {(Qn, X1n(m1), X2n(1), Y n) 2 T✏(n)(Q, X1, X2, Y ) for some m1 6= 1}
E3 = {(Qn, X1n(1), X2n(m2), Y n) 2 T✏(n)(Q, X1, X2, Y ) for some m2 6= 1}
E4 = {(Qn, X1n(m1), X2n(m2), Y n) 2 T✏(n)(Q, X1, X2, Y )
for some m1 6= 1, m2 6= 1}
Faculty of
Computer Systems
Systems

Theory
Einsteinufer 25
10587 Berlin
• We bound each term:

Telefon +49 (0)30 314-29668
Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
Patrycja Chudzik
Telefon +49 (0)30 314-28459

Telefax +49 (0)30 314-28320
1. By LLN P(E1c|M1 = 1, M2 = 1) ! 0.
2. P(E2|M1 = 1, M2 = 1)  2 n(I(X1;Y |X2,Q) R1 (✏))

.
3. P(E3|M1 = 1, M2 = 1)  2 n(I(X2;Y |X1,Q) R2 (✏))
.
4. P(E4|M1 = 1, M2 = 1)  2 n(I(X1,X2;Y |Q) R1 R2 (✏))
.
• The result follows from the union bound.
Proof: Converse
Faculty of
Computer Systems
Systems

Theory
Einsteinufer 25
10587 Berlin
(n)
• Assume that there is a sequence of (R1, R2, n)-codes such that Pe ! 0 as
Telefon +49 (0)30 314-29668
Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
Patrycja Chudzik
n ! 1.
Telefon +49 (0)30 314-28459
Telefax +49 (0)30 314-28320
• The n-letter multivariate joint distribution is given by
n
Y
(M1, M2, X1n, X2n, Y n) ⇠ 2 n(R1 +R2 )
PY |X1,X2 (yi|x1i, x2i)
i=1
⇥1{X1n = x1(m1)} ⇥ 1{X2n = x2(m2)}
Faculty of
Computer Systems
Systems

Theory
Einsteinufer 25
10587 Berlin
• Sum rate: from Fano inequality we have:

Telefon +49 (0)30 314-29668
Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
Patrycja Chudzik
Telefon +49 (0)30 314-28459

Telefax +49 (0)30 314-28320
H(M1, M2|Y n)  1 + n(R1 + R2)Pe(n)  n✏n

H(M1|Y n, M2)  H(M1, M2|Y n)  n✏n
H(M2|Y n, M1)  H(M1, M2|Y n)  n✏n
• Therefore:
n n n
n(R1 + R2 ) = H(M1 , M2 ) H(M1 , M2 |Y ) + H(M1 , M2 |Y )  I(M1 , M2 ; Y ) + n✏n
n n n
nR1 = H(M1 |M2 ) H(M1 |Y , M2 ) + H(M1 |Y , M2 )  I(M1 ; Y |M2 ) + n✏n
n n n
nR2 = H(M2 |M1 ) H(M2 |Y , M1 ) + H(M2 |Y , M1 )  I(M2 ; Y |M1 ) + n✏n
Sum rate inequality
Faculty of
Computer Systems
Systems

Theory
Einsteinufer 25
10587 Berlin
Telefon +49 (0)30 314-29668

Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
Patrycja Chudzik
Telefon +49 (0)30 314-28459

Telefax +49 (0)30 314-28320
n(R1 + R2)  I(M1, M2; Y n) + n✏n

Xn
= I(M1, M2; Yi|Y i 1) + n✏n
i=1
Xn
= I(M1, M2, X1i, X2i; Yi|Y i 1
) + n✏n
i=1
Xn
= I(X1i, X2i; Yi|Y i 1
) + I(M1, M2; Yi|Y i 1
, X1i, X2i) + n✏n
i=1
Xn
= I(X1i, X2i; Yi) + n✏n
i=1
Individual rate inequalities
Faculty of
Computer Systems
Systems

Theory
Einsteinufer 25
n
10587 Berlin
Telefon +49 (0)30 314-29668

Telefax +49 (0)30 314-28320
caire@tu-berlin.de
nR1  I(M1; Y |M2) + n✏n
Sekretariat HFT6
Patrycja Chudzik n
X
Telefon +49 (0)30 314-28459
i 1
= I(M1; Yi|Y , M2) + n✏n
Telefax +49 (0)30 314-28320
i=1
n
X i 1
= I(M1; Yi|Y , M2, X2i) + n✏n
i=1
n
X i 1
 I(M1, M2, Y ; Yi|X2i) + n✏n
i=1
n
X i 1
= I(X1i, M1, M2, Y ; Yi|X2i) + n✏n
i=1
n ⇣
X ⌘
i 1
= I(X1i; Yi|X2i) + I(M1, M2, Y ; Yi|X1i, X2i) + n✏n
i=1
n
X
= I(X1i; Yi|X2i) + n✏n
i=1
Multiletter rate inequalities
Faculty of
Computer Systems
Systems

Theory
Einsteinufer 25
10587 Berlin
• We arrive at
Telefon +49 (0)30 314-29668
Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
Patrycja Chudzik
Telefon +49 (0)30 314-28459

Telefax +49 (0)30 314-28320
n
1X
R1  I(X1i; Yi|X2i) + ✏n
n i=1
n
1X
R2  I(X2i; Yi|X1i) + ✏n
n i=1
n
1X
R1 + R2  I(X1i, X2i; Yi) + ✏n
n i=1
• 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.
From multiletter to single-letter
Faculty of
Computer Systems
Systems

Theory
• Time-sharing argument: define a new random variance Q ⇠Uniform[1 : n]

Einsteinufer 25
10587 Berlin
Telefon +49 (0)30 314-29668
independent of (X1n, X2n, Y n). We can write

Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
Patrycja Chudzik
Telefon +49 (0)30 314-28459

Telefax +49 (0)30 314-28320
n
1X
R1  I(X1i; Yi|X2i) + ✏n
n i=1
= I(X1Q; YQ|X2Q, Q) + ✏n
• Now we identify X1 = X1Q, X2 = X2Q, Y = YQ and, letting n ! 1, we obtain
R1  I(X1; Y |X2, Q)
R2  I(X2; Y |X1, Q)
R1 + R2  I(X1, X2; Y |Q)
for some (Q, X1, X2) ⇠ PQPX1|QPX2|Q.
The Gaussian MAC
Faculty of
Computer Systems
Systems

Theory
• The Gaussian MAC is described by

Einsteinufer 25
10587 Berlin
Telefon +49 (0)30 314-29668

Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
Patrycja Chudzik
Telefon +49 (0)30 314-28459

Telefax +49 (0)30 314-28320
Y = g 1 X1 + g 2 X2 + Z
• Real case: X1, X2, Y = R, g1, g2 2 R, Z ⇠ N (0, N0/2).
• Complex circularly symmetric case: X1, X2, Y = C, g1, g2 2 C, Z ⇠

CN (0, N0).
• The input constraints are given by

n
1X
|xk,i(mk )|2  Esk , 8 mk 2 [1 : 2nRk ], k = 1, 2
n i=1
Faculty of
Computer Systems
Systems

Theory
• For the real case, we define S1 = 2g12Es1/N0 and S2 = 2g22Es2/N0, and the
Einsteinufer 25
10587 Berlin
Telefon +49 (0)30 314-29668

Telefax +49 (0)30 314-28320
function C(S) = 12 log(1 + S).

caire@tu-berlin.de
Sekretariat HFT6
Patrycja Chudzik
Telefon +49 (0)30 314-28459

Telefax +49 (0)30 314-28320
• For the complex case, we define S1 = |g1|2Es1/N0 and S2 = |g2|2Es2/N0, and

the function C(S) = log(1 + S).
• Choosing X1, X2 Gaussian and independent we find the region
R1  C(S1)
R2  C(S2)
R1 + R2  C(S1 + S2)
• 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).
(R1, R2) rate pairs satisfying
The Wyner-Cover
R1 pentagon
C(S1),
Faculty of
R2  C(S2),
Computer Systems
Systems

Theory
Einsteinufer 25
10587 Berlin
Telefon +49 (0)30 314-29668

Telefax +49 (0)30 314-28320
caire@tu-berlin.de
R1 + R2  C(S1 + S2)
Sekretariat HFT6
Patrycja Chudzik
R2
Telefon +49 (0)30 314-28459
Telefax +49 (0)30 314-28320
C(S2)
C(S2 /(1 + S1))
R1
C(S1 /(1 + S2)) C(S1)
• Remark: The capacity region coincides with the simple outer bound and
convexification via time-sharing random variable Q is required
LNIT: Multiple Access Channels (2010-06-22 08:45)
while treating the other codeword as noise. This scheme achieves the set of
(R1, R2) pairs such that R1 < C(S1/(S2 + 1)), R2 < C(S2/(S1 + 1))
Comparison with multiaccess techniques
Faculty of
• TDMA: A straightforward TDMA scheme achieves the set of (R1, R2) pairs
such that R1 < ↵ C(S1), R2 < ↵ C(S2) for some ↵ 2 [0, 1]
Computer Systems
Systems

Theory
Einsteinufer 25
10587 Berlin
• Note that when SNRs are sufficiently low, treating the other codeword as noise
can outperform TDMA for some rate pairs
Telefon +49 (0)30 314-29668
Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
Patrycja Chudzik
Telefon +49 (0)30 314-28459

R2
Telefax +49 (0)30 314-28320
High SNR R2 Low SNR
C(S2 ) C(S2 )
TDMA
⇣ ⌘
S2
C S1 +1
⇣ ⌘ Treating
S2
C S1 +1 other codeword
as noise
⇣ ⌘ R1 ⇣ ⌘ R1
S1 S1
C S2 +1
C(S1 ) C S2 +1
C(S1 )
Generalization to K users
Faculty of
Computer Systems
Systems

Theory
Theorem 2. K-user MAC capacity region. The capacity region of the K-user
Einsteinufer 25
10587 Berlin
Telefon +49 (0)30 314-29668

Telefax +49 (0)30 314-28320
caire@tu-berlin.de
MAC with common message is given by the convex closure of the set of rates
Sekretariat HFT6
Patrycja Chudzik
Telefon +49 (0)30 314-28459
satisfying
Telefax +49 (0)30 314-28320
X
Rk  I(XK; Y |XKc , Q)
k2K
for all K ✓ [1 : K] (we use the notation XK = {Xk : k 2 K}), for some
QK
PQ k=1 PXk |Q. ⇤
K-user Gaussian MAC
Faculty of
Computer Systems
Systems

Theory
Einsteinufer 25
10587 Berlin
• The Gaussian MAC with K users is described by

Telefon +49 (0)30 314-29668
Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
Patrycja Chudzik
Telefon +49 (0)30 314-28459

Telefax +49 (0)30 314-28320
K
X
Y = g k Xk + Z
k=1
Pn
with 1
n i=1 |xk,i (mk )|
2
 Esk , 8 k = 1, . . . , K and all messages mk .
• Letting Sk = 2gk2 Esk /N0 (real case), or Sk = |gk |2Esk /N0 (complex case), we
have:
( ! )
X X
C(S1, . . . , SK ) = Rk  C Sk 8 K ✓ {1, . . . , K}
k2K k2K
Resource allocation on the Gaussian MAC
Faculty of
Computer Systems
Systems

Theory
• In resource allocation problems we care about the transmit power (not

Einsteinufer 25
10587 Berlin
receive SNR): let k = Sk /|gk |2, such that

Telefon +49 (0)30 314-29668
Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
Patrycja Chudzik
Telefon +49 (0)30 314-28459

Telefax +49 (0)30 314-28320
sekretariat@mk.tu-berlin.de !
X X
Rk  C |gk |2 k
k2K k2K
• We are interested in solving problems of the following form:

K
X
maximize w k Rk ,
k=1
subject to R2C
K
X
k 
k=1
Polymatroid structure of C
Faculty of
Computer Systems
Systems

Theory
Definition 1. Sub-modular rank function. Let K = [1 : K] and let

Einsteinufer 25
10587 Berlin
Telefon +49 (0)30 314-29668

Telefax +49 (0)30 314-28320
caire@tu-berlin.de
f : 2[1:K] ! R+ denote a set function with the following properties:

Sekretariat HFT6
Patrycja Chudzik
Telefon +49 (0)30 314-28459

Telefax +49 (0)30 314-28320
1. f (;) = 0 (normalized).
2. f (K) f (K0) if K ◆ K0 (non-decreasing).
3. f (K) + f (K0) f (K [ K0) + f (K \ K0) (submodular).
Definition 2. Polymatroid. The polyhedron defined by the inequalities x 2 RK

+,
and X
xk  f (K), 8 K ✓ [1 : K]
k2K
where f : 2[1:K] ! R+ is a submodular rank function, is called a polymatroid. ⌃
Faculty of
Computer Systems
Systems

Theory
Einsteinufer 25
10587 Berlin
Telefon +49 (0)30 314-29668

Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
Patrycja Chudzik
Telefon +49 (0)30 314-28459

Telefax +49 (0)30 314-28320
Polymatroids and linear programming
Faculty of
Computer Systems
Systems

Theory
Einsteinufer 25
10587 Berlin
• Suppose that we are interested in the problem of maximizing the weighted

Telefon +49 (0)30 314-29668
Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
rate-sum:
Patrycja Chudzik
Telefon +49 (0)30 314-28459

Telefax +49 (0)30 314-28320
XK
maximize wk Rk , 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  w ⇡2  · · ·  w ⇡K
Faculty of
Computer Systems
Systems

Theory
Einsteinufer 25
10587 Berlin
• Then, the weighted rate-sum is maximized by the vertex R⇡ , obtained by

Telefon +49 (0)30 314-29668
Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
decoding in the order ⇡, i.e., ⇡1 ! ⇡2 ! · · · ! ⇡K . Namely, we have

Patrycja Chudzik
Telefon +49 (0)30 314-28459

Telefax +49 (0)30 314-28320
K
!
X |g⇡k |2 ⇡k
Rsum(w) = w ⇡k C PK 2
k=1 1+ j=k+1 |g⇡j | ⇡j
0 1
K
X K
X
= (w⇡k w⇡k 1 )C @ |g⇡j |2 ⇡j
A
k=1 j=k
where w⇡0 = w0 = 0.
• Notice that the solution is a sum of concave functions

PK of 1, . . . , K , which
can be further maximized subject to the constraint k=1 k  , if required.
Faculty of
Computer Systems
Systems

Theory
Einsteinufer 25
10587 Berlin
Telefon +49 (0)30 314-29668

Telefax +49 (0)30 314-28320
caire@tu-berlin.de
Sekretariat HFT6
Patrycja Chudzik
Telefon +49 (0)30 314-28459

Telefax +49 (0)30 314-28320
End of Lecture 1

NIT-multiple Access Channel

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

NIT-multiple Access Channel

Uploaded by

Copyright:

Available Formats

Faculty of

Electrical Engineering and

Information and Communication

Prof. Dr. Giuseppe Caire

Telefon +49 (0)30 314-29668

Telefon +49 (0)30 314-28459

The Multiple Access Channel

Information and Communication

Prof. Dr. Giuseppe Caire

Telefon +49 (0)30 314-28459

• The Gaussian case.

• The K-user case.

• Polymatroid structure and resource allocation problems.

Information and Communication

Prof. Dr. Giuseppe Caire

Telefon +49 (0)30 314-29668

Telefon +49 (0)30 314-28459

Information and Communication

Prof. Dr. Giuseppe Caire

• The networking approach to the MAC is to avoid multiuser interference in the

presence of users’ random access.

Telefon +49 (0)30 314-28459

• Examples: Aloha, CSMA, 802.11, Packet-Reservation Multiple-Access,

• Another line of thought focused on signal design in order to make interference

• Examples: CDMA, UWB.

• Information theory shows that neither of the above approaches is generally

Information and Communication

Prof. Dr. Giuseppe Caire

• Let {X1 ⇥ X2, PY |X1,X2 , Y} denote a memoryless stationary MAC.

Telefon +49 (0)30 314-29668

Telefon +49 (0)30 314-28459

• A (2nR1 , 2nR2 , n) MAC code is defined by the two message sets

M1 = {1, . . . , 2nR1 }, M2 = {1, . . . , 2nR2 }

• Two encoding functions

such that x1(m1) = f1(m1) and x2(m2) = f2(m2).

Information and Communication

Prof. Dr. Giuseppe Caire

• The average probability of error is defined as

Telefon +49 (0)30 314-28459

Information and Communication

Prof. Dr. Giuseppe Caire

• Time-sharing inner bound (TDMA): let

Telefon +49 (0)30 314-29668

Telefon +49 (0)30 314-28459

C1 = max I(X1; Y |X2 = x2), C2 = max I(X2; Y |X1 = x1)

then, the following region is achievable

• Sum-rate outer bound:

R1 + R2  max I(X1, X2; Y )

where (X1, X2) ⇠ PX1 (x1)PX2 (x2).

general outer bound on the capacity region of any DM-MAC

Prof. Dr. Giuseppe Caire

Telefon +49 (0)30 314-29668

Telefon +49 (0)30 314-28459

C12 inner bound

LNIT: Multiple Access Channels (2010-06-22 08:45) Page 4 – 4

Information and Communication

closure of the rates satisfying

such that R1  I(X1; Y |X2, Q),

I(X1; Y ) I(X1; Y |X2) R1

Information and Communication

Prof. Dr. Giuseppe Caire

R(X1, X2, Q) (pentagon) is achievable.

Telefon +49 (0)30 314-28459

• Codebook generation: generate a typical q with i.i.d. components ⇠ PQ,