English
Related papers

Related papers: Gaussian Multiple Access Channels with One-Bit Qua…

200 papers

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

A generalized multiple access channel (GMAC) with one confidential message set is studied, where two users (users 1 and 2) attempt to transmit common information to a destination, and user 1 also has confidential information intended for…

Information Theory · Computer Science 2007-08-22 Yingbin Liang , H. Vincent Poor

This paper studies the optimal points in the capacity region of Gaussian multiple access channels (GMACs) with constant fading, multiple antennas and various power constraints. The points of interest maximize general rate objectives that…

Information Theory · Computer Science 2016-01-15 Daniel Calabuig , Ramy H. Gohary , Halim Yanikomeroglu

This paper presents finite-blocklength achievability bounds for the Gaussian multiple access channel (MAC) and random access channel (RAC) under average-error and maximal-power constraints. Using random codewords uniformly distributed on a…

Information Theory · Computer Science 2022-05-05 Recep Can Yavas , Victoria Kostina , Michelle Effros

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

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

Traditionally, the capacity region of a coherent fading multiple access channel (MAC) is analyzed in two popular contexts. In the first, a centralized system with full channel state information at the transmitters (CSIT) is assumed, and the…

Information Theory · Computer Science 2014-09-17 Sreejith Sreekumar , Bikash K. Dey , Sibi Raj B. Pillai

We consider a single-antenna Gaussian multiple-access channel (MAC) with a multiple-antenna amplify-and-forward (AF) relay, where, contrary to many previous works, also the direct links between transmitters and receiver are taken into…

Information Theory · Computer Science 2012-07-09 Frederic Knabe , Omar Mohamed , Carolin Huppert

We consider the decentralized power optimization problem for Gaussian fast-fading multiple access channel (MAC) so that the average sum-throughput is maximized. In our MAC setup, each transmitter has access to only its own fading…

Signal Processing · Electrical Eng. & Systems 2019-12-19 Kamal Singh

In this paper, capacity inner and outer bounds are established for the multiuser channels with Channel State Information (CSI) known non-causally at the transmitters: The Multiple Access Channel (MAC), the Broadcast Channel (BC) with common…

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

In this paper, we study the achievable rate region of Gaussian multiuser channels with the messages transmitted being from finite input alphabets and the outputs being {\em quantized at the receiver}. In particular, we focus on the…

Information Theory · Computer Science 2011-02-15 Suresh Chandrasekaran , Saif K. Mohammed , A. Chockalingam

We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the…

Information Theory · Computer Science 2007-07-13 Ender Tekin , Aylin Yener

This paper considers the problem of transmitting the difference of two jointly Gaussian sources over a two-user additive Gaussian noise multiple access channel (MAC). The goal is to recover this difference within an average mean squared…

Information Theory · Computer Science 2008-12-08 Rajiv Soundararajan , Sriram Vishwanath

In this paper, we investigate the capacity of massive multiple-input multiple-output (MIMO) systems corrupted by complex-valued additive white Gaussian noise (AWGN) when both the transmitter and the receiver employ 1-bit digital-to-analog…

Information Theory · Computer Science 2019-11-13 Armin Bazrafkan , Nikola Zlatanov

The capacity of multiple-input multiple-output additive white Gaussian noise channels is investigated under peak amplitude constraints on the norm of the input vector. New insights on the capacity-achieving input distribution are presented.…

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

We consider a Gaussian multiple-access channel (MAC) with an amplify-and-forward (AF) relay, where all nodes except the receiver have multiple antennas and the direct links between transmitters and receivers are neglected. Thus, spatial…

Information Theory · Computer Science 2015-03-20 Frederic Knabe , Omar Mohamed , Carolin Huppert

Wireless communications at the chip scale emerge as a interesting complement to traditional wire-based approaches thanks to their low latency, inherent broadcast nature, and capacity to bypass pin constraints. However, as current trends…

Emerging Technologies · Computer Science 2023-01-30 Bernat Ollé , Pau Talarn , Albert Cabellos-Aparicio , Filip Lemic , Eduard Alarcón , Sergi Abadal

We consider a Gaussian multiple access channel (GMAC) where the users are sensor nodes powered by energy harvesters. The energy harvester has no buffer to store the harvested energy and hence the energy need to be expended immediately. We…

Information Theory · Computer Science 2012-04-24 R Rajesh , Deekshith P K , Vinod Sharma

A memoryless state-dependent multiple-access channel (MAC) is considered, where two transmitters wish to convey their messages to a single receiver while simultaneously sensing (estimating) the respective states via generalized feedbacks.…

Information Theory · Computer Science 2022-04-01 Mehrasa Ahmadipour , Michele Wigger , Mari Kobayashi

In this paper we introduce the two-user asynchronous cognitive multiple access channel (ACMAC). This channel model includes two transmitters, an uninformed one, and an informed one which knows prior to the beginning of a transmission the…

Information Theory · Computer Science 2016-08-10 Michal Yemini , Anelia Somekh-Baruch , Amir Leshem