Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate...

25
Network Information Theory (Channel Capacity) Part 2 Muhammad Fahim Ul Haque Computer Engineering Division EE Department Linköping University

Transcript of Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate...

Page 1: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Network Information Theory (Channel Capacity)

Part 2

Muhammad Fahim Ul Haque Computer Engineering Division

EE Department Linköping University

Page 2: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Content of Presentation

• Multiple Access Channel (Continued) Gausian Multi Access Channel Gausian Channel Capacity for FDMA,TDMA &CDMA) m-user Multi Access Channel

• Broadcast Channel Degraded Broadcast Channel Capacity of Degraded Broadcast Channel Book Example Gausian Degraded Broadcast Channel

• Relay Channel

Page 3: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Gaussian Multiple Acces Channel

Page 4: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Gaussian Multiple Acces Channel

• Generalize case for capacity region for multiple acces channel is given as:

• Capacity region for gausian channel drived from above equation

(1)

(2)

(3)

Page 5: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Gaussian Multiple Acces Channel

From equation 1

-------------------------------(4)

---(5)

--------------------------(6)

----------------------------------(7)

---------------------------------------(8)

-----------(9)

-----------------------------------------(10)

Page 6: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Gaussian Multiple Acces Channel

----------------------(11)

(12)

----------------------------------(13)

--------------------------(14)

--------------------(15)

(16)

-------------------------(17)

Page 7: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Gaussian Multiple Acces Channel

• So

----------------------(18)

----------------------(19)

--------------(20)

Page 8: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Gaussian Multiple Acces Channel

• FDMA

• TDMA

• CDMA

Page 9: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

m- user Channel

Page 10: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Broad Cast Channel

Page 11: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Examlpes Of Broadcast Channel

• TV Broadcast Station

• Class Room Lecture

• TV Broadcast Station(Simultanous HDTV and Regular Transmission)

• Orthogonal Broadcast Station.

Page 12: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Broadcast Channel

• A broadcast channel with two reciever of rate R1 and R2 and there is no common info. sent to both reciver

Page 13: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Broadcast Channel

• A rate (R1,R2) is said to be achivable for the broadcast channel if there exists a sequence of ((2nR1,2nR2),n) codes with

• The chanel where we have common info. Of rate R0 to be sent to both reciever.

0)( n

eP

Page 14: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Broadcast Channel

• A rate triple (R0,R1,R2) is said to achievable for broadcast channel with common info. If there exist a sequence of ((2nR0,2nR1,2nR2),n) codes with

• The capacity region of the broadcast channel is the closure

of the set of achievable rates. • Theorem 15.6.1: The capacity region of a broadcast

channel depends only on the conditional margional distributions p(y1|x) and p(y2|x).

0)( n

eP

Page 15: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Degraded Broadcast Channels

• A broad cast channel is said to be physically degrades if

• A broadcast channel is said to be stochastically degrade if its conditional margional distribution are same as that of physically degraded broadcast channel

Page 16: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Capacity of Degraded Broadcast Channel

Page 17: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Capacity of Degraded Broadcast Channel

• Proof

Page 18: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Capacity of Degraded BroadCast Channel

Page 19: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Broadcast Channel

Page 20: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Gaussian Broadcast Degraded Channel

Page 21: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Relay Channel

Page 22: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Relay Channel

Page 23: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Relay Channel

Page 24: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Relay Channel

Page 25: Network Information Theory (Channel Capacity) Part 2 · 2013-05-29 · Broadcast Channel •A rate triple (R 0,R 1,R 2) is said to achievable for broadcast channel with common info.

Refrences

• Element of Information Theory (Second Edition) by Thomas M. Cover & Joy A. Thomas