English
Related papers

Related papers: Sum-Rate Capacity for Symmetric Gaussian Multiple …

200 papers

Base station cooperation improves the sum-rates that can be achieved in cellular systems. Conventional cooperation techniques require sharing large amounts of information over finite-capacity backhaul links and assume that base stations…

Information Theory · Computer Science 2009-12-08 Ramya Bhagavatula , Robert W. Heath

Feedback holds a pivotal role in practical communication schemes, even though it does not enhance channel capacity. Its main attribute includes adaptability in transmission that allows for a higher rate of convergence of the error…

Information Theory · Computer Science 2024-03-22 Ioannis Papoutsidakis , Robert J. Piechocki , Angela Doufexi

Consider a Gaussian relay network where a source node communicates to a destination node with the help of several layers of relays. Recent work has shown that compress-and-forward based strategies can achieve the capacity of this network…

Information Theory · Computer Science 2015-07-16 Ritesh Kolte , Ayfer Özgür , Abbas El Gamal

This paper studies a two-user state-dependent Gaussian multiple-access channel (MAC) with state noncausally known at one encoder. Two scenarios are considered: i) each user wishes to communicate an independent message to the common…

Information Theory · Computer Science 2017-05-05 Wei Yang , Yingbin Liang , Shlomo Shamai , H. Vincent Poor

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 use of multi-antenna arrays in both transmission and reception has been shown to dramatically increase the throughput of wireless communication systems. As a result there has been considerable interest in characterizing the ergodic…

Information Theory · Computer Science 2007-07-16 Aris L. Moustakas , Steven H. Simon

This paper deals with the problem of computing the boundary of the capacity region for the memoryless two-user binary-input binary-output multiple-access channel ((2,2;2)-MAC), or equivalently, the computation of input probability…

Information Theory · Computer Science 2009-04-30 J. Bühler , G. Wunder

Gaussian MIMO channel under total transmit and multiple interference power constraints (TPC and IPCs) is considered. A closed-form solution for its optimal transmit covariance matrix is obtained in the general case (up to dual variables). A…

Information Theory · Computer Science 2020-05-18 Sergey Loyka

We consider a combinatorial multi-armed bandit problem for maximum value reward function under maximum value and index feedback. This is a new feedback structure that lies in between commonly studied semi-bandit and full-bandit feedback…

Machine Learning · Computer Science 2023-05-26 Yiliu Wang , Wei Chen , Milan Vojnović

We present an upper bound for the quantum channel capacity that is both additive and convex. Our bound can be interpreted as the capacity of a channel for high-fidelity quantum communication when assisted by a family of channels that have…

Quantum Physics · Physics 2008-08-28 Graeme Smith , John A. Smolin , Andreas Winter

Over the fast few years, the numerical success of the generalized alternating direction method of multipliers (GADMM) proposed by Eckstein \& Bertsekas [Math. Prog., 1992] has inspired intensive attention in analyzing its theoretical…

Optimization and Control · Mathematics 2022-06-09 Han Wang , Peili Li , Yunhai Xiao

The traditional information theoretic approach to studying feedback is to consider ideal instantaneous high-rate feedback of the channel outputs to the encoder. This was acceptable in classical work because the results were negative:…

Information Theory · Computer Science 2007-12-07 Anant Sahai

This paper presents two different low-complexity methods for obtaining the secrecy capacity of multiple-input multiple-output (MIMO) wiretap channel subject to a sum power constraint (SPC). The challenges in deriving computationally…

Information Theory · Computer Science 2021-02-23 Anshu Mukherjee , Björn Ottersten , Le Nam Tran

An upper bound on the capacity of multiple-input multiple-output (MIMO) Gaussian fading channels is derived under peak amplitude constraints. The upper bound is obtained borrowing concepts from convex geometry and it extends to MIMO…

Information Theory · Computer Science 2021-11-29 Antonino Favano , Marco Ferrari , Maurizio Magarini , Luca Barletta

The downlink of symmetric Cloud Radio Access Networks (C-RANs) with multiple relays and a single receiver is studied. Lower and upper bounds are derived on the capacity. The lower bound is achieved by Marton's coding which facilitates…

Information Theory · Computer Science 2018-02-14 Shirin Saeedi Bidokhti , Gerhard Kramer , Shlomo Shamai

Lattice codes used under the Compute-and-Forward paradigm suggest an alternative strategy for the standard Gaussian multiple-access channel (MAC): The receiver successively decodes integer linear combinations of the messages until it can…

Information Theory · Computer Science 2016-11-17 Jingge Zhu , Michael Gastpar

The operational capacity of Gaussian MIMO channels with memory was obtained by Brandenburg and Wyner in [9] under certain mild assumptions on the channel impulse response and its noise covariance matrix, which essentuially require channel…

Information Theory · Computer Science 2022-05-11 Sergey Loyka , Charalambos D. Charalambous

We study communication over a Gaussian multiple-access channel (MAC) with two types of transmitters: Digital transmitters hold a message from a discrete set that needs to be communicated to the receiver with vanishing error probability.…

Information Theory · Computer Science 2025-04-28 Matthias Frey , Igor Bjelaković , Michael C. Gastpar , Jingge Zhu

This paper studies the structure of downlink sum-rate maximizing selective decentralized feedback policies for opportunistic beamforming under finite feedback constraints on the average number of mobile users feeding back. Firstly, it is…

Information Theory · Computer Science 2011-07-26 Tharaka Samarasinghe , Hazer Inaltekin , Jamie S. Evans

The channel capacity for the binary symmetric channel is investigated based on the symmetrized definition of the mutual information, which is arising from an attempt of extension of information content based on the nonadditivity. The…

Statistical Mechanics · Physics 2016-08-31 Takuya Yamano