English
Related papers

Related papers: The Ergodic Capacity of Phase-Fading Interference …

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

A spectrum-sharing communication system where the secondary user is aware of the instantaneous channel state information (CSI) of the secondary link, but knows only the statistics and an estimated version of the secondary…

Information Theory · Computer Science 2015-03-20 Zouheir Rezk , Mohamed-Slim Alouini

Sufficient conditions required to achieve the interference-free capacity region of ergodic fading K-user interference channels (IFCs) are obtained. In particular, this capacity region is shown to be achieved when every receiver decodes all…

Information Theory · Computer Science 2009-10-27 Lalitha Sankar , Jan Vondrak , H. Vincent Poor

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

We consider a fading AWGN 2-user 2-hop network where the channel coefficients are independent and identically distributed (i.i.d.) drawn from a continuous distribution and vary over time. For a broad class of channel distributions, we…

Information Theory · Computer Science 2016-11-15 Sang-Woon Jeon , Chien-Yi Wang , Michael Gastpar

We consider a spectrum sharing communication scenario in which a primary and a secondary users are communicating, simultaneously, with their respective destinations using the same frequency carrier. Both optimal power profile and ergodic…

Information Theory · Computer Science 2016-11-15 Lokman Sboui , Zouheir Rezki , Mohamed-Slim Alouini

Fundamental capacity limits are studied for the two-user wireless ergodic fading IC with partial Channel State Information at the Transmitters (CSIT) where each transmitter is equipped with an arbitrary deterministic function of the channel…

Information Theory · Computer Science 2013-02-15 Reza K. Farsani

The sum capacity of a class of layered erasure one-sided interference channels is developed under the assumption of no channel state information at the transmitters. Outer bounds are presented for this model and are shown to be tight for…

Information Theory · Computer Science 2009-08-18 Vaneet Aggarwal , Lalitha Sankar , A. Robert Calderbank , H. Vincent Poor

Ergodic capacity is an important performance measure associated with reliable communication at the highest rate at which information can be sent over the channel with a negligible probability of error. In the shadow of this definition,…

Information Theory · Computer Science 2012-07-10 Ferkan Yilmaz , Mohamed-Slim Alouini

For delay-limited communication over block-fading channels, the difference between the ergodic capacity and the maximum achievable expected rate for coding over a finite number of coherent blocks represents a fundamental measure of the…

Information Theory · Computer Science 2013-01-25 Jae Won Yoo , Tie Liu , Shlomo Shamai , Chao Tian

A cognitive radio network (CRN) is formed by either allowing the secondary users (SUs) in a secondary communication network (SCN) to opportunistically operate in the frequency bands originally allocated to a primary communication network…

Information Theory · Computer Science 2016-11-17 Xin Kang , Ying-Chang Liang , Arumugam Nallanathan , Hari Krishna Garg , Rui Zhang

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

A well-known lower bound widely used in the massive MIMO literature hinges on channel hardening, i.e., the phenomenon for which, thanks to the large number of antennas, the effective channel coefficients resulting from beamforming tend to…

Information Theory · Computer Science 2017-10-27 Giuseppe Caire

This paper studies the information-theoretic limits of a secondary or cognitive radio (CR) network under spectrum sharing with an existing primary radio network. In particular, the fading cognitive multiple-access channel (C-MAC) is first…

Information Theory · Computer Science 2016-11-18 Rui Zhang , Shuguang Cui , Ying-Chang Liang

The ergodic capacity of underlay cognitive (secondary) dual-hop relaying systems is analytically investigated. Specifically, the amplify-and-forward transmission protocol is considered, while the received signals undergo multipath fading…

Information Theory · Computer Science 2015-09-01 Nikolaos I. Miridakis

We consider a dense n-user Gaussian interference network formed by paired transmitters and receivers placed independently at random in Euclidean space. Under natural conditions on the node position distributions and signal attenuation, we…

Information Theory · Computer Science 2010-10-21 Matthew Aldridge , Oliver Johnson , Robert Piechocki

Most work on wireless network throughput ignores the temporal correlation inherent to wireless channels because it degrades tractability. To better model and quantify the temporal variations of wireless network throughput, this paper…

Information Theory · Computer Science 2011-04-01 Chun-Hung Liu , Jeffrey G. Andrews

The problem of resource allocation is studied for two-sender two-receiver fading Gaussian interference channels (IFCs) and compound multiaccess channels (C-MACs). The senders in an IFC communicate with their own receiver (unicast) while…

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

In wireless networks, communication links may be subject to random fatal impacts: for example, sensor networks under sudden power losses or cognitive radio networks with unpredictable primary user spectrum occupancy. Under such…

Information Theory · Computer Science 2016-11-15 Meng Zeng , Rui Zhang , Shuguang Cui

This work studies the capacity region of a two-user ergodic interference channel with fading, where only one of the users is subject to interference from the other user, and the channel state information (CSI) is only available at the…

Information Theory · Computer Science 2009-11-06 Yan Zhu , Dongning Guo
‹ Prev 1 2 3 10 Next ›