English
Related papers

Related papers: On the Sum Rate of a 2 x 2 Interference Network

200 papers

A generalization of the Gaussian dirty-paper problem to a multiple access setup is considered. There are two additive interference signals, one known to each transmitter but none to the receiver. The rates achievable using Costa's…

Information Theory · Computer Science 2009-04-14 Tal Philosof , Ram Zamir , Uri Erez , Ashish Khisti

We consider a relay network with two relays and a feedback link from the receiver to the sender. To obtain the achievability result, we use compress-and-forward and random binning techniques combined with deterministic binning and…

Information Theory · Computer Science 2011-09-08 Mohammad Ali Tebbi , Mahtab Mirmohseni , Mahmoud Ahmadian Attari , Mohammad Reza Aref

This paper investigates the achievable sum rate of multiple-input multiple-output (MIMO) wireless systems employing linear minimum mean-squared error (MMSE) receivers. We present a new analytic framework which unveils an interesting…

Information Theory · Computer Science 2009-03-05 Matthew R. McKay , Iain B. Collings , Antonia M. Tulino

The capacity regions of multiple-input multiple-output Gaussian Z-interference channels are established for the very strong interference and aligned strong interference cases. The sum-rate capacity of such channels is established under…

Information Theory · Computer Science 2009-11-25 Xiaohu Shang , Biao Chen , Gerhard Kramer , H. Vincent Poor

Provable lower bounds are presented for the information rate I(X; X+S+N) where X is the symbol drawn from a fixed, finite-size alphabet, S a discrete-valued random variable (RV) and N a Gaussian RV. The information rate I(X; X+S+N) serves…

Information Theory · Computer Science 2011-10-04 Seongwook Jeong , Jaekyun Moon

We study the capacity regions of two-user interference channels where transmitters base their transmission schemes on local views of the channel state. Under the local view model, each transmitter knows only a subset of the four channel…

Information Theory · Computer Science 2012-07-31 David T. -H. Kao , Ashutosh Sabharwal

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

We consider arbitrary dense wireless networks, in which $n$ nodes are placed in an arbitrary (deterministic) manner on a square region of unit area and communicate with each other over Gaussian fading channels. We provide inner and outer…

Information Theory · Computer Science 2011-08-09 Urs Niesen

In this paper, we consider a two-cell interfering two-user multiple-input multiple-output multiple access channel (MIMO-MAC) with limited feedback. We first investigate the multiplexing gain of such channel when users have perfect channel…

Information Theory · Computer Science 2010-10-06 Namyoon Lee , Wonjae Shin , Bruno Clerckx

Much of the existing work on the broadcast channel focuses only on the sending of private messages. In this work we examine the scenario where the sender also wishes to transmit common messages to subsets of receivers. For an L user…

Information Theory · Computer Science 2016-09-08 Leonard Grokop , David N. C. Tse

We consider single-antenna interference networks where M sources, each with an average transmit power of P/M, communicate with M destinations over frequency-selective channels (with L taps each) and each destination has perfect knowledge of…

Information Theory · Computer Science 2009-05-06 Jatin Thukral , Helmut Boelcskei

We consider a dense $K$ user Gaussian interference network formed by paired transmitters and receivers placed independently at random in a fixed spatial region. Under natural conditions on the node position distributions and signal…

Information Theory · Computer Science 2011-09-12 Oliver Johnson , Matthew Aldridge , Robert Piechocki

We characterize the symmetric capacity to within 1.7075 bits/s/Hz for the two-user Gaussian interference channel with feedback. The result makes use of a deterministic model to provide insights into the Gaussian channel. We derive a new…

Information Theory · Computer Science 2009-01-26 Changho Suh , David Tse

In this paper, we use the linear deterministic approximation model to study a two user multiple access channel mutually interfering with a point to point link, which represents a basic setup of a cellular system. We derive outer bounds on…

Information Theory · Computer Science 2011-05-12 Jörg Bühler , Gerhard Wunder

A novel class of achievable rate regions is obtained for the K-receiver broadcast channel with two groupcast messages. The associated achievability schemes are parameterized by an expansion of the message set which then determines how…

Information Theory · Computer Science 2020-01-28 Mohamed Salman , Mahesh K. Varanasi

Presence of multiple antennas on both sides of a communication channel promises significant improvements in system throughput and power efficiency. In effect, a new class of large multiple-input multiple-output (MIMO) communication systems…

Information Theory · Computer Science 2014-01-28 Maksym A. Girnyk , Mikko Vehkaperä , Lars K. Rasmussen

Characterizing the global maximum of weighted sum-rate (WSR) for the K-user Gaussian interference channel (GIC), with the interference treated as Gaussian noise, is a key problem in wireless communication. However, due to the users' mutual…

Information Theory · Computer Science 2016-11-17 Liang Liu , Rui Zhang , Kee-Chaing Chua

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

We consider a two-way relay network, where two source nodes, S1 and S2, exchange information through a cluster of relay nodes. The relay nodes receive the sum signal from S1 and S2 in the first time slot. In the second time slot, each relay…

Information Theory · Computer Science 2010-05-12 Meng Zeng , Rui Zhang , Shuguang Cui

We consider a two-way relay network, where two source nodes, S1 and S2, exchange information through a cluster of relay nodes. The relay nodes receive the sum signal from S1 and S2 in the first time slot. In the second time slot, each relay…

Information Theory · Computer Science 2015-05-20 Meng Zeng , Rui Zhang , Shuguang Cui
‹ Prev 1 3 4 5 6 7 10 Next ›