English
Related papers

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

200 papers

This paper investigates the sum-capacity of two-user optical intensity multiple access channels with per-user peak- or/and average-intensity constraints. By leveraging tools from the decomposition of certain maxentropic distributions, we…

Information Theory · Computer Science 2023-03-24 Longguang Li , Ru-Han Chen , Jing Zhou

New upper bounds on the sum capacity of the two-user Gaussian interference channel are derived. Using these bounds, it is shown that treating interference as noise achieves the sum capacity if the interference levels are below certain…

Information Theory · Computer Science 2008-01-04 V. Sreekanth Annapureddy , Venugopal V. Veeravalli

We consider the N-user broadcast erasure channel with public feedback and side information. Before the beginning of transmission, each receiver knows a function of the messages of some of the other receivers. This situation arises naturally…

Information Theory · Computer Science 2014-06-16 A. Papadopoulos , L. Georgiadis

We introduce the two user finite state compound Gaussian interference channel and characterize its capacity region to within one bit. The main contributions involve both novel inner and outer bounds. The inner bound is multilevel…

Information Theory · Computer Science 2008-05-01 Adnan Raja , Vinod M. Prabhakaran , Pramod Viswanath

In this paper, we investigate the sum-capacity of the two-user Gaussian interference channel with Gaussian superposition coding and successive decoding. We first examine an approximate deterministic formulation of the problem, and introduce…

Information Theory · Computer Science 2011-03-30 Yue Zhao , Chee Wei Tan , A. Salman Avestimehr , Suhas N. Diggavi , Gregory J. Pottie

We provide nonasymptotic upper and lower bounds on the sum-rate capacity of Rayleigh block-fading multiple-access channels for the setup where a priori channel state information is not available. The upper bound relies on a dual formula for…

Information Theory · Computer Science 2016-11-17 Rahul Devassy , Giuseppe Durisi , Johan Östman , Wei Yang , Tome Eftimov , Zoran Utkovski

A modification is proposed for the formula known from the literature that characterizes the boundary of the capacity region of Gaussian multiaccess fading channels. The modified version takes into account potentially negative arguments of…

Information Theory · Computer Science 2008-10-22 Mohamed Shaqfeh , Norbert Goertz

We consider transmission over the ergodic fading multi-antenna broadcast (MIMO-BC) channel with partial channel state information at the transmitter and full information at the receiver. Over the equivalent {\it non}-fading channel,…

Information Theory · Computer Science 2007-10-14 Amir Bennatan , David Burshtein

In this paper, we consider a two-user multiple access fading channel under quality-of-service (QoS) constraints. We initially formulate the transmission rates for both transmitters, where the transmitters have arbitrarily distributed input…

Information Theory · Computer Science 2016-08-08 Marwan Hammouda , Sami Akin , Jürgen Peissig

For two-user interference channels, the capacity is known for the case where interference is stronger than the desired signal. Moreover, it is known that if the interference is above a certain level, it does not reduce the capacity at all.…

Information Theory · Computer Science 2012-06-21 Frederic Knabe , Aydin Sezgin

We consider the problem of finding optimal, fair and distributed power-rate strategies to achieve the sum capacity of the Gaussian multiple-access block-fading channel. In here, the transmitters have access to only their own fading…

Information Theory · Computer Science 2012-08-24 Sibi Raj B. Pillai , Bikash K. Dey , Yash Deshpande , Krishnamoorthy Iyer

Previous work on the classical information capacities of bosonic channels has established the capacity of the single-user pure-loss channel, bounded the capacity of the single-user thermal-noise channel, and bounded the capacity region of…

Quantum Physics · Physics 2009-11-13 Saikat Guha , Jeffrey H. Shapiro , Baris I. Erkmen

We consider the use of the well-known dual capacity bounding technique for deriving upper bounds on the capacity of indecomposable finite-state channels (FSCs) with finite input and output alphabets. In this technique, capacity upper bounds…

Information Theory · Computer Science 2021-07-13 Bashar Huleihel , Oron Sabag , Haim H. Permuter , Navin Kashyap , Shlomo Shamai

An analytically tractable model for Gaussian multiuser channels with fading is studied, and the capacity region of this model is found to be a good approximation of the capacity region of the original Gaussian network. This work extends the…

Information Theory · Computer Science 2009-05-16 Rony EL Haddad , Brian Smith , Sriram Vishwanath

We study the best known general inner bound[MAR '79] and outer bound[N-EG'07] for the capacity region of the two user discrete memory less channel. We prove that a seemingly stronger outer bound is identical to a weaker form of the outer…

Information Theory · Computer Science 2008-04-25 Chandra Nair , Vincent Wang Zizhou

This paper derives a novel sum-rate outer bound for the general memoryless interference channel with three users. The derivation is a generalization of the techniques developed by Kramer and by Etkin et al for the Gaussian two-user channel.…

Information Theory · Computer Science 2011-02-04 Daniela Tuninetti

This paper investigates the capacity regions of two-receiver broadcast channels where each receiver (i) has both common and private-message requests, and (ii) knows part of the private message requested by the other receiver as side…

Information Theory · Computer Science 2016-11-18 Behzad Asadi , Lawrence Ong , Sarah J. Johnson

In this paper, capacity bounds for the two-user Interference Channel (IC) with cooperative receivers via conferencing links of finite capacities is investigated. The capacity results known for this communication scenario are limited to a…

Information Theory · Computer Science 2015-12-17 Reza K. Farsani , Amir K. Khandani

The two-user broadcast channel (BC) with receivers connected by bidirectional cooperation links of finite capacities, known as conferencing decoders, is considered. A novel capacity region outer bound is established based on multiple…

Information Theory · Computer Science 2025-08-12 Reza K. Farsani , Wei Yu

Two mobile users communicate with a central decoder via two base stations. Communication between the mobile users and the base stations takes place over a Gaussian interference channel with constant channel gains or quasi-static fading.…

Information Theory · Computer Science 2013-01-30 Roy Karasik , Osvaldo Simeone , Shlomo Shamai