The Gallager Converse
|
|
- Brianna Harris
- 6 years ago
- Views:
Transcription
1 The Gallager Converse Abbas El Gamal Director, Information Systems Laboratory Department of Electrical Engineering Stanford University Gallager s 75th Birthday 1
2 Information Theoretic Limits Establishing information theoretic limits, e.g., channel capacity, requires: Finding a single-letter expression for the limit Proving achievability Proving a converse While achievability tells us about how to improve system design, converse is necessary to prove optimality Proving a converse is typically harder and there are very few tools available, e.g., Fano s inequality, data processing inequality, convexity Gallager s 75th Birthday 2
3 Information Theoretic Limits Establishing information theoretic limits, e.g., channel capacity, requires: Finding a single-letter expression for the limit Proving achievability Proving a converse While achievability tells us about how to improve system design, converse is necessary to prove optimality Proving a converse is typically harder and there are very few tools available, e.g., Fano s inequality, data processing inequality, convexity Gallager s identification of the auxiliary random variable: Crucial step in proof of the degraded broadcast channel converse Has been used in the proof of almost all subsequent converses in multi-user information theory I used it many times in my papers Gallager s 75th Birthday 3
4 Broadcast Channel T. M. Cover, Broadcast Channels, IEEE Trans. Info. Theory, vol. IT-18, pp. 2-14, Jan Discrete memoryless (DM) broadcast channel (X,p(y 1,y 2 x), Y 1, Y 2 ): (W 1,W 2 ) Encoder X n p(y 1,y 2 x) Y n 1 Y n 2 Decoder 1 Decoder 2 Ŵ 1 Ŵ 2 Send independent message W j [1, 2 nr j] to receiver j = 1, 2 Average probability of error: P (n) e = P{Ŵ1 W 1 or Ŵ2 W 2 } (R 1, R 2 ) achievable if there exists a sequence of codes with P (n) e 0 The capacity region is the closure of the set of achievable rates Gallager s 75th Birthday 4
5 Example 1: Binary Symmetric BC Assume that p 1 p 2 < 1/2, H(a), a [0, 1] binary entropy function Z 1 Bern(p 1 ) R 2 X Y 1 1 H(p 2 ) time-sharing Y 2 Z 2 Bern(p 2 ) 1 H(p 1 ) R 1 Gallager s 75th Birthday 5
6 Example 1: Binary Symmetric BC Assume that p 1 p 2 < 1/2 Z 1 Bern(p 1 ) cloud (radius nβ) {0, 1} n satellite codeword X n X Y 1 cloud center U n Y 2 Z 2 Bern(p 2 ) Superposition coding: Use random coding. Let 0 β 1/2; U Bern(1/2) and X Bern(β) independent, X = U + X Generate 2 nr 2 i.i.d. U n (w 2 ), w 2 [1, 2 nr 2] (cloud centers) Generate 2 nr 1 i.i.d. X n (w 1 ), w 1 [1, 2 nr 1] Send X n (w 1, w 2 ) = U n (w 2 ) + X n (w 1 ) (satellite codeword) Gallager s 75th Birthday 6
7 Example 1: Binary Symmetric BC Assume that p 1 p 2 < 1/2 Z 1 Bern(p 1 ) R 2 X Y 1 C 2 time-sharing Y 2 Decoding: Z 2 Bern(p 2 ) Decoder 2 decodes U n (W 2 ) R 2 < 1 H(β p 2 ) Decoder 1 first decodes U n (W 2 ), subtracts it off, then decodes X n (W 1 ) R 1 < H(β p 1 ) H(p 1 ) C 1 R 1 Gallager s 75th Birthday 7
8 Example 2: AWGN BC Assume N 1 N 2, average power constraint P on X Z 1 N(0, N 1 ) Y 1 X Y 2 Z 2 N(0, N 2 ) Superposition coding: Let α [0, 1], U N(0, (1 α)p), X N(0, αp) independent, X = U + X Decoder 2 decodes cloud center R 2 C ((1 α)p/(αp + N 2 )) Decoder 1 decodes clound center, subtracts it off, then decode the sattelite codeword R 1 C (αp/n 1 ) Gallager s 75th Birthday 8
9 Degraded Broadcast Channel Stochastically degraded BC [Cover 1972]: There exists p(y 2 y 1 ) such that p(y 2 x) = y 1 p(y 1 x)p(y 2 y 1 ) Special case of channel inclusion in: C. E. Shannon, A note on a partial ordering for communication channels, Information and Control, vol. 1, pp , 1958 Gallager s 75th Birthday 9
10 Degraded Broadcast Channel Stochastically degraded BC [Cover 1972]: There exists p(y 2 y 1 ) such that p(y 2 x) = y 1 p(y 1 x)p(y 2 y 1 ) Special case of channel inclusion in: C. E. Shannon, A Note on a Partial Ordering for Communication Channels, Information and Control, vol. 1, pp , 1958 Physically degraded version [Bergmans 73]: X p(y 1 x) Y 1 p(y 2 y 1 ) Y 2 Since the capacity region of any BC depends only on marginals p(y 1 x), p(y 2 x) The capacity region of the degraded broadcast channel is the same as that of the physically degraded version Gallager s 75th Birthday 10
11 Degraded Broadcast Channel Cover conjectured that the capacity region is set of all (R 1,R 2 ) such that for some p(u,x) R 2 I(U;Y 2 ), R 1 I(X;Y 1 U), First time an auxiliary random variable is used in characterizing an information theoretic limit Gallager s 75th Birthday 11
12 Achievability P. P. Bergmans, Random Coding Theorem for Broadcast Channels with Degraded Components, IEEE Trans. Info. Theory, vol. IT-19, pp , Mar Use superposition coding: Fix p(u)p(x u) U n U n X n X n Decoder 2 decodes the cloud center U n R 2 I(U; Y 2 ) Decoder 1 decodes first decodes the cloud center, then the sattelite codeword X n R 1 I(X;Y 1 U) Gallager s 75th Birthday 12
13 The Converse A. Wyner, A Theorem on the Entropy of Certain Binary Sequences and Applications: Part II IEEE Trans. Info. Theory, vol. IT-10, pp , Nov Proved weak converse for binary symmetric broadcast channel (used Mrs. Gerber s Lemma) Gallager s 75th Birthday 13
14 The Converse A. Wyner, A Theorem on the Entropy of Certain Binary Sequences and Applications: Part II IEEE Trans. Info. Theory, vol. IT-10, pp , Nov Proved weak converse for binary symmetric broadcast channel (used Mrs. Gerber s Lemma) P.P. Bergmans, A Simple Converse for Broadcast Channels with Additive White Gaussian Noise (Corresp.), IEEE Trans. Info. Theory, vol. IT-20, pp , Mar Proved the converse for the AWGN BC (used Entropy Power Inequality very similar to Wyner s proof for binary symmetric case) Gallager s 75th Birthday 14
15 The Converse A. Wyner, A Theorem on the Entropy of Certain Binary Sequences and Applications: Part II IEEE Trans. Info. Theory, vol. IT-10, pp , Nov Proved weak converse for binary symmetric broadcast channel (used Mrs. Gerber s Lemma) P.P. Bergmans, A Simple Converse for Broadcast Channels with Additive White Gaussian Noise (Corresp.), IEEE Trans. Info. Theory, vol. IT-20, pp , Mar Proved converse for AWGN BC (used Entropy Power Inequality) R. Gallager, Capacity and Coding for Degraded Broadcast Channels, Problemy Peredaci Informaccii, vol. 10, no. 3, pp. 3-14, July-Sept 1974 Proved the weak converse for the discrete-memoryless degraded BC identification of auxiliary random variable Established bound on cardinality of the auxiliary random variable Gallager s 75th Birthday 15
16 Weak Converse for Shannon Channel Capacity Shannon capacity: C = max p(x) I(X;Y ) (only uses channel variables) Weak converse: Show that for any sequence of (n,r) codes with 0, R C P (n) e For each code form the empirical joint pmf: (W, X n, Y n ) p(w)p(x n w) n p(y i x i ) Fano s inequality: H(W Y n ) nrp (n) e Now consider nr = I(W; Y n ) + H(W Y n ) + H(P e (n) ) = nǫ n I(W; Y n ) + nǫ n I(X n ; Y n ) + nǫ n data processing inequality = H(Y n ) H(Y n X n ) + nǫ n I(X i ; Y i ) + nǫ n convexity, memorylessness n(c + ǫ n ) Gallager s 75th Birthday 16
17 Gallager Converse Show that given a sequence of (n,r 1,R 2 ) codes with P (n) e 0, R 1 I(X;Y 1 U), R 2 I(U;Y 2 ) for some p(u,x) such that U X (Y 1, Y 2 ) Key is identifying U The converses for binary symmetric and AWGN BCs are direct and do not explicitly identify U As before, by Fano s inequality So, we have H(W 1 Y1 n ) nr 1 P e (n) H(W 2 Y2 n ) nr 2 P e (n) + 1 = nǫ 1n + 1 = nǫ 2n nr 1 I(W 1 ;Y n 1 ) + nǫ 1n, nr 2 I(W 2 ;Y n 2 ) + nǫ 2n Gallager s 75th Birthday 17
18 A First attempt: U = W 2 (satisfies U X i (Y i1,y 2i )) So far so good. I(W 1 ;Y1 n ) I(W 1 ; Y1 n W 2 ) = I(W 1 ; Y1 n U) = = I(W 1 ; Y 1i U,Y i 1 1 ) chain rule ( H(Y1i U) H(Y 1i U,Y i 1 1, W 1 ) ) ( H(Y1i U) H(Y 1i U,Y i 1 1, W 1,X i ) ) I(X i ;Y 1i U) Gallager s 75th Birthday 18
19 A First attempt: U = W 2 (satisfies U X i (Y i1,y 2i )) I(W 1 ;Y1 n ) I(W 1 ; Y1 n W 2 ) = I(W 1 ; Y1 n U) = = I(W 1 ; Y 1i U,Y i 1 1 ) ( H(Y1i U) H(Y 1i U,Y i 1 1, W 1 ) ) ( H(Y1i U) H(Y 1i U,Y i 1 1, W 1,X i ) ) I(X i ;Y 1i U) So far so good. Now let s try the second inequality I(W 2 ; Y2 n ) = I(W 2 ; Y 2i Y2 i 1 ) = I(U;Y 2i Y2 i 1 ) But I(U;Y 2i Y i 1 2 ) is not necessarily I(U;Y 2i ), so U = W 2 does not work Gallager s 75th Birthday 19
20 Gallager: Ok, let s try U i = W 2, Y1 i 1 (U i X i (Y 1i,Y 2i )), so I(W 1 ; Y1 n W 2 ) I(X i ; Y 1i U i ) Now, let s consider the other term I(W 2 ; Y2 n ) I(W 2,Y2 i 1 ; Y 2i ) = I(W 2,Y i 1 2, Y i 1 1 ;Y 2i ) ( H(Y2i ) H(Y 2i W 2,Y2 i 1, Y1 i 1 ) ) But H(Y 2i W 2, Y i 1 2,Y i 1 1 ) is not in general equal to H(Y 2i W 2, Y i 1 1 ) Gallager s 75th Birthday 20
21 Gallager: Ok, let s try U i = W 2, Y1 i 1 (U i X i (Y 1i,Y 2i )), so I(W 1 ; Y1 n W 2 ) I(X i ; Y 1i U i ) Now, let s consider the other term I(W 2 ; Y2 n ) I(W 2,Y2 i 1 ; Y 2i ) = I(W 2,Y i 1 2, Y i 1 1 ;Y 2i ) ( H(Y2i ) H(Y 2i W 2,Y2 i 1, Y1 i 1 ) ) But H(Y 2i W 2, Y i 1 2,Y i 1 1 ) is not in general equal to H(Y 2i W 2, Y i 1 1 ) Key insight: Since capacity is the same as physically degraded, can assume X Y 1 Y 2, thus Y2 i 1 (W 2,Y1 i 1 ) Y 2i, and I(W 2 ; Y2 n ) I(U i ; Y 2i ) Eureka! Gallager s 75th Birthday 21
22 Note: Proof also works with U i = W 2, Y2 i 1 or U i = W 2,Y1 i 1, Y2 i 1 (both satisfy U i X i (Y 1i, Y 2i )). Let s try U i = W 2,Y2 i 1 First consider Now consider I(W 1 ;Y n 1 W 2 ) = I(W 2 ; Y n 2 ) = = I(W 2,Y i 1 2 ; Y 2i ) = I(W 1 ; Y 1i W 2,Y i 1 1 ) I(X i ; Y 1i W 2, Y i 1 1 ) I(U i ;Y 2i ) ( H(Y1i W 2, Y i 1 1 ) H(Y 1i X i ) ) ( H(Y1i W 2, Y i 1 1,Y i 1 2 ) H(Y 1i X i,u i ) ) ( H(Y1i W 2, Y i 1 2 ) H(Y 1i X i, U i ) ) = I(X i ; Y 1i U i ) Gallager s 75th Birthday 22
23 Thus we finally have nr 1 nr 2 I(X i ; Y 1i U i ) + nǫ 1n I(U i ;Y 2i ) + nǫ 2n By convexity and letting n, it follows that there exists U X Y 1 Y 2 such that R 1 I(X;Y 1 U), R 2 I(U;Y 2 ) Gallager s 75th Birthday 23
24 Thus we finally have nr 1 nr 2 I(X i ; Y 1i U i ) + nǫ 1n I(U i ;Y 2i ) + nǫ 1n By convexity and letting n, it follows that there exists U X Y 1 Y 2 such that R 1 I(X;Y 1 U) + ǫ 1n, R 2 I(U;Y 2 ) + ǫ 2n But there is still a problem here; U can have unbounded cardinality, so this is not a computable expression Gallager then argues that U min{ X, Y 1, Y 2 } suffices Remark: Proof extends to more than 2 receivers Gallager s 75th Birthday 24
25 Subsequent Broadcast Channel Results Direct application of Gallager converse: Physically degraded BC with feedback [El Gamal 1978] Product and sum of degraded and reversely degraded BC [Poltyrev 1977, El Gamal 1980] Gallager s 75th Birthday 25
26 Subsequent Broadcast Channel Results Direct application of Gallager converse: Physically degraded BC with feedback [El Gamal 1978] Product and sum of degraded and reversely degraded BC [Poltyrev 1977, El Gamal 1980] Gallager converse+csizsar Lemma: Less noisy [Korner, Marton 1975]: I(U;Y 1 ) I(U;Y 2 ) for all U X (Y,Z) BC with degraded message sets [Korner, Marton 1977] More capable [El Gamal 1979] (I(X;Y 1 ) I(X;Y 2 ) for all p(x)) Semi-deterministic BC [Gelfand-Pinsker 1980] Nair-El Gamal outer bound for BC [2006] All BC channel converses have used Gallager converse Gallager s 75th Birthday 26
27 Degraded Broadcast Channel With Feedback Assume at time i: X i = f i (W 1, W 2,Y i 1 1, Y i 1 2 ) Capacity region can now depend on joint pmf p(y 1,y 2 x) capacity of stochastically degraded BC with feedback not necessarily equal to that of physically degraded counterpart My first result was showing that feedback doesn t increase capacity of physically degraded BC [El Gamal 78] Converse: nr 2 I(W 2 ;Y2 n ) + nǫ n I(W 2, Y2 i 1 ;Y 2i ) + nǫ n I(W 2, Y i 1 1,Y i 1 2 ; Y 2i ) + nǫ n But because of feedback, Y i 1 2, (W 2, Y i 1 1 ),Y 2i do not necessarily form a Markov chain, thus cannot in general get rid of Y i 1 2 Gallager s 75th Birthday 27
28 Let U i = W 2, Y i 1 1,Y i 1 2 (U i X i Y 1i Y 2i ) Now conisder nr 1 I(W 1 ;Y1 n W 2 ) + nǫ n I(W 1 ;Y1 n,y2 n W 2 ) + nǫ n = = I(W 1 ; Y 1i, Y 2i W 2,Y i 1 1, Y i 1 2 ) + nǫ n I(W 1 ; Y 1i, Y 2i U i ) + nǫ n I(X i ; Y 1i, Y 2i U i ) + nǫ n = = I(X i ; Y 1i U i ) + I(X i ;Y 2i Y 1i,U i ) + nǫ n I(X i ; Y 1i U i ) + nǫ n, (U i X i Y 1i Y 2i ) In general, feedback can enlarge the capacity region of degraded BC Capacity region of degraded BC with feedback is not known Gallager s 75th Birthday 28
29 Broadcast Channel with Degraded Message Sets Consider a general DM broadcast channel (X,p(y 1,y 2 x), Y 1, Y 2 ) Common message W 0 is to be sent to both Y 1 and Y 2, while message W 1 is to be sent only to Y 1 Korner-Marton 77: The capacity region is given by the set C 1 of all (R 0, R 1 ) such that: R 0 I(U;Y 2 ) R 1 I(X;Y 1 U) Achievability: Superposition coding R 0 + R 1 I(X;Y 1 ), for some p(u,x) Converse: Gallager-type converse doesn t seem to work: The first inequality holds with either U i = W 0, Y2 i 1 or U i = W 0, Y1 i 1, Y2 i 1, but neither works for the second inequality The second inequality works with U i = W 0, Y1 i 1, but the first doesn t Gallager s 75th Birthday 29
30 BC with Degraded Message Sets A Gallager type converse works, but needs a new ingredient [El Gamal] Define the set C 2 of all (R 0, R 1 ) such that: R 0 min {I(U;Y 1 ),I(U;Y 2 )} R 0 + R 1 min {I(X;Y 1 ),I(X;Y 1 U) + I(U;Y 2 )}, for some p(u,x) It is easy to show that C 2 C 1 Weak converse for C 2 : Define U i = W 0,Y i 1 1, Y n 2(i+1)!! It is not difficult to show that { } R 0 1 n min I(U i ; Y 1i ), I(U i ;Y 2i ) +ǫ n, R 0 +R 1 1 n The difficult step is to show that R 0 + R 1 1 (I(X i ; Y 1i U i ) + I(U i ;Y 2i )) + ǫ n n I(X i ;Y 1i )+ǫ n Gallager s 75th Birthday 30
31 To show this, consider n(r 0 + R 1 ) I(W 1 ; Y1 n W 0 ) + I(W 0 ; Y2 n ) + nǫ n ( ) = I(W 1 ;Y 1i W 0, Y1 i 1 ) + I(W 0 ; Y 2i Y2(i+1) n ) + nǫ n + ( ) I(W 1,Y2(i+1) n ; Y 1i W 0, Y1 i 1 ) + I(W 0,Y2(i+1) n ; Y 2i) ( ) I(X i ;Y 1i U i ) + I(Y2(i+1) n ;Y 1i W 0,Y1 i 1 ) ( I(U i ;Y 2i ) I(Y i 1 1 ; Y 2i W 0,Y n 2(i+1) ) ) + nǫ n. + nǫ n Gallager s 75th Birthday 31
32 To show this, consider n(r 0 + R 1 ) I(W 1 ; Y1 n W 0 ) + I(W 0 ; Y2 n ) + nǫ n ( ) = I(W 1 ;Y 1i W 0, Y1 i 1 ) + I(W 0 ; Y 2i Y2(i+1) n ) + nǫ n + ( ) I(W 1,Y2(i+1) n ; Y 1i W 0, Y1 i 1 ) + I(W 0,Y2(i+1) n ; Y 2i) ( ) I(X i ;Y 1i U i ) + I(Y2(i+1) n ;Y 1i W 0,Y1 i 1 ) ( I(U i ;Y 2i ) I(Y i 1 1 ; Y 2i W 0,Y n 2(i+1) ) ) + nǫ n. Now using the Csiszar lemma [Csiszar-Korner 1978] I(Y1 i 1 ; Y 2i W 0, Y2(i+1) n ) = I(Y2(i+1) n ;Y 1i W 0,Y1 i 1 ), the second and fourth terms cancel and the converse is proved Note: This problem is open for more than two users + nǫ n Gallager s 75th Birthday 32
33 Tightest Bounds on Capacity of Broadcast Channel Inner bound [Marton 79]: Set of rate triples (R 0, R 1, R 2 ) such that R 0 min {I(W; Y 1 ),I(W; Y 2 )}, R 0 + R 1 I(W,U; Y 1 ), R 0 + R 2 I(W,V ; Y 2 ), R 0 + R 1 + R 2 min{i(w, U; Y 1 ) + I(V ; Y 2 W), I(U;Y 1 W) + I(W, V ; Y 2 )} I(U;V W), for some p(w, u, v, x) Outer bound [Nair-El Gamal 2006]: Set of rate triples (R 1, R 2 ) such that R 0 min {I(W; Y 1 ),I(W; Y 2 )} R 0 + R 1 I(W,U; Y 1 ) R 0 + R 2 I(W,V ; Y 2 ) R 0 + R 1 + R 2 min{i(w, U; Y 1 ) + I(V ; Y 2 W, U),I(W, V ; Y 2 ) + I(U;Y 1 W,V )}, for some p(u, v, w, x) = p(u)p(v)p(w u, v)p(x u, v, w) Gallager s 75th Birthday 33
34 Tightest Bounds for Independent Messages Inner bound: Set of all rate pairs (R 1,R 2 ) such that R 1 I(W, U;Y 1 ) R 2 I(W, V ; Y 2 ) R 1 + R 2 min{i(w, U;Y 1 ) + I(V ; Y 2 W), I(W, V ; Y 2 ) + I(U; Y 1 V )} I(U; V W), for some p(u,v,w,x) = p(w)p(u,v w)p(x u,v,w) Outer bound: Set of all rate pairs (R 1,R 2 ) such that R 1 I(W, U;Y 1 ) R 2 I(W, V ;Y 2 ) R 1 + R 2 min{i(w, U;Y 1 ) + I(V ;Y 2 W, U),I(W, V ; Y 2 ) + I(U;Y 1 W,V )}, for some joint distribution p(u, v, w, x) = p(u)p(v)p(w u, v)p(x u, v, w) Gallager s 75th Birthday 34
35 Broadcast Channel: Summary Marton region is tight for all classes of BC channels where capacity is known and contains all other achievable rate regions Nair-El Gamal region is tight for all classes of BC channels where capacity is known Uses Gallager converse+csizsar Lemma Capacity of BC is still not known in general Is there a single-letter characterization? Does it use auxiliary random variables? If so, then the Gallager converse is again likely to play a key role Gallager s 75th Birthday 35
36 Gallager Converse: Other Multi-User Channels/Sources Lossless source coding with side information [Ahlswede-Korner 1975] Lossy source coding with side information [Wyner-Ziv 1976] Channel with state known at encoder [Gelfand-Pinsker 1980] uses Gallager converse+csiszar Lemma MAC with partially cooperating encoders [Willems 1983] MAC with cribbing encoders [Willems-van der Meulen, 1985] Rate distortion when side information may be absent [Heegard-Berger 1985] Multi-terminal source coding with one distortion criterion [Berger-Yeung 1989] Relay without delay [El Gamal-Hassanpour 2005] and, many others... Gallager s 75th Birthday 36
37 Conclusion Gallager converse has had a huge impact on the development of multi-user information theory Gallager converse has had a huge impact on my work Gallager s 75th Birthday 37
38 Conclusion Gallager converse has had a huge impact on the development of multi-user information theory Gallager converse has had a huge impact on my work But, Bob, what does the identification U i = W 2, Y i 1 1 really mean? Gallager s 75th Birthday 38
Lecture 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 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 informationSolutions to Homework Set #2 Broadcast channel, degraded message set, Csiszar Sum Equality
1st Semester 2010/11 Solutions to Homework Set #2 Broadcast channel, degraded message set, Csiszar Sum Equality 1. Convexity of capacity region of broadcast channel. Let C R 2 be the capacity region of
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 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 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 informationKatalin Marton. Abbas El Gamal. Stanford University. Withits A. El Gamal (Stanford University) Katalin Marton Withits / 9
Katalin Marton Abbas El Gamal Stanford University Withits 2010 A. El Gamal (Stanford University) Katalin Marton Withits 2010 1 / 9 Brief Bio Born in 1941, Budapest Hungary PhD from Eötvös Loránd University
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 informationRelay Networks With Delays
Relay Networks With Delays Abbas El Gamal, Navid Hassanpour, and James Mammen Department of Electrical Engineering Stanford University, Stanford, CA 94305-9510 Email: {abbas, navid, jmammen}@stanford.edu
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 informationFeedback Capacity of the Gaussian Interference Channel to Within Bits: the Symmetric Case
1 arxiv:0901.3580v1 [cs.it] 23 Jan 2009 Feedback Capacity of the Gaussian Interference Channel to Within 1.7075 Bits: the Symmetric Case Changho Suh and David Tse Wireless Foundations in the Department
More informationTwo Applications of the Gaussian Poincaré Inequality in the Shannon Theory
Two Applications of the Gaussian Poincaré Inequality in the Shannon Theory Vincent Y. F. Tan (Joint work with Silas L. Fong) National University of Singapore (NUS) 2016 International Zurich Seminar on
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 informationOn the Rate-Limited Gelfand-Pinsker Problem
On the Rate-Limited Gelfand-Pinsker Problem Ravi Tandon Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 74 ravit@umd.edu ulukus@umd.edu Abstract
More informationOn Two-user Fading Gaussian Broadcast Channels. with Perfect Channel State Information at the Receivers. Daniela Tuninetti
DIMACS Workshop on Network Information Theory - March 2003 Daniela Tuninetti 1 On Two-user Fading Gaussian Broadcast Channels with Perfect Channel State Information at the Receivers Daniela Tuninetti Mobile
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 informationOn the Capacity of Interference Channels with Degraded Message sets
On the Capacity of Interference Channels with Degraded Message sets Wei Wu, Sriram Vishwanath and Ari Arapostathis arxiv:cs/060507v [cs.it] 7 May 006 Abstract This paper is motivated by a sensor network
More informationCapacity Theorems for Relay Channels
Capacity Theorems for Relay Channels Abbas El Gamal Department of Electrical Engineering Stanford University April, 2006 MSRI-06 Relay Channel Discrete-memoryless relay channel [vm 7] Relay Encoder Y n
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 informationVariable Length Codes for Degraded Broadcast Channels
Variable Length Codes for Degraded Broadcast Channels Stéphane Musy School of Computer and Communication Sciences, EPFL CH-1015 Lausanne, Switzerland Email: stephane.musy@ep.ch Abstract This paper investigates
More informationCapacity of a Class of Deterministic Relay Channels
Capacity of a Class of Deterministic Relay Channels Thomas M. Cover Information Systems Laboratory Stanford University Stanford, CA 94305, USA cover@ stanford.edu oung-han Kim Department of ECE University
More informationOn The Binary Lossless Many-Help-One Problem with Independently Degraded Helpers
On The Binary Lossless Many-Help-One Problem with Independently Degraded Helpers Albrecht Wolf, Diana Cristina González, Meik Dörpinghaus, José Cândido Silveira Santos Filho, and Gerhard Fettweis Vodafone
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 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 informationThe Capacity Region of a Class of Discrete Degraded Interference Channels
The Capacity Region of a Class of Discrete Degraded Interference Channels Nan Liu Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 74 nkancy@umd.edu
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 informationLattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function
Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function Dinesh Krithivasan and S. Sandeep Pradhan Department of Electrical Engineering and Computer Science,
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 informationCoding Techniques for Primitive Relay Channels
Forty-Fifth Annual Allerton Conference Allerton House, UIUC, Illinois, USA September 26-28, 2007 WeB1.2 Coding Techniques for Primitive Relay Channels Young-Han Kim Abstract We give a comprehensive discussion
More informationProblemsWeCanSolveWithaHelper
ITW 2009, Volos, Greece, June 10-12, 2009 ProblemsWeCanSolveWitha Haim Permuter Ben-Gurion University of the Negev haimp@bgu.ac.il Yossef Steinberg Technion - IIT ysteinbe@ee.technion.ac.il Tsachy Weissman
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 informationCommon Information. Abbas El Gamal. Stanford University. Viterbi Lecture, USC, April 2014
Common Information Abbas El Gamal Stanford University Viterbi Lecture, USC, April 2014 Andrew Viterbi s Fabulous Formula, IEEE Spectrum, 2010 El Gamal (Stanford University) Disclaimer Viterbi Lecture 2
More informationCapacity of a Class of Cognitive Radio Channels: Interference Channels with Degraded Message Sets
Capacity of a Class of Cognitive Radio Channels: Interference Channels with Degraded Message Sets Wei Wu, Sriram Vishwanath and Ari Arapostathis Abstract This paper is motivated by two different scenarios.
More informationCapacity of a Class of Semi-Deterministic Primitive Relay Channels
Capacity of a Class of Semi-Deterministic Primitive Relay Channels Ravi Tandon Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 2742 ravit@umd.edu
More informationCapacity Bounds for Diamond Networks
Technische Universität München Capacity Bounds for Diamond Networks Gerhard Kramer (TUM) joint work with Shirin Saeedi Bidokhti (TUM & Stanford) DIMACS Workshop on Network Coding Rutgers University, NJ
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 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 informationInteractive Decoding of a Broadcast Message
In Proc. Allerton Conf. Commun., Contr., Computing, (Illinois), Oct. 2003 Interactive Decoding of a Broadcast Message Stark C. Draper Brendan J. Frey Frank R. Kschischang University of Toronto Toronto,
More informationAn Outer Bound for the Gaussian. Interference channel with a relay.
An Outer Bound for the Gaussian Interference Channel with a Relay Ivana Marić Stanford University Stanford, CA ivanam@wsl.stanford.edu Ron Dabora Ben-Gurion University Be er-sheva, Israel ron@ee.bgu.ac.il
More informationCapacity of the Discrete Memoryless Energy Harvesting Channel with Side Information
204 IEEE International Symposium on Information Theory Capacity of the Discrete Memoryless Energy Harvesting Channel with Side Information Omur Ozel, Kaya Tutuncuoglu 2, Sennur Ulukus, and Aylin Yener
More informationList of Figures. Acknowledgements. Abstract 1. 1 Introduction 2. 2 Preliminaries Superposition Coding Block Markov Encoding...
Contents Contents i List of Figures iv Acknowledgements vi Abstract 1 1 Introduction 2 2 Preliminaries 7 2.1 Superposition Coding........................... 7 2.2 Block Markov Encoding.........................
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 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 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 informationReliable Computation over Multiple-Access Channels
Reliable Computation over Multiple-Access Channels Bobak Nazer and Michael Gastpar Dept. of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley, CA, 94720-1770 {bobak,
More informationSum Capacity of Gaussian Vector Broadcast Channels
Sum Capacity of Gaussian Vector Broadcast Channels Wei Yu, Member IEEE and John M. Cioffi, Fellow IEEE Abstract This paper characterizes the sum capacity of a class of potentially non-degraded Gaussian
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 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 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 informationThe Capacity Region of the Cognitive Z-interference Channel with One Noiseless Component
1 The Capacity Region of the Cognitive Z-interference Channel with One Noiseless Component Nan Liu, Ivana Marić, Andrea J. Goldsmith, Shlomo Shamai (Shitz) arxiv:0812.0617v1 [cs.it] 2 Dec 2008 Dept. of
More information5958 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 12, DECEMBER 2010
5958 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 12, DECEMBER 2010 Capacity Theorems for Discrete, Finite-State Broadcast Channels With Feedback and Unidirectional Receiver Cooperation Ron Dabora
More informationarxiv: v2 [cs.it] 28 May 2017
Feedback and Partial Message Side-Information on the Semideterministic Broadcast Channel Annina Bracher and Michèle Wigger arxiv:1508.01880v2 [cs.it] 28 May 2017 May 30, 2017 Abstract The capacity of the
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 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 informationThe Poisson Channel with Side Information
The Poisson Channel with Side Information Shraga Bross School of Enginerring Bar-Ilan University, Israel brosss@macs.biu.ac.il Amos Lapidoth Ligong Wang Signal and Information Processing Laboratory ETH
More informationThe Capacity of the Semi-Deterministic Cognitive Interference Channel and its Application to Constant Gap Results for the Gaussian Channel
The Capacity of the Semi-Deterministic Cognitive Interference Channel and its Application to Constant Gap Results for the Gaussian Channel Stefano Rini, Daniela Tuninetti, and Natasha Devroye Department
More informationIET Commun., 2009, Vol. 3, Iss. 4, pp doi: /iet-com & The Institution of Engineering and Technology 2009
Published in IET Communications Received on 10th March 2008 Revised on 10th July 2008 ISSN 1751-8628 Comprehensive partial decoding approach for two-level relay networks L. Ghabeli M.R. Aref Information
More informationBounds and Capacity Results for the Cognitive Z-interference Channel
Bounds and Capacity Results for the Cognitive Z-interference Channel Nan Liu nanliu@stanford.edu Ivana Marić ivanam@wsl.stanford.edu Andrea J. Goldsmith andrea@wsl.stanford.edu Shlomo Shamai (Shitz) Technion
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 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 informationIEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 62, NO. 5, MAY
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 6, NO. 5, MAY 06 85 Duality of a Source Coding Problem and the Semi-Deterministic Broadcast Channel With Rate-Limited Cooperation Ziv Goldfeld, Student Member,
More informationJoint Source-Channel Coding for the Multiple-Access Relay Channel
Joint Source-Channel Coding for the Multiple-Access Relay Channel Yonathan Murin, Ron Dabora Department of Electrical and Computer Engineering Ben-Gurion University, Israel Email: moriny@bgu.ac.il, ron@ee.bgu.ac.il
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 informationSide-information Scalable Source Coding
Side-information Scalable Source Coding Chao Tian, Member, IEEE, Suhas N. Diggavi, Member, IEEE Abstract The problem of side-information scalable (SI-scalable) source coding is considered in this work,
More informationThe Role of Directed Information in Network Capacity
The Role of Directed Information in Network Capacity Sudeep Kamath 1 and Young-Han Kim 2 1 Department of Electrical Engineering Princeton University 2 Department of Electrical and Computer Engineering
More informationOn Scalable Source Coding for Multiple Decoders with Side Information
On Scalable Source Coding for Multiple Decoders with Side Information Chao Tian School of Computer and Communication Sciences Laboratory for Information and Communication Systems (LICOS), EPFL, Lausanne,
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 informationAnalyzing Large Communication Networks
Analyzing Large Communication Networks Shirin Jalali joint work with Michelle Effros and Tracey Ho Dec. 2015 1 The gap Fundamental questions: i. What is the best achievable performance? ii. How to communicate
More informationAchieving Shannon Capacity Region as Secrecy Rate Region in a Multiple Access Wiretap Channel
Achieving Shannon Capacity Region as Secrecy Rate Region in a Multiple Access Wiretap Channel Shahid Mehraj Shah and Vinod Sharma Department of Electrical Communication Engineering, Indian Institute of
More informationRemote Source Coding with Two-Sided Information
Remote Source Coding with Two-Sided Information Basak Guler Ebrahim MolavianJazi Aylin Yener Wireless Communications and Networking Laboratory Department of Electrical Engineering The Pennsylvania State
More informationInteractive Hypothesis Testing with Communication Constraints
Fiftieth Annual Allerton Conference Allerton House, UIUC, Illinois, USA October - 5, 22 Interactive Hypothesis Testing with Communication Constraints Yu Xiang and Young-Han Kim Department of Electrical
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 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 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 informationDuality Between Channel Capacity and Rate Distortion With Two-Sided State Information
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 6, JUNE 2002 1629 Duality Between Channel Capacity Rate Distortion With Two-Sided State Information Thomas M. Cover, Fellow, IEEE, Mung Chiang, Student
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 informationSecret Key Agreement Using Conferencing in State- Dependent Multiple Access Channels with An Eavesdropper
Secret Key Agreement Using Conferencing in State- Dependent Multiple Access Channels with An Eavesdropper Mohsen Bahrami, Ali Bereyhi, Mahtab Mirmohseni and Mohammad Reza Aref Information Systems and Security
More informationOn Scalable Coding in the Presence of Decoder Side Information
On Scalable Coding in the Presence of Decoder Side Information Emrah Akyol, Urbashi Mitra Dep. of Electrical Eng. USC, CA, US Email: {eakyol, ubli}@usc.edu Ertem Tuncel Dep. of Electrical Eng. UC Riverside,
More informationPaul Cuff, Han-I Su, and Abbas EI Gamal Department of Electrical Engineering Stanford University {cuff, hanisu,
Cascade Multiterminal Source Coding Paul Cuff, Han-I Su, and Abbas EI Gamal Department of Electrical Engineering Stanford University E-mail: {cuff, hanisu, abbas}@stanford.edu Abstract-We investigate distributed
More informationAN INTRODUCTION TO SECRECY CAPACITY. 1. Overview
AN INTRODUCTION TO SECRECY CAPACITY BRIAN DUNN. Overview This paper introduces the reader to several information theoretic aspects of covert communications. In particular, it discusses fundamental limits
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 informationOn Dependence Balance Bounds for Two Way Channels
On Dependence Balance Bounds for Two Way Channels Ravi Tandon Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 20742 ravit@umd.edu ulukus@umd.edu
More informationLecture 1: The Multiple Access Channel. Copyright G. Caire 12
Lecture 1: The Multiple Access Channel Copyright G. Caire 12 Outline Two-user MAC. The Gaussian case. The K-user case. Polymatroid structure and resource allocation problems. Copyright G. Caire 13 Two-user
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 Masking and Amplification: The Source Coding Setting
202 IEEE International Symposium on Information Theory Proceedings Information Masking and Amplification: The Source Coding Setting Thomas A. Courtade Department of Electrical Engineering University of
More informationCut-Set Bound and Dependence Balance Bound
Cut-Set Bound and Dependence Balance Bound Lei Xiao lxiao@nd.edu 1 Date: 4 October, 2006 Reading: Elements of information theory by Cover and Thomas [1, Section 14.10], and the paper by Hekstra and Willems
More informationSOURCE CODING WITH SIDE INFORMATION AT THE DECODER (WYNER-ZIV CODING) FEB 13, 2003
SOURCE CODING WITH SIDE INFORMATION AT THE DECODER (WYNER-ZIV CODING) FEB 13, 2003 SLEPIAN-WOLF RESULT { X i} RATE R x ENCODER 1 DECODER X i V i {, } { V i} ENCODER 0 RATE R v Problem: Determine R, the
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 informationAmobile satellite communication system, like Motorola s
I TRANSACTIONS ON INFORMATION THORY, VOL. 45, NO. 4, MAY 1999 1111 Distributed Source Coding for Satellite Communications Raymond W. Yeung, Senior Member, I, Zhen Zhang, Senior Member, I Abstract Inspired
More informationCapacity of channel with energy harvesting transmitter
IET Communications Research Article Capacity of channel with energy harvesting transmitter ISSN 75-868 Received on nd May 04 Accepted on 7th October 04 doi: 0.049/iet-com.04.0445 www.ietdl.org Hamid Ghanizade
More informationThe Capacity Region of the Gaussian MIMO Broadcast Channel
0-0 The Capacity Region of the Gaussian MIMO Broadcast Channel Hanan Weingarten, Yossef Steinberg and Shlomo Shamai (Shitz) Outline Problem statement Background and preliminaries Capacity region of the
More informationSecret Key Agreement Using Asymmetry in Channel State Knowledge
Secret Key Agreement Using Asymmetry in Channel State Knowledge Ashish Khisti Deutsche Telekom Inc. R&D Lab USA Los Altos, CA, 94040 Email: ashish.khisti@telekom.com Suhas Diggavi LICOS, EFL Lausanne,
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 informationOuter Bounds on the Secrecy Capacity Region of the 2-user Z Interference Channel With Unidirectional Transmitter Cooperation
Outer Bounds on the Secrecy Capacity Region of the 2-user Z Interference Channel With Unidirectional Transmitter Cooperation Parthajit Mohapatra, Chandra R. Murthy, and Jemin Lee itrust, Centre for Research
More informationSUCCESSIVE refinement of information, or scalable
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 8, AUGUST 2003 1983 Additive Successive Refinement Ertem Tuncel, Student Member, IEEE, Kenneth Rose, Fellow, IEEE Abstract Rate-distortion bounds for
More informationFeedback Capacity of a Class of Symmetric Finite-State Markov Channels
Feedback Capacity of a Class of Symmetric Finite-State Markov Channels Nevroz Şen, Fady Alajaji and Serdar Yüksel Department of Mathematics and Statistics Queen s University Kingston, ON K7L 3N6, Canada
More informationExercise 1. = P(y a 1)P(a 1 )
Chapter 7 Channel Capacity Exercise 1 A source produces independent, equally probable symbols from an alphabet {a 1, a 2 } at a rate of one symbol every 3 seconds. These symbols are transmitted over a
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 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 informationACOMMUNICATION situation where a single transmitter
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 9, SEPTEMBER 2004 1875 Sum Capacity of Gaussian Vector Broadcast Channels Wei Yu, Member, IEEE, and John M. Cioffi, Fellow, IEEE Abstract This paper
More information