#### DMCA

## On the Two-User Interference Channel With Lack of Knowledge of the Interference Codebook at One Receiver

### Citations

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

479 |
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 =-=[4]-=- 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 realization that Gaussian inputs perform poorly ... |

448 | Gaussian interference channel capacity to within one bit
- Etkin, Tse, et al.
- 2008
(Show Context)
Citation Context ...ex 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 − α) ) , (14) where d(W)(α), the so-called W-curve =-=[19]-=-, 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... |

391 |
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[Ŵis= Wi ] → 0 as n → +∞. The capacity region is defined as the convex closure of all achievable rate pairs (R1, R2) =-=[14]-=-. Remark 1: One of the key features of our model is that the codebook index may change from codeword to codeword. In particular, one can show that the number of codebooks is given by |F | = |X |n2nR [... |

296 | Wireless network information flow: A deterministic approach
- Avestimehr, Diggavi, et al.
- 2011
(Show Context)
Citation Context ...ective fully deterministic IC-OR the gap is zero. 3) In Section IV-D, 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, whose exact capacity is in principal given by Corollary 6 but whose convex closure we were not able to determine directly. Surprisingly, for the LDA-IC-OR we nu... |

130 |
The capacity region of a class of deterministic interference channels
- Gamal, Costa
- 1982
(Show Context)
Citation Context ...IC WITH LACK OF KNOWLEDGE OF THE INTERFERENCE CODEBOOK 1263 D. Exact Capacity for the Injective Fully Deterministic IC-OR We now specialize Theorem 5 to the class of injective fully deterministic ICs =-=[18]-=-. 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... |

115 |
The two-user gaussian interference channel: a deterministic view
- Bresler, Tse
- 2008
(Show Context)
Citation Context ...or the LDA-IC-OR we numerically demonstrate that for the proposed achievable scheme in Proposition 3, 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 (correlated and non-uniform) input distributions that achieve the same sum-rate performance as full codebook knowledge. 4) In Section IV-E, for the G-IC-OR, we show in Coro... |

100 | Gamal, “On the Han-Kobayashi region for the interference channel
- Chong, Motani, et al.
- 2008
(Show Context)
Citation Context ... (Y2; X2|Q), (8b) R1 + R2 ≤ I (Y1; X1, U2|Q) + I (Y2; X2|U2, Q), (8c) is achievable for every input distribution that factorizes as PQ,X1,X2,U2 = PQ PX1|Q PX2|Q PU2|X2 Q , (8d) and where |Q| ≤ 8 from =-=[17]-=-. We denote the region in (8) as Rin, which is achievable for any memoryless IC-OR. Proof of Proposition 3: The proof follows by setting the auxiliary r.v. U1 in the Han and Kobayashi rate region in [... |

54 |
Bounds on the capacity region of a class of interference channels
- Telatar, Tse
- 2007
(Show Context)
Citation Context ...2 − g2(x2, t1)), (5) for some memoryless transition probabilities PT1|X1 and PT2|X2 , and some deterministic functions g1(·, ·) and g2(·, ·) that are injective when their first argument is held fixed =-=[15]-=-. The ISD property implies that H (Y1|X1) = H (T2) and H (Y2|X2) = H (T1) ∀PX1 X2 = PX1 PX2 , (6) or in other words that the Tu is a deterministic function of the pair (Yu, Xu), u ∈ [1 : 2]. For chann... |

45 | Communication via decentralized processing
- Sanderovich, Shamai, et al.
- 2008
(Show Context)
Citation Context ...th partial 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 oblivious terminals were first introduced in =-=[1]-=-. In [1] 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 ... |

12 |
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 =-=[5]-=- the authors considered the point-to-point power-constrained Gaussian noise channel and derived lower 0018-9448 © 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE p... |

10 | On codebook information for interference relay channels with out-of-band relaying,”
- Simeone, Erkip, et al.
- 2011
(Show Context)
Citation Context ...might surmise that both inputs would have discrete components. However, this generalization is highly non-trivial and significantly more mathematically challenging, and was left as an open problem in =-=[2]-=-. The major issue that arises when both users employ discrete inputs is the need to compute the cardinality and minimum distance of the sum of two discrete sets. These quantities are not only difficul... |

10 | Multidimensional constellations. i. introduction, figures of merit, and generalized cross constellations,” - Wei - 1989 |

6 | Relaying for multiple sources in the absence of codebook information,” in
- 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 [2] and =-=[3]-=- this concept of partial codebook knowledge was extended to model oblivious relays and capacity results were derived. However, as pointed out in [2, Sec. III.A] and [3, Remark 5], these capacity regio... |

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 |
constrained signaling to network interference alignment via an information-estimation perspective,’’ IEEE International Symposium for Information Theory Shannon Lecture
- Shamai, ‘‘From
- 2011
(Show Context)
Citation Context ...ced Pulse Amplitude Modulation (PAM) in which each each point is used with equal probability; such an input was shown to be optimal to within 0.41 bits per channel use [5, eq. (9)]. As pointed out in =-=[6]-=-, already in 1948 Claude Shannon in the unpublished work [7] argued the asymptotically optimality of a PAM input for the point-to-point power-constrained Gaussian noise channel. In [8, Th. 6 and 7], t... |

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.
(Show Context)
Citation Context ...e in general, but are also very sensitive to whether channel gains are rational or irrational (this is an open problem in additive combinatorics). For progress on this problem see our conference work =-=[21]-=-, [22]. We studied the performance of mixed inputs on the Gaussian IC. Its application to oblivious and asynchronous ICs somewhat surprisingly implies that much less “global coordination” between node... |

2 |
Soft-decodingbased strategies for relay and interference channels: analysis and achievable rates using LDPC codes
- Bennatan, Shamai
- 2013
(Show Context)
Citation Context ...rees of Freedom (DoF) gains over Gaussian inputs (note that a strict DoF gain implies an unbounded rate gain as SNR increases) which we seek in this work. In a way this work follows the philosophy of =-=[11]-=-: the main idea is to use sub-optimal pointto-point codes in which the reduction in achievable rates is more than compensated by the decrease in the interference created at the other users. The rest o... |

2 | On Gaussian interference channels with mixed Gaussian and discrete inputs
- Dytso, Devroye, et al.
(Show Context)
Citation Context ...eneral, but are also very sensitive to whether channel gains are rational or irrational (this is an open problem in additive combinatorics). For progress on this problem see our conference work [21], =-=[22]-=-. We studied the performance of mixed inputs on the Gaussian IC. Its application to oblivious and asynchronous ICs somewhat surprisingly implies that much less “global coordination” between nodes is n... |

1 |
Systems Which Approach the Ideal as
- Shanonn
(Show Context)
Citation Context ...t is used with equal probability; such an input was shown to be optimal to within 0.41 bits per channel use [5, eq. (9)]. As pointed out in [6], already in 1948 Claude Shannon in the unpublished work =-=[7]-=- argued the asymptotically optimality of a PAM input for the point-to-point power-constrained Gaussian noise channel. In [8, Th. 6 and 7], the authors asymptotically characterized the optimal input di... |