English
Related papers

Related papers: Effective Capacity in Multiple Access Channels wit…

200 papers

Upper bounds on the capacity of vector Gaussian channels affected by fading are derived under peak amplitude constraints at the input. The focus is on constraint regions that can be decomposed in a Cartesian product of sub-regions. This…

Information Theory · Computer Science 2022-07-05 Antonino Favano , Marco Ferrari , Maurizio Magarini , Luca Barletta

The problem of minimizing the total power consumption while satisfying different quality-of-service (QoS) requirements in a two-hop multiple-input multiple-output network with a single non-regenerative relay is considered. As shown by Y.…

Information Theory · Computer Science 2013-03-13 Luca Sanguinetti , Antonio A. D'Amico

We discuss the problem of designing channel access architectures for enabling fast, low-latency, grant-free and uncoordinated uplink for densely packed wireless nodes. Specifically, we study random-access codes, previously introduced for…

Information Theory · Computer Science 2019-07-23 Suhas S Kowshik , Kirill Andreev , Alexey Frolov , Yury Polyanskiy

We consider a two-user Gaussian multiple access channel with two independent additive white Gaussian interferences. Each interference is known to exactly one transmitter non-causally. Transmitters are allowed to cooperate through…

Information Theory · Computer Science 2010-09-23 I-Hsiang Wang

We study the capacity region of the two-user Binary Fading (or Erasure) Interference Channel where the transmitters have no knowledge of the channel state information. We develop new inner-bounds and outer-bounds for this problem. We…

Information Theory · Computer Science 2017-03-28 Alireza Vahid , Mohammad Ali Maddah-Ali , Amir Salman Avestimehr , Yan Zhu

We consider decentralized multi-antenna cognitive radio networks where secondary (cognitive) users are granted simultaneous spectrum access along with license-holding (primary) users. We treat the problem of distributed beamforming and rate…

Information Theory · Computer Science 2015-05-13 Ali Tajer , Narayan Prasad , Xiaodong Wang

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

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

We study a three-node quantum network which enables bidirectional communication between two nodes with a half-duplex relay node. A decode-and-forward protocol is used to perform the communication in two phases. In the first phase, the…

Information Theory · Computer Science 2015-09-29 Holger Boche , Minglai Cai , Christian Deppe

We consider a two-user state-dependent multiaccess channel in which the states of the channel are known non-causally to one of the encoders and only strictly causally to the other encoder. Both encoders transmit a common message and, in…

Information Theory · Computer Science 2016-11-17 Abdellatif Zaidi , Pablo Piantanida , Shlomo Shamai

We consider the problem of Simultaneous Wireless Information and Power Transfer (SWIPT) over a fading multiple access channel with additive Gaussian noise. The transmitters as well as the receiver harvest energy from ambient sources. We…

Information Theory · Computer Science 2016-12-14 P K Deekshith , Trupthi Chougule , Shreya Turmari , Ramya Raju , Rakshitha Ram , Vinod Sharma

This paper considers a three-receiver broadcast channel with degraded message sets and message cognition. The model consists of a common message for all three receivers, a private common message for only two receivers and two additional…

Information Theory · Computer Science 2016-01-27 Ahmed S. Mansour , Rafael F. Schaefer , Holger Boche

Motivated by a simple broadcast channel, we generalize the notions of a less noisy receiver and a more capable receiver to an essentially less noisy receiver and an essentially more capable receiver respectively. We establish the capacity…

Information Theory · Computer Science 2009-04-29 Chandra Nair

This paper considers an arbitrarily-varying fading channel consisting of one transmitter, one receiver and an arbitrarily varying adversary. The channel is assumed to have additive Gaussian noise and fast fading of the gain from the…

Information Theory · Computer Science 2021-06-15 Fatemeh Hosseinigoki , Oliver Kosut

A game theoretic approach is used to derive the optimal decentralized power allocation (PA) in fast fading multiple access channels where the transmitters and receiver are equipped with multiple antennas. The players (the mobile terminals)…

Information Theory · Computer Science 2016-11-18 Elena Veronica Belmega , Samson Lasaulce , Merouane Debbah

We study private classical communication over quantum multiple-access channels. For an arbitrary number of transmitters, we derive a regularized expression of the capacity region. In the case of degradable channels, we establish a…

Information Theory · Computer Science 2022-01-31 Remi A. Chou

Two-way relaying can considerably improve spectral efficiency in relay-assisted bidirectional communications. However, the benefits and flexible structure of orthogonal frequency division multiplexing (OFDM)-based two-way decode-and-forward…

Information Theory · Computer Science 2013-01-28 Yuan Liu , Jianhua Mo , Meixia Tao

The two-user Multiple Access Channel (MAC) with cooperative encoders and Channel State Information (CSI) is considered where two different scenarios are investigated: A two-user MAC with common message (MACCM) and a two-user MAC with…

Information Theory · Computer Science 2013-02-17 Reza K. Farsani , Farokh Marvasti

The problem of mismatched decoding for discrete memoryless channels is addressed. A mismatched cognitive multiple-access channel is introduced, and an inner bound on its capacity region is derived using two alternative encoding methods:…

Information Theory · Computer Science 2013-05-03 Anelia Somekh-Baruch

Wireless systems comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. A distinct characteristic of these systems is the fact that the nodes can harvest energy throughout the duration in which…

Information Theory · Computer Science 2011-06-09 Omur Ozel , Kaya Tutuncuoglu , Jing Yang , Sennur Ulukus , Aylin Yener