English
Related papers

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

200 papers

The two user Gaussian interference channel with a full-duplex relay is studied. By using genie aided approaches, two new upper bounds on the achievable sum-rate in this setup are derived. These upper bounds are shown to be tighter than…

Information Theory · Computer Science 2010-08-16 Anas Chaaban , Aydin Sezgin

Determining the ultimate classical information carrying capacity of electromagnetic waves requires quantum-mechanical analysis to properly account for the bosonic nature of these waves. Recent work has established capacity theorems for…

Quantum Physics · Physics 2008-02-10 Saikat Guha , Jeffrey H. Shapiro , Baris I. Erkmen

We firstly extend the interpretation of feedback communication over stationary finite dimensional Gaussian channels as feedback control systems by showing that, the problem of finding stabilizing feedback controllers with maximal reliable…

Information Theory · Computer Science 2015-12-01 Chong Li , Nicola Elia

This paper establishes the capacity region of a class of broadcast channels with random state in which each channel component is selected from two possible functions and each receiver knows its state sequence. This channel model does not…

Information Theory · Computer Science 2014-01-28 Hyeji Kim , Abbas El Gamal

In the spectrum-sharing technology, a secondary user may utilize the primary user's licensed band as long as its interference to the primary user is below a tolerable value. In this paper, we consider a scenario in which a secondary user is…

Information Theory · Computer Science 2010-10-01 Junwei Zhang , Mustafa Cenk Gursoy

We investigate the problem of message transmission and the problem of common randomness (CR) generation over single-user multiple-input multiple-output (MIMO) slow fading channels with average input power constraint, additive white Gaussian…

Information Theory · Computer Science 2022-10-24 Rami Ezzine , Moritz Wiese , Christian Deppe , Holger Boche

In this paper we deal with a single-antenna discrete-time flat-fading channel. The fading process is assumed to be stationary for the duration of a single data block. From block to block the fading process is allowed to be non-stationary.…

Information Theory · Computer Science 2007-07-13 Thomas Zemen , Stefan M. Moser

We characterize the capacity of the general class of noncoherent underspread wide-sense stationary uncorrelated scattering (WSSUS) time-frequency-selective Rayleigh fading channels, under peak constraints in time and frequency and in time…

Information Theory · Computer Science 2016-11-17 Giuseppe Durisi , Helmut Bölcskei , Shlomo Shamai

This work considers the corner points of the capacity region of a two-user Gaussian interference channel (GIC). In a two-user GIC, the rate pairs where one user transmits its data at the single-user capacity (without interference), and the…

Information Theory · Computer Science 2015-04-09 Igal Sason

In this paper, we analyze the capacity of multiple-input multiple-output (MIMO) Rayleigh-fading channels in the presence of spatial fading correlation at both the transmitter and the receiver, assuming that the channel is unknown at the…

Information Theory · Computer Science 2016-11-18 Hyundong Shin , Moe Z. Win , Jae Hong Lee , Marco Chiani

The paper investigates the problem of maximizing expected sum throughput in a fading multiple access cognitive radio network when secondary user (SU) transmitters have energy harvesting capability, and perform cooperative spectrum sensing.…

Information Theory · Computer Science 2016-02-23 Sinchan Biswas , Amirpasha Shirazinia , Subhrakanti Dey

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages to two receivers, while a wire-tapper also receives the transmitted signal. This model is motivated by wireless communications, where…

Information Theory · Computer Science 2009-10-20 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

We consider a Gaussian multiple-access channel with random user activity where the total number of users $\ell_n$ and the average number of active users $k_n$ may be unbounded. For this channel, we characterize the maximum number of bits…

Information Theory · Computer Science 2020-07-14 Jithin Ravi , Tobias Koch

Recently, Etkin, Tse, and Wang found the capacity region of the two-user Gaussian interference channel to within one bit/s/Hz. A natural goal is to apply this approach to the Gaussian interference channel with an arbitrary number of users.…

Information Theory · Computer Science 2016-11-17 Guy Bresler , Abhay Parekh , David Tse

The memoryless noncoherent single-input single-output (SISO) Rayleigh-fading channel is considered. Closed-form expressions for the mutual information between the output and the input of this channel when the input magnitude distribution is…

Information Theory · Computer Science 2007-07-16 Sebastien de la Kethulle de Ryhove , Ninoslav Marina , Geir E. Oien

In this paper, we analyze the Gaussian X channel in the mixed interference regime. In this regime, multiple access transmission to one of the receivers is shown to be close to optimal in terms of sum rate. Three upper bounds are derived for…

Information Theory · Computer Science 2015-05-26 Praneeth Kumar , Srikrishna Bhashyam

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

This paper studies a layered erasure model for two-user interference channels, which can be viewed as a simplified version of Gaussian fading interference channel. It is assumed that channel state information~(CSI) is only available at…

Information Theory · Computer Science 2016-01-26 Yan Zhu

This paper considers a binary channel with deletions. We derive two close form upper bound on the capacity of binary deletion channel. The first upper bound is based on computing the capacity of an auxiliary channel and we show how the…

Information Theory · Computer Science 2021-03-23 Hassan Tavakoli

We derive new upper and lower bounds on the fading number of multiple-input single-output (MISO) fading channels of general (not necessarily Gaussian) regular law with spatial and temporal memory. The fading number is the second term, after…

Information Theory · Computer Science 2007-07-16 Stefan M. Moser