English
Related papers

Related papers: Interference alignment-based sum capacity bounds f…

200 papers

In a K-user Gaussian interference channel, it has been shown that if for each user the desired signal strength is no less than the sum of the strengths of the strongest interference from this user and the strongest interference to this user…

Information Theory · Computer Science 2014-01-14 Chunhua Geng , Hua Sun , Syed A. Jafar

It has been shown recently by Geng et al. that in a $K$ user Gaussian interference network, if for each user the desired signal strength is no less than the sum of the strengths of the strongest interference from this user and the strongest…

Information Theory · Computer Science 2014-01-14 Hua Sun , Syed A. Jafar

In this paper, we first study a two-user interference channel with generalized feedback. We establish an inner bound on its capacity region. The coding scheme that we employ for the inner bound is based on an appropriate combination of…

Information Theory · Computer Science 2016-11-15 Abdellatif Zaidi

This paper investigates the fundamental performance limits of the two-user interference channel in the presence of an external eavesdropper. In this setting, we construct an inner bound, to the secrecy capacity region, based on the idea of…

Information Theory · Computer Science 2015-03-13 O. Ozan Koyluoglu , Hesham El Gamal

We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements from an underlying random process, code and transmit those…

Information Theory · Computer Science 2007-07-13 Nan Liu , Sennur Ulukus

We consider a Gaussian multiple access channel with $K$ transmitters, a (intended) receiver and an external eavesdropper. The transmitters wish to reliably communicate with the receiver while concealing their messages from the eavesdropper.…

Cryptography and Security · Computer Science 2015-04-23 Parisa Babaheidarian , Somayeh Salimi

We consider a cooperative Gaussian interference channel in which each receiver must decode its intended message locally, with the help of cooperation either at the receivers side or at the transmitter side. In the case of receiver…

Information Theory · Computer Science 2015-10-07 Vasilis Ntranos , Mohammad Ali Maddah-Ali , Giuseppe Caire

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

Interference is a major issue that limits the performance in wireless networks, and cooperation among receivers can help mitigate interference by forming distributed MIMO systems. The rate at which receivers cooperate, however, is limited…

Information Theory · Computer Science 2009-08-20 I-Hsiang Wang , David N. C. Tse

In this paper, we study the uplink of a cellular system using the linear deterministic approximation model, where there are two users transmitting to a receiver, mutually interfering with a third transmitter communicating with a second…

Information Theory · Computer Science 2011-04-04 J. Buehler , G. Wunder

This paper considers a variation of the classical two-user interference channel where the communication of two interfering source-destination pairs is aided by an additional node that has a priori knowledge of the messages to be…

Information Theory · Computer Science 2014-09-09 Alex Dytso , Stefano Rini , Natasha Devroye , Daniela Tuninetti

A two-user Gaussian Z-Interference Channel (GZIC) is considered, in which encoders are connected through noiseless links with finite capacities. In this setting, prior to each transmission block the encoders communicate with each other over…

Information Theory · Computer Science 2010-05-28 Hossein Bagheri , Abolfazl S. Motahari , Amir K. Khandani

Interference alignment is a transmission technique for exploiting all available degrees of freedom in the interference channel with an arbitrary number of users. Most prior work on interference alignment, however, neglects interference from…

Information Theory · Computer Science 2010-10-05 Steven W. Peters , Robert W. Heath

This paper proposes the first known universal interference alignment scheme for general $(1\times{}1)^K$ interference networks, either Gaussian or deterministic, with only 2 symbol extension. While interference alignment is theoretically…

Information Theory · Computer Science 2013-01-01 Haishi Ning , Maria~Estela , Cong Ling

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

Using Gaussian inputs and treating interference as noise at the receivers has recently been shown to be sum capacity achieving for the two-user single-input single-output (SISO) Gaussian interference channel in a low interference regime,…

Information Theory · Computer Science 2010-10-25 V. Sreekanth Annapureddy , Venugopal V. Veeravalli

This paper studies cache-aided interference networks with arbitrary number of transmitters and receivers, whereby each transmitter has a cache memory of finite size. Each transmitter fills its cache memory from a content library of files in…

Information Theory · Computer Science 2017-12-19 Antonious M. Girgis , Ozgur Ercetin , Mohammed Nafie , Tamer ElBatt

The Interference Channels (ICs) represent fundamental building blocks of wireless communication networks. Despite considerable progress in network information theory, available capacity results for ICs, specifically those with more than two…

Information Theory · Computer Science 2017-02-25 Reza K. Farsani , Amir K. Khandani

The symmetric K user interference channel with fully connected topology is considered, in which (a) each receiver suffers interference from all other (K-1) transmitters, and (b) each transmitter has causal and noiseless feedback from its…

Information Theory · Computer Science 2012-12-24 Soheil Mohajer , Ravi Tandon , H. Vincent Poor

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
‹ Prev 1 4 5 6 7 8 10 Next ›