English
Related papers

Related papers: On the Capacity of One-sided Two user Gaussian Fad…

200 papers

In this paper the cognitive interference channel with a common message, a variation of the classical cognitive interference channel in which the cognitive message is decoded at both receivers, is studied. For this channel model new outer…

Information Theory · Computer Science 2012-08-21 Stefano Rini , Carolin Huppert

Wyner's wiretap channel is extended to parallel broadcast channels and fading channels with multiple receivers. In the first part of the paper, we consider the setup of parallel broadcast channels with one sender, multiple intended…

Information Theory · Computer Science 2007-07-13 Ashish Khisti , Aslan Tchamkerten , Gregory Wornell

We derive bounds on the noncoherent capacity of wide-sense stationary uncorrelated scattering (WSSUS) channels that are selective both in time and frequency, and are underspread, i.e., the product of the channel's delay spread and Doppler…

Information Theory · Computer Science 2016-11-15 Giuseppe Durisi , Ulrich G. Schuster , Helmut Bölcskei , Shlomo Shamai

This paper studies a family of genie-MAC (multiple access channel) outer bounds for K-user Gaussian interference channels. This family is inspired by existing genie-aided bounding mechanisms, but differs from current approaches in its…

Information Theory · Computer Science 2015-03-14 Jubin Jose , Sriram Vishwanath

The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. The channel state is unknown at the transmitter, but observations of…

Information Theory · Computer Science 2015-06-25 Michael Heindlmaier , Shirin Saeedi Bidokhti

This paper provides an explicit expression for the capacity region of the two-user broadcast Z channel and proves that the optimal boundary can be achieved by independent encoding of each user. Specifically, the information messages…

Information Theory · Computer Science 2008-10-20 Bike Xie , Miguel Griot , Andres I. Vila Casado , Richard D. Wesel

We analyze the quantum capacity of a unital quantum channel, using ideas from the proof of near-optimality of Petz recovery map [Barnum and Knill 2000] and give an upper bound on the quantum capacity in terms of regularized output $2$-norm…

Quantum Physics · Physics 2018-03-07 Anurag Anshu

As a basic information-theoretic model for fading relay channels, the parallel relay channel is first studied, for which lower and upper bounds on the capacity are derived. For the parallel relay channel with degraded subchannels, the…

Information Theory · Computer Science 2007-07-13 Yingbin Liang , Venugopal V. Veeravalli , H. Vincent Poor

Inner and outer bounds are established on the capacity region of two-sender, two-receiver interference channels where one transmitter knows both messages. The transmitter with extra knowledge is referred to as being cognitive. The inner…

Information Theory · Computer Science 2007-10-22 I. Maric , A. Goldsmith , G. Kramer , S. Shamai

We study the two-user broadcast channel with degraded message sets and derive second-order achievability rate regions. Specifically, the channel noises are not necessarily Gaussian and we use spherical codebooks for both users. The weak…

Information Theory · Computer Science 2024-10-24 Zhuangfei Wu , Lin Bai , Jinpeng Xu , Lin Zhou , Mehul Motani

The capacity of a fixed Gaussian multiple-input multiple-output (MIMO) channel and the optimal transmission strategy under the total power (TP) constraint and full channel state information are well-known. This problem remains open in the…

Information Theory · Computer Science 2016-12-15 S. Loyka

In this paper, we obtain a family of lower bounds for the sum capacity of Code Division Multiple Access (CDMA) channels assuming binary inputs and binary signature codes in the presence of additive noise with an arbitrary distribution. The…

Information Theory · Computer Science 2016-11-18 K. Alishahi , F. Marvasti , V. Aref , P. Pad

One of the key open problems in network information theory is to obtain the capacity region for the two-user Interference Channel (IC). In this paper, new results are derived for this channel. As a first result, a noisy interference regime…

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

We consider a two-user state-dependent multiaccess channel in which only one of the encoders is informed, non-causally, of the channel states. Two independent messages are transmitted: a common message transmitted by both the informed and…

Information Theory · Computer Science 2016-11-18 Abdellatif Zaidi , Shiva Prasad Kotagiri , J. Nicholas Laneman , Luc Vandendorpe

It is well known that, in general, feedback may enlarge the capacity region of Gaussian broadcast channels. This has been demonstrated even when the feedback is noisy (or partial-but-perfect) and only from one of the receivers. The only…

Information Theory · Computer Science 2015-02-18 Sibi Raj B. Pillai , Vinod M. Prabhakaran

Entropy comparison inequalities are obtained for the differential entropy $h(X+Y)$ of the sum of two independent random vectors $X,Y$, when one is replaced by a Gaussian. For identically distributed random vectors $X,Y$, these are closely…

Information Theory · Computer Science 2024-07-24 Lampros Gavalakis , Ioannis Kontoyiannis , Mokshay Madiman

An outer bound to the capacity region of the two-receiver discrete memoryless broadcast channel is given. The outer bound is tight for all cases where the capacity region is known. When specialized to the case of no common information, this…

Information Theory · Computer Science 2007-07-13 Chandra Nair , Abbas El Gamal

The performance of integer-forcing equalization for communication over the compound multiple-input multipleoutput channel is investigated. An upper bound on the resulting outage probability as a function of the gap to capacity has been…

Information Theory · Computer Science 2017-12-05 Elad Domanovitz , Uri Erez

Motivated by results in optical communications, where the performance can degrade dramatically if the transmit power is sufficiently increased, the channel capacity is characterized for various kinds of memoryless vector channels. It is…

Information Theory · Computer Science 2015-03-20 Erik Agrell

In this part, we consider the capacity analysis for wireless mobile systems with multiple antenna architectures. We apply the results of the first part to a commonly known baseband, discrete-time multiple antenna system where both the…

Information Theory · Computer Science 2007-07-13 Majid Fozunbal , Steven W. McLaughlin , Ronald W. Schafer