English
Related papers

Related papers: A New Achievable Scheme for Interference Relay Cha…

200 papers

We prove that the ensemble the nested coset codes built on finite fields achieves the capacity of arbitrary discrete memoryless point-to-point channels. Exploiting it's algebraic structure, we develop a coding technique for communication…

Information Theory · Computer Science 2022-03-02 Arun Padakandla , Sandeep Pradhan

A simple encoding scheme based on Sato's non-na\"ive frequency division is proposed for a class of Gaussian interference channels with mixed interference. The achievable region is shown to be equivalent to that of Costa's noiseberg region…

Information Theory · Computer Science 2012-07-16 Yu Zhao , Fangfang Zhu , Biao Chen

This paper studies the capacity of a class of discrete memoryless interference channels where interference is defined analogous to that of Gaussian interference channel with one-sided weak interference. The sum-rate capacity of this class…

Information Theory · Computer Science 2013-03-11 Fangfang Zhu , Biao Chen

The capacity region of the interference channel in which one transmitter non-causally knows the message of the other, termed the cognitive interference channel, has remained open since its inception in 2005. A number of subtly differing…

Information Theory · Computer Science 2015-03-13 Stefano Rini , Daniela Tuninetti , Natasha Devroye

Considering a general input distribution, using Gel'fand-Pinsker full binning scheme and the Han- Kobayashi (HK) jointly decoding strategy, we obtain a new achievable rate region for the cognitive radio channel (CRC) and then derive a…

Information Theory · Computer Science 2010-08-26 Ghosheh Abed Hodtani

A new achievability scheme for the compound channel with discrete memoryless (DM) state noncausally available at the encoder is established. Achievability is proved using superposition coding, Marton coding, joint typicality encoding, and…

Information Theory · Computer Science 2010-04-26 Chandra Nair , Abbas El Gamal , Yeow-Khiang Chia

The discrete memoryless interference channel is modelled as a conditional probability distribution with two outputs depending on two inputs and has widespread applications in practical communication scenarios. In this paper, we introduce…

Quantum Physics · Physics 2015-03-19 Ivan Savov , Omar Fawzi , Mark M. Wilde , Pranab Sen , Patrick Hayden

This paper investigates the achievability of the interference channel coding. It is clarified that the rate-splitting technique is unnecessary to achieve Han-Kobayashi and Jian-Xin-Garg inner regions. Codes are constructed by using sparse…

Information Theory · Computer Science 2022-08-26 Jun Muramatsu

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

Achievable rate regions for cooperative relay broadcast channels with rate-limited feedback are proposed. Specifically, we consider two-receiver memoryless broadcast channels where each receiver sends feedback signals to the transmitter…

Information Theory · Computer Science 2016-05-09 Youlong Wu

We consider the two-user interference channel with rate-limited feedback. Related prior works focus on the case where feedback links have infinite capacity, while no research has been done for the rate-limited feedback problem. Several new…

Information Theory · Computer Science 2012-05-08 Alireza Vahid , Changho Suh , Amir Salman Avestimehr

The capacity region of the two-user Gaussian Interference Channel (IC) is studied. Three classes of channels are considered: weak, one-sided, and mixed Gaussian IC. For the weak Gaussian IC, a new outer bound on the capacity region is…

Information Theory · Computer Science 2008-01-09 Abolfazl S. Motahari , Amir K. Khandani

In this work, we derive achievable rate regions for the three-user interference channels with asymmetric transmitter cooperation and various decoding capabilities at the receivers. The three-user channel facilitates different ways of…

Information Theory · Computer Science 2011-02-23 K. G. Nagananda , Chandra R. Murthy

A new single-letter achievable rate region is proposed for the two-user discrete memoryless multiple-access channel(MAC) with noiseless feedback. The proposed region includes the Cover-Leung rate region [1], and it is shown that the…

Information Theory · Computer Science 2014-03-31 Ramji Venkataramanan , S. Sandeep Pradhan

Coding for the causal cognitive radio channel, with the cognitive source subjected to a half-duplex constraint, is studied. A discrete memoryless channel model incorporating the half-duplex constraint is presented, and a new achievable rate…

Information Theory · Computer Science 2010-06-07 Debdeep Chatterjee , Tan F. Wong , Ozgur Oyman

We study the capacity of discrete memoryless many-to-one interference channels, i.e., K user interference channels where only one receiver faces interference. For a class of many-to-one interference channels, we identify a noisy…

Information Theory · Computer Science 2009-12-17 Viveck R. Cadambe , Syed A. Jafar

A single-letter achievable rate region is proposed for the two-receiver discrete memoryless broadcast channel with generalized feedback. The coding strategy involves block-Markov superposition coding, using Marton's coding scheme for the…

Information Theory · Computer Science 2014-02-10 Ramji Venkataramanan , S. Sandeep Pradhan

An achievable rate region, based on lattice interference alignment, is derived for a class of time-invariant Gaussian interference channels with more than two users. The result is established via a new coding theorem for the two-user…

Information Theory · Computer Science 2011-06-21 Or Ordentlich , Uri Erez

The sum capacity of a class of discrete memoryless interference channels is determined. This class of channels is defined analogous to the Gaussian Z-interference channel with weak interference; as a result, the sum capacity is achieved by…

Information Theory · Computer Science 2012-07-16 Fangfang Zhu , Biao Chen

A two-user symmetric Gaussian Interference Channel (IC) is considered in which a noiseless unidirectional link connects one encoder to the other. Having a constant capacity, the additional link provides partial cooperation between the…

Information Theory · Computer Science 2009-09-16 Hossein Bagheri , Abolfazl S. Motahari , Amir K. Khandani