A Comparison of Two Achievable Rate Regions for the Interference Channel
|
|
- Isaac Bailey
- 6 years ago
- Views:
Transcription
1 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 Abstract A recent result for the general interference channel is presented. The encoding technique is a generalization of the technique employed by Han and Kobayashi. Coupled with an improvement in the computation of the error probabilities, fewer constraints are necessary to define the achievable rate region. We further compare the two achievable rate regions and discuss whether the two achievable rate regions are equivalent. I. INTRODUCTION An interference channel (IC) models the situation where M unrelated senders try to communicate their separate information to M different receivers via a common channel. There is no cooperation between any of the receivers or senders. Hence, transmission of information from each sender to its corresponding receiver interferes with the communication between the other senders and their receivers. In this paper, we consider only the two-user IC. The study of the IC was first initiated by Shannon [1], and was further studied by Ahlswede []. Carleial [3] established several fundamental results, and also determined an improved achievable rate region for the IC. Han and Kobayashi introduced a superior decoder and established the best achievable rate region to date for the general IC [4]. Except for the Gaussian IC under strong interference ( [5], [6], [4]), a class of discrete additive degraded IC [7], a class of deterministic IC [8] and the discrete memoryless IC with strong interference [9], the capacity of the general IC remains unknown to date. The purpose of this paper is to compare two achievable rate regions for the general IC. In Section II, we first give a description of the mathematical model for the discrete memoryless IC. In Section III, we review the best achievable rate region for the general IC to date by Han and Kobayashi. We call this the Han-Kobayashi region. Next, in Section IV, we derive an achievable rate region for the general IC which contains the Han-Kobayashi region. We term this the Chong-Motani- Garg region. Finally, in Section V, we provide comparisons between the Han-Kobayashi region and the Chong-Motani- Garg region. II. MATHEMATICAL PRELIMINARIES A. Discrete Memoryless Interference Channel A two-user discrete interference channel consists of four finite sets X 1, X, Y 1, Y, and conditional probability distributions p (.,. x 1, x ) on Y 1 Y, where (x 1, x ) X 1 X. The interference channel is said to be memoryless if n p (y1 n, y n x n 1, x n ) = p (y1i, n yi x n n 1i, x n i). (1) A ( nr1, nr, n ) code for an interference channel with independent information consists of two encoders and two decoding functions f 1 : { 1,..., nr1} X n 1 f : { 1,..., nr} X n g 1 :Y n 1 { 1,..., nr1} g :Y n { 1,..., nr}. () The average probability of error is defined as the probability the decoded message is not equal to the transmitted message, i.e., P (n) e = Pr (g 1 (Y n 1 ) W 1 or g (Y n ) W ) (3) where (W 1, W ) are assumed to be uniformly distributed over nr1 nr. A rate pair (R 1, R ) is said to be achievable for the interference channel if there exists a sequence of ( nr1, nr, n ) codes with P e (n) 0. We also denote by A ɛ (n) the set of jointly ɛ-typical sequences. B. Gaussian Interference Channel The discrete-time additive white Gaussian IC, shown in Fig. 1, is described by Y 1 = c 11 X 1 c 1 X Z 1 (4) Y = c 1 X 1 c X Z (5) where the input and output signals are real, the coefficients c ij are real constants, and the noise terms Z 1 and Z are zeromean Gaussian random variables. Also, the mean value of X1 and X cannot exceed P 1 and P respectively. In [3], it was shown that any Gaussian IC can be reduced to its standard form, where c 11 = c = 1 and E [ [ ] Z1] = E Z = 1. The capacity of the Gaussian IC is not known, except for the case of no interference, where c 1 = c 1 = 0, for the case of strong interference, where c 1 1 and c 1 1 and a mixture of these two cases, where c 1 = 0 and c 1 1 or c 1 = 0 and c 1 1.
2 Theorem 1: For a fixed P P, let R HK (P ) be the set of (R 1, R ) satisfying R 1 R 11 R 1 (7) R R 1 R (8) where Fig. 1. The Gaussian interference channel III. HAN-KOBAYASHI RATE REGION In [4], the authors established an achievable rate region for the general interference channel. They considered 5 auxiliary random variables Q, U 1, W 1, U and W, defined on arbitrary finite sets Q, U 1, W 1, U and W respectively. X 1 and X are the input random variables defined on the input alphabet sets X 1 and X respectively, while Y 1 and Y are the output random variables defined on the output alphabet sets Y 1 and Y respectively. Each of the encoders splits its respective rates into two parts, where the auxiliary random variables U 1 and U serve as cloud centers that can be distinguished by both receivers. Hence, U 1 represents information intended for receiver 1 but that can also be decoded by receiver, while W 1 represents information intended for receiver 1 but that cannot be decoded by receiver. The same applies to auxiliary random variables U and W. This is basically an application of the superposition coding technique of Cover [10] and was first applied by Carleial [3] to the Gaussian IC. However, Carleial made use of a sequential decoder, decoding U 1 and U first before decoding W 1 and W. Han and Kobayashi applied a more powerful decoding technique known as simultaneous decoding. Receiver 1 decodes U 1 and W 1 simultaneously, while receiver decodes U and W simultaneously. Moreover, they introduced a time-sharing parameter Q instead of using the convex-hull operation. This time-sharing parameter Q will also include the time division multiplex/frequency division multiplex strategy introduced by Carleial [3]. We next describe this achievable rate region. Let P be the set of probability distributions P (.) that factor as P (q, u 1, w 1, u, w, x 1, x ) =p (q) p (u 1 q) p (w 1 q) p (u q) p (w q) p (x 1 u 1, w 1, q) p (x u, w, q) (6) R 11 I (W 1 ; Y 1 U 1 U Q) (9) R 1 I (U 1 ; Y 1 W 1 U Q) (10) R 1 I (U ; Y 1 W 1 U 1 Q) (11) R 11 R 1 I (U 1 W 1 ; Y 1 U Q) (1) R 11 R 1 I (W 1 U ; Y 1 U 1 Q) (13) R 1 R 1 I (U 1 U ; Y 1 W 1 Q) (14) R 11 R 1 R 1 I (U 1 W 1 U ; Y 1 Q) (15) R I (W ; Y U U 1 Q) (16) R 1 I (U ; Y W U 1 Q) (17) R 1 I (U 1 ; Y W U Q) (18) R 1 R I (U W ; Y U 1 Q) (19) R R 1 I (W U 1 ; Y U Q) (0) R 1 R 1 I (U U 1 ; Y W Q) (1) R 1 R R 1 I (U W U 1 ; Y Q) () Then the following set P P R HK (P ) (3) is an achievable rate region for the discrete memoryless IC. The bounds (7)-() can be simplified by using Fourier- Motzkin elimination [4, Theorem 4.1]. Moreover, X 1 is a deterministic function of U 1, W 1 and Q and X is a deterministic function of U, W and Q, i.e., X 1 = f 1 (U 1, W 1, Q) (4) X = f (U, W, Q). (5) Then, we can describe the Han-Kobayashi region R HK as follows. Theorem : For a fixed P P, let R HK (P ) be the set of (R 1, R ) satisfying R 1 ρ 1 (6) R ρ (7) R 1 R ρ 1 (8) R 1 R ρ 10 (9) R 1 R ρ 0 (30)
3 where ρ 1 = σ 1 I (X 1 ; Y 1 U 1 U Q) (31) ρ = σ I (X ; Y U 1 U Q) (3) ρ 1 = σ 1 I (X 1 ; Y 1 U 1 U Q) I (X ; Y U 1 U Q) (33) ρ 10 = σ 1 I (X 1 ; Y 1 U 1 U Q) I (X ; Y U 1 U Q) [σ 1 I (U 1 ; Y U Q)] I (U ; Y U 1 Q), min I (U ; Y Q) [I (U 1 ; Y U Q) σ 1 ], I (U ; Y 1 U 1 Q), I (U 1 U ; Y 1 Q) σ 1 (34) ρ 0 = σ I (X ; Y U 1 U Q) I (X 1 ; Y 1 U 1 U Q) [σ I (U ; Y 1 U 1 Q)] I (U 1 ; Y 1 U Q), min I (U 1 ; Y 1 Q) [I (U ; Y 1 U 1 Q) σ ], I (U 1 ; Y U Q), I (U 1 U ; Y Q) σ (35) σ 1 = min {I (U 1 ; Y 1 U Q), I (U 1 ; Y X Q)} (36) σ = min {I (U ; Y U 1 Q), I (U ; Y 1 X 1 Q)} (37) I (U 1 U ; Y 1 Q), I (U 1 U ; Y Q), σ 1 = min I (U 1 ; Y 1 U Q) I (U ; Y U 1 Q), I (U 1 ; Y U Q) I (U ; Y 1 U 1 Q) (38) Here, [x] = 0 if x 0, [x] = x if x > 0. Then, we have R HK (P ). (39) P P Even though the resulting bounds for Theorem may seem very complicated, we give a simplified version in Section V. This is to ease comparison with the Chong-Motani-Garg region which will be derived in the next section. IV. CHONG-MOTANI-GARG RATE REGION We now establish a potentially new achievable rate region for the interference channel. We make the observation that since both receivers are not interested in the message of the non-intended transmitters, constraints (11) and (18) are unnecessary to drive the probability of error to zero. Moreover, instead of 5 auxiliary random variables, we only consider 3 auxiliary random variables Q, U 1 and U defined on arbitrary finite sets Q, U 1 and U. Again, the auxiliary random variables U 1 and U will serve as cloud centers that can be distinguished by both receivers. For transmitter 1, instead of generating two independent codebooks with codewords U n 1 (j) and W1 n (k), for each codeword U n 1 (j), we generate a codebook with codewords W1 n (j, k), where j { } { } 1,,..., nr1 and k 1,,..., nr 11. Due to our code construction, the constraints (10), (14), (17) and (1) are unnecessary to drive the probability of error to zero. Let P1 be the set of probability distributions P 1 (.) that factor as P 1 (q, u 1, u, x 1, x ) =p (q) p (u 1 x 1 q) p (u x q) (40) Theorem 3: For a fixed P1 P1, let R CMG (P1 ) be the set of (R 1, R ) satisfying where Then the set given by R 1 R 11 R 1 (41) R R 1 R (4) R 11 I (X 1 ; Y 1 U 1 U Q) (43) R 11 R 1 I (U X 1 ; Y 1 U 1 Q) (44) R 11 R 1 I (X 1 ; Y 1 U Q) (45) R 11 R 1 R 1 I (U X 1 ; Y 1 Q) (46) R I (X ; Y U 1 U Q) (47) R R 1 I (U 1 X ; Y U Q) (48) R 1 R I (X ; Y U 1 Q) (49) R 1 R 1 R I (U 1 X ; Y Q) (50) R CMG = R CMG (P 1 ) (51) is an achievable rate region for the discrete memoryless IC. A. Proof of Theorem 3 Codebook Generation: Generate a codeword Q n of length n, generating each element i.i.d according to n p (q). For the codeword Q n, generate nr1 independent codewords U n 1 (j), j { } 1,,..., nr1, generating each element i.i.d according to p (u 1i q i ). For the codeword Q n, and each of the codeword U n 1 (j), generate nr11 i.i.d codewords X n 1 (j, k), k { } 1,,..., nr11, generating each element i.i.d according to p (x 1i q i, u 1i (j)). For the codeword Q n, generate nr1 independent codewords U n (l), l { 1,,..., nr1 }, generating each element i.i.d according to p (u i q i ). For the codeword Q n, and each of the codeword U n (l), generate nr i.i.d codewords X n (l, m), m { } 1,,..., nr, generating each element i.i.d according to p (x i q i, u i (l)). Encoding: For encoder 1, to send the codeword pair (j, k), send the corresponding codeword X n 1 (j, k). For encoder, to send the codeword pair (l, m), send the corresponding codeword X n (l, m). Decoding: Receiver 1 determines the unique and a ˆl such that ( (ĵ) (ˆl) ) U n 1, X n 1, U n, Y1 n A ɛ (n). (5) Receiver determines the unique (ˆl, ˆm) and a ĵ such that ( (ˆl) (ĵ) ) U n, X n (ˆl, ˆm), U n 1, Y n A ɛ (n). (53)
4 Analysis of the Probability of Error: We consider only the decoding error probability for receiver 1. The same analysis applies for receiver. By the symmetry of the random code construction, the conditional probability of error does not depend on which pair of indices is sent. Thus the conditional probability of error is the same as the unconditional probability of error. So, without loss of generality, we assume that (j, k) = (1, 1) and (l, m) = (1, 1) was sent. We have an error if the correct codewords, {U n 1 (1), X n 1 (1, 1), U n (1)} are not jointly typical with the received{ sequence. (ĵ) An error is also (ˆl)} declared if incorrect codewords U n 1, X n 1, U n where ĵ 1 or ˆk 1 are jointly typical with the received codeword. However, )} no error is declared if {U n 1 (1), X n 1 (1, 1), U (ˆl 1 are jointly typical with the received sequence. Define the following event { E jkl = (U n 1 (j), X n 1 (j, k), U n (l), Y n 1 ) A (n) ɛ Then by the union of events bound, ( ) P e (n) = P E111 c (j,k) (1,1) E jkl P (E111) c P (E j11 ) P (n) e j 1,k=1,l 1 j=1,k 1,l 1 j 1,k 1,l 1 j 1,k=1,l=1 P (E j1l ) P (E 1kl ) P (E jkl ) j=1,k 1,l=1 j 1,k 1,l=1 P (E c 111 ) nr1 n(i(x1;y1 UQ) 4ɛ) n(r1r1) n(i(ux1;y1 Q) 4ɛ) nr11 n(i(x1;y1 U1UQ) 4ɛ) n(r11r1) n(i(ux1;y1 U1Q) 4ɛ) n(r11r1) n(i(x1;y1 UQ) 4ɛ) }. (54) P (E 1k1 ) P (E jk1 ) n(r11r1r1) n(i(ux1;y1 Q) 4ɛ). (55) Since ɛ > 0 is arbitrary, the conditions of Theorem 3 imply that each term tends to 0 as n. The above bound shows that the average probability of error, averaged over all choices of codebooks in the random code construction, is arbitrarily small. Hence there exists at least one code C with arbitrarily small probability of error. Since we can choose a fixed P 1 such that P1 (q, u 1, u, x 1, x ) = P (q, u 1, u, w 1, w, x 1, x ) (56) w 1 W 1,w W we readily see that R HK (P ) R CMG (P1 ), and hence R HK R CMG. The bounds (41)-(50) can be again be simplified using Fourier-Motzkin elimination [11, Theorem 3]. Theorem 4: For a fixed P1 P1, let R CMG (P1 ) be the set of (R 1, R ) satisfying R 1 I (X 1 ; Y 1 U Q) (57) R I (X ; Y U 1 Q) (58) R 1 R I (X 1 U ; Y 1 Q) I (X ; Y U 1 U Q) (59) R 1 R I (X 1 ; Y 1 U 1 U Q) I (X U 1 ; Y Q) (60) R 1 R I (X 1 U ; Y 1 U 1 Q) I (X U 1 ; Y U Q) (61) R 1 R I (X 1 U ; Y 1 Q) I (X 1 ; Y 1 U 1 U Q) I (X U 1 ; Y U Q) (6) R 1 R I (X ; Y U 1 U Q) I (X U 1 ; Y Q) Then we have I (X 1 U ; Y 1 U 1 Q) (63) R CMG = R CMG (P 1 ). (64) V. COMPARING THE HAN-KOBAYASHI AND CHONG-MOTANI-GARG RATE REGIONS To facilitate comparison of the Han-Kobayashi rate region with the Chong-Motani-Garg rate region, we simplify the bounds in Theorem. In fact, many of the bounds are redundant and can be further reduced as in the following theorem. Theorem 5: For a fixed P 1 P 1, let R HK (P 1 ) be the set of (R 1, R ) satisfying R 1 min {I (U 1 ; Y 1 U Q), I (U 1 ; Y X Q)} I (X 1 ; Y 1 U 1 U Q) (65) R min {I (U ; Y U 1 Q), I (U ; Y 1 X 1 Q)} I (X ; Y U 1 U Q) (66) R 1 R I (X 1 U ; Y 1 Q) I (X ; Y U 1 U Q) (67) R 1 R I (X 1 ; Y 1 U 1 U Q) I (X U 1 ; Y Q) (68) R 1 R I (X 1 U ; Y 1 U 1 Q) I (X U 1 ; Y U Q) (69) R 1 R I (X 1 U ; Y 1 Q) I (X 1 ; Y 1 U 1 U Q) I (X U 1 ; Y U Q) (70) R 1 R I (X ; Y U 1 U Q) I (X U 1 ; Y Q) Finally, we have I (X 1 U ; Y 1 U 1 Q) (71) R HK (P 1 ). (7) The proof for the bounds on R 1 R can be found in [11]. In addition, given the constraints (65)-(69), it can be easily shown that all the other constraints in Theorem, except for (70)- (71), are redundant. Comparing the Han-Kobayashi region given by Theorem 5 with the Chong-Motani-Garg region given by Theorem 4, we again see that R HK R CMG. Moreover, the only difference lies in the bound for R 1 and R. In [11], Kramer asked whether there are ICs for which there exists P1 P 1 such that R HK (P1 ) R CMG (P1 ). For the Gaussian IC, when we set Q = 1, we can easily determine
5 Chong Motani Garg Region Han Kobayashi Region 0.6 R R 1 Fig.. Two rate regions for the Gaussian IC when P 1 = P = 6, c 1 = c 1 = 0.4 and α = β = 0.5 parameters where R HK (P1 ) R CMG (P1 ). We assume U 1, U, X 1 and X are Gaussian random variables where E [ ] [ ] U1 E [X1 ] = α, E U E [X ] = β (73) such that α [0, 1], β [0, 1], E [ X 1] = P1 and E [ X ] = P. From Fig., we see that when P 1 = P = 6, c 1 = c 1 = 0.4 and α = β = 0.5, R HK (P 1 ) R CMG (P 1 ). However, this is only for particular choices of P 1 P 1. Our numerical simulations seem to indicate that R CMG for the Gaussian IC. Currently, we have still been unable to prove that R CMG or that R HK R CMG for the general IC, or even for the Gaussian IC. We conjecture that R CMG for the Gaussian IC, but that there may be other ICs where R HK R CMG. VI. CONCLUSION We have reviewed two rate regions for the general IC and made comparisons between the Han-Kobayashi rate region and the Chong-Motani-Garg rate region. We have reduced the bounds for the two rate regions to their simplest forms for comparison. Even though the Chong-Motani-Garg rate region will always include the Han-Kobayashi rate region, it is not known whether the two rate regions are equivalent for all ICs. REFERENCES [1] C. E. Shannon, Two-way communication channels, in Proc. 4th Berkeley Symp. on Mathematical Statistics and Probability, vol. 1. Berkeley, CA: Univ. California Press, 1961, pp [] R. Ahlswede, The capacity region of a channel with two senders and two receivers, Annals Probabil., vol., no. 5, pp , [3] A. B. Carleial, Interference channels, IEEE Trans. Inform. Theory, vol. 4, no. 1, pp , Jan [4] T. S. Han and K. Kobayashi, A new achievable rate region for the interference channel, IEEE Trans. Inform. Theory, vol. 7, no. 1, pp , Jan [5] A. B. Carleial, A case where interference does not reduce capacity, IEEE Trans. Inform. Theory, vol. 1, no. 5, pp , Sept [6] H. Sato, The capacity of the Gaussian interference channel under strong interference, IEEE Trans. Inform. Theory, vol. 7, no. 6, pp , Nov [7] R. Benzel, The capacity region of a class of discrete additive degraded interference channels, IEEE Trans. Inform. Theory, vol. 5, no., pp. 8 31, March [8] A. A. E. Gamal and M. H. M. Costa, The capacity region of a class of determinstic interference channels, IEEE Trans. Inform. Theory, vol. 8, no., pp , March 198. [9] M. H. M. Costa and A. A. E. Gamal, The capacity region of the discrete memoryless interference channel with strong interference, IEEE Trans. Inform. Theory, vol. 33, no. 5, pp , Sept [10] T. M. Cover, An achievable rate region for the broadcasting channel, IEEE Trans. Inform. Theory, vol. 1, pp , July [11] G. Kramer, Review of rate regions for interference channels, International Zurich Seminar, Feb. 006.
Superposition 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 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 informationSurvey of Interference Channel
Survey of Interference Channel Alex Dytso Department of Electrical and Computer Engineering University of Illinois at Chicago, Chicago IL 60607, USA, Email: odytso2 @ uic.edu Abstract Interference Channel(IC)
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationPrimary Rate-Splitting Achieves Capacity for the Gaussian Cognitive Interference Channel
Primary Rate-Splitting Achieves Capacity for the Gaussian Cognitive Interference Channel Stefano Rini, Ernest Kurniawan and Andrea Goldsmith Technische Universität München, Munich, Germany, Stanford University,
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 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 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 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 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 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 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 information820 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 2, FEBRUARY Stefano Rini, Daniela Tuninetti, and Natasha Devroye
820 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 2, FEBRUARY 2012 Inner and Outer Bounds for the Gaussian Cognitive Interference Channel and New Capacity Results Stefano Rini, Daniela Tuninetti,
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 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 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 informationCognitive Multiple Access Networks
Cognitive Multiple Access Networks Natasha Devroye Email: ndevroye@deas.harvard.edu Patrick Mitran Email: mitran@deas.harvard.edu Vahid Tarokh Email: vahid@deas.harvard.edu Abstract A cognitive radio can
More informationi.i.d. Mixed Inputs and Treating Interference as Noise are gdof Optimal for the Symmetric Gaussian Two-user Interference Channel
iid Mixed nputs and Treating nterference as Noise are gdof Optimal for the Symmetric Gaussian Two-user nterference Channel Alex Dytso Daniela Tuninetti and Natasha Devroye University of llinois at Chicago
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 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 informationOn the Duality of Gaussian Multiple-Access and Broadcast Channels
On the Duality of Gaussian ultiple-access and Broadcast Channels Xiaowei Jin I. INTODUCTION Although T. Cover has been pointed out in [] that one would have expected a duality between the broadcast channel(bc)
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 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 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 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 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 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 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 informationInterference Channels with Source Cooperation
Interference Channels with Source Cooperation arxiv:95.319v1 [cs.it] 19 May 29 Vinod Prabhakaran and Pramod Viswanath Coordinated Science Laboratory University of Illinois, Urbana-Champaign Urbana, IL
More informationSum Capacity of General Deterministic Interference Channel with Channel Output Feedback
Sum Capacity of General Deterministic Interference Channel with Channel Output Feedback Achaleshwar Sahai Department of ECE, Rice University, Houston, TX 775. as27@rice.edu Vaneet Aggarwal Department of
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 informationA New Achievable Region for Gaussian Multiple Descriptions Based on Subset Typicality
0 IEEE Information Theory Workshop A New Achievable Region for Gaussian Multiple Descriptions Based on Subset Typicality Kumar Viswanatha, Emrah Akyol and Kenneth Rose ECE Department, University of California
More informationAccessible Capacity of Secondary Users
Accessible Capacity of Secondary Users Xiao Ma maxiao@mail.sysu.edu.cn Sun Yat-sen University November 14th, 2010 Xiao Ma (Sun Yat-sen Univ.) Accessible Capacity 11/14/2010 1 / 60 This talk is based on:
More informationTHE practical bottleneck of today s communication networks
1 Interference Channel with Generalized Feedback (a.k.a. with source cooperation: Part I: Achievable Region Shuang (Echo Yang and Daniela Tuninetti Abstract An Interference Channel with Generalized Feedback
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 the Capacity of Cognitive Radios in Multiple Access Networks
On the Capacity of Cognitive Radios in Multiple Access Networks Anelia Somekh-Baruch, Sriram Sridharan, Sriram Vishwanath, Sergio Verdú and Shlomo Shamai (Shitz Abstract This paper analyzes the fundamental
More informationAn Achievable Rate for the Multiple Level Relay Channel
An Achievable Rate for the Multiple Level Relay Channel Liang-Liang Xie and P. R. Kumar Department of Electrical and Computer Engineering, and Coordinated Science Laboratory University of Illinois, Urbana-Champaign
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 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 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 informationCommunication Games on the Generalized Gaussian Relay Channel
Communication Games on the Generalized Gaussian Relay Channel Dileep M. alathil Department of Electrical Engineering University of Southern California manisser@usc.edu Rahul Jain EE & ISE Departments University
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 informationBounds on Achievable Rates for General Multi-terminal Networks with Practical Constraints
Bounds on Achievable Rates for General Multi-terminal Networs with Practical Constraints Mohammad Ali Khojastepour, Ashutosh Sabharwal, and Behnaam Aazhang Department of Electrical and Computer Engineering
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 informationDiversity-Multiplexing Tradeoff of the Two-User Interference Channel
Diversity-Multiplexing Tradeoff of the Two-User Interference Channel arxiv:0905.0385v2 [cs.it] 8 Sep 2009 Adnan Raja and Pramod Viswanath April 9, 2018 Abstract Diversity-Multiplexing tradeoff DMT) is
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 information4 An Introduction to Channel Coding and Decoding over BSC
4 An Introduction to Channel Coding and Decoding over BSC 4.1. Recall that channel coding introduces, in a controlled manner, some redundancy in the (binary information sequence that can be used at the
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 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 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 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 Bounds for. the Gaussian Interference Channel
Capacity Bounds for the Gaussian Interference Channel Abolfazl S. Motahari, Student Member, IEEE, and Amir K. Khandani, Member, IEEE Coding & Signal Transmission Laboratory www.cst.uwaterloo.ca {abolfazl,khandani}@cst.uwaterloo.ca
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 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 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 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 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 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 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 informationDuality, Achievable Rates, and Sum-Rate Capacity of Gaussian MIMO Broadcast Channels
2658 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 49, NO 10, OCTOBER 2003 Duality, Achievable Rates, and Sum-Rate Capacity of Gaussian MIMO Broadcast Channels Sriram Vishwanath, Student Member, IEEE, Nihar
More informationDecentralized Simultaneous Energy and Information Transmission in Multiple Access Channels
Decentralized Simultaneous Energy and Information Transmission in Multiple Access Channels Selma Belhadj Amor, Samir M. Perlaza To cite this version: Selma Belhadj Amor, Samir M. Perlaza. Decentralized
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 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 informationAsymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities
Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities Vincent Y. F. Tan Dept. of ECE and Dept. of Mathematics National University of Singapore (NUS) September 2014 Vincent Tan
More informationThe Capacity Region for Multi-source Multi-sink Network Coding
The Capacity Region for Multi-source Multi-sink Network Coding Xijin Yan Dept. of Electrical Eng. - Systems University of Southern California Los Angeles, CA, U.S.A. xyan@usc.edu Raymond W. Yeung Dept.
More informationApproximate Capacity of Fast Fading Interference Channels with no CSIT
Approximate Capacity of Fast Fading Interference Channels with no CSIT Joyson Sebastian, Can Karakus, Suhas Diggavi Abstract We develop a characterization of fading models, which assigns a number called
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 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 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 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 informationInterference Decoding for Deterministic Channels Bernd Bandemer, Student Member, IEEE, and Abbas El Gamal, Fellow, IEEE
2966 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 57, NO. 5, MAY 2011 Interference Decoding for Deterministic Channels Bernd Bemer, Student Member, IEEE, Abbas El Gamal, Fellow, IEEE Abstract An inner
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 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 informationOn Achievability for Downlink Cloud Radio Access Networks with Base Station Cooperation
On Achievability for Downlink Cloud Radio Access Networks with Base Station Cooperation Chien-Yi Wang, Michèle Wigger, and Abdellatif Zaidi 1 Abstract arxiv:1610.09407v1 [cs.it] 8 Oct 016 This work investigates
More informationOn the Capacity of the Two-Hop Half-Duplex Relay Channel
On the Capacity of the Two-Hop Half-Duplex Relay Channel Nikola Zlatanov, Vahid Jamali, and Robert Schober University of British Columbia, Vancouver, Canada, and Friedrich-Alexander-University Erlangen-Nürnberg,
More informationIEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 4, APRIL
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 4, APRIL 2006 1545 Bounds on Capacity Minimum EnergyPerBit for AWGN Relay Channels Abbas El Gamal, Fellow, IEEE, Mehdi Mohseni, Student Member, IEEE,
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 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 informationLecture 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 informationEquivalence for Networks with Adversarial State
Equivalence for Networks with Adversarial State Oliver Kosut Department of Electrical, Computer and Energy Engineering Arizona State University Tempe, AZ 85287 Email: okosut@asu.edu Jörg Kliewer Department
More informationThe Nash Equilibrium Region of the Linear Deterministic Interference Channel with Feedback
The Nash Equilibrium Region of the Linear Deterministic Interference Channel with Feedback Samir M. Perlaza, Ravi Tandon, H. Vincent Poor and Zhu Han. Department of Electrical Engineering. Princeton University,
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 informationSoft Covering with High Probability
Soft Covering with High Probability Paul Cuff Princeton University arxiv:605.06396v [cs.it] 20 May 206 Abstract Wyner s soft-covering lemma is the central analysis step for achievability proofs of information
More informationApproximately achieving the feedback interference channel capacity with point-to-point codes
Approximately achieving the feedback interference channel capacity with point-to-point codes Joyson Sebastian*, Can Karakus*, Suhas Diggavi* Abstract Superposition codes with rate-splitting have been used
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 informationOn the Gaussian Z-Interference channel
On the Gaussian Z-Interference channel Max Costa, Chandra Nair, and David Ng University of Campinas Unicamp, The Chinese University of Hong Kong CUHK Abstract The optimality of the Han and Kobayashi achievable
More information