English
Related papers

Related papers: Asymptotic Sum-Capacity of Random Gaussian Interfe…

200 papers

This paper develops a new communication strategy, ergodic interference alignment, for the K-user interference channel with time-varying fading. At any particular time, each receiver will see a superposition of the transmitted signals plus…

Information Theory · Computer Science 2012-06-19 Bobak Nazer , Michael Gastpar , Syed A. Jafar , Sriram Vishwanath

Time Interference Alignment is a flavor of Interference Alignment that increases the network capacity by suitably staggering the transmission delays of the senders. In this work the analysis of the existing literature is generalized and the…

Information Theory · Computer Science 2016-11-15 Francisco Lazaro Blasco , Francesco Rossetto , Gerhard Bauch

This paper studies the value of limited rate cooperation between the transmitters for managing interference and simultaneously ensuring secrecy, in the 2-user Gaussian symmetric interference channel (GSIC). First, the problem is studied in…

Information Theory · Computer Science 2016-06-14 Parthajit Mohapatra , Chandra R. Murthy

In this paper, we analyze the Gaussian X channel in the mixed interference regime. In this regime, multiple access transmission to one of the receivers is shown to be close to optimal in terms of sum rate. Three upper bounds are derived for…

Information Theory · Computer Science 2015-05-26 Praneeth Kumar , Srikrishna Bhashyam

The paper establishes the capacity region of the Gaussian interference channel with many transmitter-receiver pairs constrained to use point-to-point codes. The capacity region is shown to be strictly larger in general than the achievable…

Information Theory · Computer Science 2011-02-15 Francois Baccelli , Abbas El Gamal , David Tse

Consider a Gaussian relay network where a source node communicates to a destination node with the help of several layers of relays. Recent work has shown that compress-and-forward based strategies can achieve the capacity of this network…

Information Theory · Computer Science 2015-07-16 Ritesh Kolte , Ayfer Özgür , Abbas El Gamal

The capacity region of the $K$-user Gaussian interference channel (GIC) is a long-standing open problem and even capacity outer bounds are little known in general. A significant progress on degrees-of-freedom (DoF) analysis, a first-order…

Information Theory · Computer Science 2017-01-24 Junyoung Nam

The N+1 user, 1 x N single input multiple output (SIMO) Gaussian interference channel where each transmitter has a single antenna and each receiver has N antennas is studied. The symmetric capacity within O(1) is characterized for the…

Information Theory · Computer Science 2009-05-13 Tiangao Gou , Syed A. Jafar

In this paper the cognitive interference channel with a common message, a variation of the classical cognitive interference channel in which the cognitive message is decoded at both receivers, is studied. For this channel model new outer…

Information Theory · Computer Science 2012-08-21 Stefano Rini , Carolin Huppert

An information measure based on fractional partitions of a set is used to derive a general dependence balance inequality for communication. This inequality is used to obtain new upper bounds on reliable and secret rates for multiterminal…

Information Theory · Computer Science 2026-04-14 Amin Gohari , Gerhard Kramer

We investigate the $K$-user many-to-one interference channel with confidential messages in which the $K$th user experiences interference from all other $K-1$ users, and is at the same time treated as an eavesdropper to all the messages of…

Information Theory · Computer Science 2009-05-19 Xiang He , Aylin Yener

This paper addresses an interference channel consisting of $\mathbf{n}$ active users sharing $u$ frequency sub-bands. Users are asynchronous meaning there exists a mutual delay between their transmitted codes. A stationary model for…

Information Theory · Computer Science 2010-06-17 Kamyar Moshksar , Amir K. Khandani

Consider a Gaussian relay network where a number of sources communicate to a destination with the help of several layers of relays. Recent work has shown that a compress-and-forward based strategy at the relays can achieve the capacity of…

Information Theory · Computer Science 2013-04-30 Ritesh Kolte , Ayfer Özgür

The cognitive interference channel (C-IFC) consists of a classical two-user interference channel in which the message of one user (the "primary" user) is non-causally available at the transmitter of the other user (the "cognitive" user). We…

Information Theory · Computer Science 2016-11-18 Stefano Rini , Daniela Tuninetti , Natasha Devroye

We identify the role of equal strength interference links as bottlenecks on the ergodic sum capacity of a $K$ user phase-fading interference network, i.e., an interference network where the fading process is restricted primarily to…

Information Theory · Computer Science 2016-11-17 Syed A. Jafar

Recent results establish the optimality of interference alignment to approach the Shannon capacity of interference networks at high SNR. However, the extent to which interference can be aligned over a finite number of signalling dimensions…

Information Theory · Computer Science 2016-11-17 Krishna Gomadam , Viveck R. Cadambe , Syed A. Jafar

We consider a Gaussian multiple-access channel with random user activity where the total number of users $\ell_n$ and the average number of active users $k_n$ may be unbounded. For this channel, we characterize the maximum number of bits…

Information Theory · Computer Science 2020-07-14 Jithin Ravi , Tobias Koch

This paper investigates the capacity of a communications channel that, in addition to additive white Gaussian noise, also suffers from interference caused by a co-existing radar transmission. The radar interference (of short duty-cycle and…

Information Theory · Computer Science 2018-10-16 Sara Shahi , Daniela Tuninetti , Natasha Devroye

The two user Gaussian interference channel with a full-duplex relay is studied. By using genie aided approaches, two new upper bounds on the achievable sum-rate in this setup are derived. These upper bounds are shown to be tighter than…

Information Theory · Computer Science 2010-08-16 Anas Chaaban , Aydin Sezgin

We introduce the two user finite state compound Gaussian interference channel and characterize its capacity region to within one bit. The main contributions involve both novel inner and outer bounds. The inner bound is multilevel…

Information Theory · Computer Science 2008-05-01 Adnan Raja , Vinod M. Prabhakaran , Pramod Viswanath