English
Related papers

Related papers: Distribution Decomposition and Sum-Capacity Result…

200 papers

This paper derives upper and lower bounds on the capacity of the multiple-input single-output free-space optical intensity channel with signal-independent additive Gaussian noise subject to both an average-intensity and a peak-intensity…

Information Theory · Computer Science 2017-10-26 Stefan M. Moser , Ligong Wang , Michèle Wigger

This paper studies the capacity of a general multiple-input multiple-output (MIMO) free-space optical intensity channel under a per-input-antenna peak-power constraint and a total average-power constraint over all input antennas. The focus…

Information Theory · Computer Science 2020-02-04 Longguang Li , Stefan M. Moser , Ligong Wang , Michèle Wigger

This paper investigates the capacity region of the optical intensity broadcast channels (OI-BCs), where the input is subject to a peak-intensity constraint, an average-intensity constraint, or both. By leveraging the decomposition results…

Information Theory · Computer Science 2023-03-02 Sufang Yang , Longguang Li , Jintao Wang

This paper, mostly tutorial in nature, deals with the problem of characterizing the capacity of fading channels in the high signal-to-noise ratio (SNR) regime. We focus on the practically relevant noncoherent setting, where neither…

Information Theory · Computer Science 2011-05-09 Giuseppe Durisi , Helmut Bölcskei

In this paper, we use the linear deterministic approximation model to study a two user multiple access channel mutually interfering with a point to point link, which represents a basic setup of a cellular system. We derive outer bounds on…

Information Theory · Computer Science 2011-05-12 Jörg Bühler , Gerhard Wunder

We address the problem of increasing the sum rate in a multiple-access system from [1] for small number of users. We suggest an improved signal-code construction in which in case of a small number of users we give more resources to them.…

Information Theory · Computer Science 2016-11-17 Alexey Frolov , Victor Zyablov , Vladimir Sidorenko , Robert Fischer

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 network where three users want to establish multiple unicasts between each other via a relay is considered. This network is called the Y-channel and resembles an elemental ingredient of future wireless networks. The sum-capacity of this…

Information Theory · Computer Science 2016-11-17 Anas Chaaban , Aydin Sezgin , A. Salman Avestimehr

We study the interaction between two interfering Gaussian 2-user multiple access channels. The capacity region is characterized under mixed strong--extremely strong interference and individually very strong interference. Furthermore, the…

Information Theory · Computer Science 2011-03-15 Anas Chaaban , Aydin Sezgin , Bernd Bandemer , Arogyaswami Paulraj

We analyze the sensitivity of the capacity of a multi-antenna multi-user system to the number of users being served. We show analytically that, for a given desired sum-rate, the extra power needed to serve a subset of the users at low SNR…

Information Theory · Computer Science 2008-06-23 Chau Yuen , Bertrand M. Hochwald

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

In this paper, we investigate upper and lower bounds on the capacity of two-user fading broadcast channels where one of the users has a constant (non-fading) channel. We use the Costa entropy power inequality (EPI) along with an…

Information Theory · Computer Science 2009-01-01 Amin Jafarian , Sriram Vishwanath

The capacity of a discrete-time channel with correlated phase noises is investigated. In particular, the electro-optic frequency comb system is considered, where the phase noise of each subchannel is a combination of two independent Wiener…

Information Theory · Computer Science 2025-07-15 Mohammad Farsi , Hamdi Joudeh , Gabriele Liga , Alex Alvarado , Magnus Karlsson , Erik Agrell

We study the input-entropy-constrained Gaussian channel capacity problem in the asymptotic high signal-to-noise ratio (SNR) regime. We show that the capacity-achieving distribution as SNR goes to infinity is given by a discrete Gaussian…

Information Theory · Computer Science 2026-01-16 Adway Girish , Shlomo Shamai , Emre Telatar

A network where three users communicate with each other via a relay is considered. Users do not receive other users' signals via a direct link, and thus the relay is essential for their communication. Each user is assumed to have an…

Information Theory · Computer Science 2011-02-15 Anas Chaaban , Aydin Sezgin , Salman Avestimehr

In this paper, we investigate the capacity of a multiple-input multiple-output (MIMO) optical intensity channel (OIC) under per-antenna peak- and average-intensity constraints. We first consider the case where the average intensities of…

Information Theory · Computer Science 2024-01-10 Ru-Han Chen , Longguang Li , Jia-Ning Guo , Xu Yang , Jian Zhang , Lin Li

This paper provides new inner and outer bounds on the capacity region of optical intensity multiple access channel (OIMAC) with per-user average or peak power constraint. For the average power constrained OIMAC, our bounds at high power are…

Information Theory · Computer Science 2019-08-29 Jing Zhou , Wenyi Zhang

We study the maximum achievable differential entropy at the output of a system assigning to each input X the sum X+N, with N a given noise with probability law absolutely continuous with respect to the Lebesgue measure and where the input…

Optimization and Control · Mathematics 2016-02-04 Francisco J. Piera

We study a deterministic approximation of the two-user multiple access wiretap channel. This approximation enables results beyond the recently shown $\tfrac{2}{3}$ secure degrees of freedom (s.d.o.f.) for the Gaussian multiple access…

Information Theory · Computer Science 2017-01-26 Rick Fritschek , Gerhard Wunder
‹ Prev 1 2 3 10 Next ›