English
Related papers

Related papers: Binary Fading Interference Channel with No CSIT

200 papers

The best outer bound on the capacity region of the two-user Gaussian Interference Channel (GIC) is known to be the intersection of regions of various bounds including genie-aided outer bounds, in which a genie provides noisy input signals…

Information Theory · Computer Science 2017-04-20 Junyoung Nam

We study the best known general inner bound[MAR '79] and outer bound[N-EG'07] for the capacity region of the two user discrete memory less channel. We prove that a seemingly stronger outer bound is identical to a weaker form of the outer…

Information Theory · Computer Science 2008-04-25 Chandra Nair , Vincent Wang Zizhou

The cognitive interference channel models cognitive overlay radio systems, where cognitive radios overhear the transmission of neighboring nodes. Capacity for this channel is not known in general. For the Gaussian case capacity is known in…

Information Theory · Computer Science 2012-04-11 Stefano Rini , Ernest Kurniawan , Andrea Goldsmith

We develop several lower bounds on the capacity of binary input symmetric output channels with synchronization errors which also suffer from other types of impairments such as substitutions, erasures, additive white Gaussian noise (AWGN)…

Information Theory · Computer Science 2012-03-30 Mojtaba Rahmati , Tolga M. Duman

The InterFerence Channel with a Cognitive Relay (IFC-CR) consists of the classical interference channel with two independent source-destination pairs whose communication is aided by an additional node, referred to as the cognitive relay,…

Information Theory · Computer Science 2011-07-25 Stefano Rini , Daniela Tuninetti , Natasha Devroye , Andrea Goldsmith

Establishing the capacity region of a Gaussian interference network is an open problem in information theory. Recent progress on this problem has led to the characterization of the capacity region of a general two user Gaussian interference…

Information Theory · Computer Science 2009-02-15 V. Sreekanth Annapureddy , Venugopal V. Veeravalli

The upper bound on the capacity of a 3-node discrete memoryless relay channel is considered, where a source X wants to send information to destination Y with the help of a relay Z. Y and Z are independent given X, and the link from Z to Y…

Information Theory · Computer Science 2012-10-26 Feng Xue

In this paper, a class of broadcast interference channels (BIC) is investigated, where one of the two broadcast receivers is subject to interference coming from a point-to-point transmission. For a general discrete memoryless broadcast…

Information Theory · Computer Science 2015-08-04 Yuanpeng Liu , Elza Erkip

We study parallel symmetric 2-user interference channels when the interference is bursty and feedback is available from the respective receivers. Presence of interference in each subcarrier is modeled as a memoryless Bernoulli random state.…

Information Theory · Computer Science 2014-04-25 Shaunak Mishra , I-Hsiang Wang , Suhas Diggavi

The capacity region of the one-sided Gaussian interference channel is established in the weak interference regime. To characterize this region, a new representation of the Han-Kobayashi inner bound for the one-sided Gaussian interference…

Information Theory · Computer Science 2015-09-21 Mojtaba Vaezi , H. Vincent Poor

We consider the 3-user Gaussian interference channel and provide an outer bound on its capacity region. Under some conditions, which we call the mixed strong-very strong interference conditions, this outer bound is achievable. These…

Information Theory · Computer Science 2010-10-26 Anas Chaaban , Aydin Sezgin

The sum-capacity for specific sub-classes of ergodic fading Gaussian two-user interference channels (IFCs) is developed under the assumption of perfect channel state information at all transmitters and receivers. For the sub-classes of…

Information Theory · Computer Science 2016-11-17 Lalitha Sankar , Xiaohu Shang , Elza Erkip , H. Vincent Poor

In this paper, we derive information-theoretic performance limits for three classes of two-user state-dependent discrete memoryless broadcast channels, with noncausal side-information at the encoder. The first class of channels comprises a…

Information Theory · Computer Science 2012-07-17 K. G. Nagananda , Chandra R. Murthy , Shalinee Kishore

This paper is motivated by a sensor network on a correlated field where nearby sensors share information, and can thus assist rather than interfere with one another. A special class of two-user Gaussian interference channels (IFCs) is…

Information Theory · Computer Science 2007-07-13 Wei Wu , Sriram Vishwanath , Ari Arapostathis

We consider symmetric two-user Gaussian interference channel with common messages. We derive an upper bound on the sum capacity, and show that the upper bound is tight in the low interference regime, where the optimal transmission scheme is…

Information Theory · Computer Science 2014-01-22 Quan Geng , Tie Liu

This paper studies the capacity region of a $K$-user cyclic Gaussian interference channel, where the $k$th user interferes with only the $(k-1)$th user (mod $K$) in the network. Inspired by the work of Etkin, Tse and Wang, which derived a…

Information Theory · Computer Science 2012-05-22 Lei Zhou , Wei Yu

In this paper, we derive outer bounds on the capacity region of two classes of the general two-user discrete memoryless broadcast channels with side-information at the transmitter. The first class comprises the classical broadcast channel…

Information Theory · Computer Science 2011-10-11 K. G. Nagananda , Chandra R Murthy , Shalinee Kishore

We study the effects of introducing a feedback channel in the two-receiver erasure source-broadcast problem in which a binary equiprobable source is to be sent over an erasure broadcast channel to two receivers subject to erasure distortion…

Information Theory · Computer Science 2021-05-04 Louis Tan , Kaveh Mahdaviani , Ashish Khisti

This paper studies the capacity region of a $K$-user cyclic Gaussian interference channel, where the $k$th user interferes with only the $(k-1)$th user (mod $K$) in the network. Inspired by the work of Etkin, Tse and Wang, who derived a…

Information Theory · Computer Science 2012-09-03 Lei Zhou , Wei Yu

This paper is motivated by a sensor network on a correlated field where nearby sensors share information, and can thus assist rather than interfere with one another. We consider a special class of two-user Gaussian interference channels…

Information Theory · Computer Science 2007-07-13 Wei Wu , Sriram Vishwanath , Ari Arapostathis