#### DMCA

## 1On the Two-user Interference Channel with Partial Codebook Knowledge at one Receiver

### Citations

1329 | Information Theory: Coding Theorems for Discrete Memoryless Systems - Csiszár, Körner - 1981 |

473 |
A new achievable rate region for the interference channel
- Han, Kobayashi
- 1981
(Show Context)
Citation Context ...his front by demonstrating that certain rates are achievable for the Gaussian noise interference channel with oblivious receivers (G-IC-OR) through the evaluation of a simplified Han-Kobayashi scheme =-=[6]-=- in which joint decoding of the intended and interfering messages is not required at the oblivious receiver. The major contribution of this work is the May 7, 2014 DRAFT 3realization that Gaussian inp... |

444 | Gaussian Interference Channel Capacity to Within One Bit
- Etkin, Tse, et al.
- 2008
(Show Context)
Citation Context ... index so as to obtain the classical LDA-IC with full codebook knowledge, we immediately have d(α) ≤ d(W)(α) = min ( 1,max (α 2 , 1− α 2 ) ,max (α, 1− α) ) , (15) where d(W)(α), the so-called W-curve =-=[17]-=-, is the maximum symmetric rate of the classical LDA-IC. In [13] it was shown that i.i.d. Bernoulli(1/2) input bits in the Han and Kobayashi region yield d(W)(α). Although Theorem 2 gives the exact ca... |

375 |
Network Information Theory
- Gamal, Kim
- 2012
(Show Context)
Citation Context ... 2 (Y n 2 , F2), such that the average probability of error satisfies maxi∈[1:2] P[Ŵi 6= Wi] → 0 as n → +∞. The capacity region is defined as the convex closure of all achievable rate pairs (R1, R2) =-=[14]-=-. May 7, 2014 DRAFT 8C. Injective Semi-Deterministic IC-OR For a general memoryless IC-OR, no restrictions are imposed on the transition probability PY1Y2|X1X2 . The ISD-IC-OR is a special IC-OR with ... |

292 | Wireless network information flow: A deterministic approach
- Avestimehr, Diggavi, et al.
- 2011
(Show Context)
Citation Context ...for the injective fully deterministic IC-OR the gap is zero. 3) Next, we look at the practically relevant G-IC-OR and its corresponding Linear Deterministic Approximation (LDA-IC-OR) in the spirit of =-=[12]-=-, which models the G-IC-OR at high SNR. Surprisingly, for the LDA-IC-OR we demonstrate that for a given achievability scheme, i.i.d. Bernoulli(1/2) input bits (known to be optimal for the LDA-IC with ... |

131 |
The capacity region of a class of deterministic interference channels
- Gamal, Costa
- 1982
(Show Context)
Citation Context ...l class of ISD-IC-OR for which the gap to capacity is zero. D. Exact Capacity for the Injective Fully Deterministic IC-OR We now specialize Theorem 5 to the class of injective fully deterministic ICs =-=[16]-=-. For this class of channels the mappings T1 and T2 in (5) are deterministic functions of X1 and X2, respectively. We have Corollary 6. For the injective fully deterministic IC-OR the outer bound in T... |

123 |
Lattices which are good for (almost) everything
- Erez, Litsyn, et al.
- 2005
(Show Context)
Citation Context ... = 22 − , 0 < 1, for which b√1 + SNRc2 = (2− 1)2 = 1. An interesting question is by how much the “shaping loss” and the “integer penalty” can be reduced by using multidimensional “good” lattices =-=[19]-=-. VI. ACHIEVABLE REGIONS FOR THE G-IC-OR We now analyze the G-IC-OR by using Theorem 8 (i.e., bounds on the mutual information achievable by a PAM input on a point-to-point power-constrained Gaussian ... |

117 |
The two-user Gaussian interference channel: a deterministic view
- Bresler, Tse
- 2008
(Show Context)
Citation Context ...OR at high SNR. Surprisingly, for the LDA-IC-OR we demonstrate that for a given achievability scheme, i.i.d. Bernoulli(1/2) input bits (known to be optimal for the LDA-IC with full codebook knowledge =-=[13]-=-) are outperformed by other input distributions. 4) For the G-IC-OR, we show that our inner and outer bounds that are to within 1/2 bit (per channel use per user) of one another. However, similarly to... |

54 |
Bounds on the capacity region of a class of interference channels
- Telatar, Tse
- 2007
(Show Context)
Citation Context ...this work are as follows. The general memoryless IC-OR channel model is introduced in Section II, together with the special class of injective semi-deterministic May 7, 2014 DRAFT 4IC-ORs (ISD-IC-OR) =-=[11]-=- of which the Gaussian noise channel is an example. Then: 1) In Section III we derive a novel outer bound that incorporates this partial codebook knowledge explicitly. In this bound, the single rate b... |

44 | Communication via decentralized processing
- Sanderovich, Shamai, et al.
- 2008
(Show Context)
Citation Context ...ial codebook knowledge and to nodes with only knowledge of a subset of the codebooks as oblivious nodes. To the best of our knowledge, systems with partial codebook knowledge were first introduced in =-=[3]-=-. In [3] lack of codebook knowledge was modeled by using codebook indices, which index the random encoding function that maps the messages to the codewords. If a node has codebook knowledge it knows t... |

15 | The impact of constellation cardinality on Gaussian channel capacity
- Wu, Verdú
(Show Context)
Citation Context ...iple receivers each characterized by a different SNR; 2) we need a firm bound that holds at all finite SNR; and 3) we need to properly choose N as a function of SNR, a question posed but left open in =-=[8]-=-. The sub-optimality of Gaussian inputs for Gaussian noise channels has been observed before. Past work on the asynchronous IC [9], [10] showed that non-Gaussian inputs may outperform i.i.d. Gaussian ... |

11 |
On the capacity of the Gaussian channel with a finite number of input levels
- Ozarow, Wyner
- 1990
(Show Context)
Citation Context ... discrete points. We then properly design the distribution of the mixed input as a function of the channel parameters. We are not the first to consider discrete inputs for Gaussian noise channels. In =-=[7]-=- the authors considered the point-to-point power-constrained Gaussian noise channel and derived lower bounds on the achievable rate when the input is contained to be an equally spaced Pulse Amplitude ... |

9 | On Codebook Information for Interference Relay Channels With Out-of-Band Relaying
- Simeone, Erkip, et al.
- 2011
(Show Context)
Citation Context ...om encoding function used; else it does not and the codewords essentially look like the symbols were produced in an independent, identically distributed (i.i.d.) fashion from a given distribution. In =-=[4]-=- and [5] this concept of partial codebook knowledge was extended to model oblivious relays and capacity results were derived. However, as pointed out in [4, Section III.A] and [5, Remark 5], these cap... |

9 | Multidimensional constellations I: Introduction, figures of merit, and generalized cross constellations - Wei - 1989 |

5 | Relaying for multiple sources in the absence of codebook information
- Tian, Yener
- 2011
(Show Context)
Citation Context ...ing function used; else it does not and the codewords essentially look like the symbols were produced in an independent, identically distributed (i.i.d.) fashion from a given distribution. In [4] and =-=[5]-=- this concept of partial codebook knowledge was extended to model oblivious relays and capacity results were derived. However, as pointed out in [4, Section III.A] and [5, Remark 5], these capacity re... |

5 | The Totally Asynchronous Interference Channel with Single-User Receivers
- Calvo, Fonollosa, et al.
(Show Context)
Citation Context ...erly choose N as a function of SNR, a question posed but left open in [8]. The sub-optimality of Gaussian inputs for Gaussian noise channels has been observed before. Past work on the asynchronous IC =-=[9]-=-, [10] showed that non-Gaussian inputs may outperform i.i.d. Gaussian inputs by using local perturbations of an i.i.d. Gaussian input: [9, Lemma 3] considers a fourth order approximation of mutual inf... |

4 | A coordinate system for Gaussian Networks
- Abbe, Zheng
(Show Context)
Citation Context ...choose N as a function of SNR, a question posed but left open in [8]. The sub-optimality of Gaussian inputs for Gaussian noise channels has been observed before. Past work on the asynchronous IC [9], =-=[10]-=- showed that non-Gaussian inputs may outperform i.i.d. Gaussian inputs by using local perturbations of an i.i.d. Gaussian input: [9, Lemma 3] considers a fourth order approximation of mutual informati... |

3 | On discrete alphabets for the two-user gaussian interference channel with one receiver lacking knowledge of the interfering codebook,” http://arxiv.org/pdf/1401.5536.pdf - Dytso, Tuninetti, et al. |

2 | On the capacity of interference channels with partial codebook knowledge
- Dytso, Devroye, et al.
(Show Context)
Citation Context ...linois at Chicago, Chicago, IL 60607 USA (e-mail: odytso2, danielat, devroye @uic.edu). The results in this paper were presented in part at the 2013 IEEE International Symposium on Information Theory =-=[1]-=- and at the 2014 IEEE Information Theory and Applications Workshop [2]. The work of the authors was partially funded by NSF under award number 1017436. The contents of this article are solely the resp... |