English
Related papers

Related papers: The Capacity of the Gaussian Cooperative Two-user …

200 papers

Compute-forward multiple access (CFMA) is a transmission strategy which allows the receiver in a multiple access channel (MAC) to first decode linear combinations of the transmitted signals and then solve for individual messages. Compared…

Information Theory · Computer Science 2024-05-10 Lanwei Zhang , Jamie Evans , Jingge Zhu

This paper considers the forward error correction (FEC) code design for approaching the capacity of a dynamic multiple access channel (MAC) where both the number of users and their respective signal powers keep constantly changing,…

Information Theory · Computer Science 2019-07-22 Xiaojie Wang , Sebastian Cammerer , Stephan ten Brink

In this paper, we examine discrete memoryless Multiple Access Channels (MACs) with two-sided feedback in the presence of two correlated channel states that are correlated in the sense of Slepian-Wolf (SW). We find achievable rate region for…

Information Theory · Computer Science 2012-12-17 Saeed Hajizadeh , Ghosheh Abed Hodtani

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

There has been major progress over the last decade in understanding the classical interference channel (IC). Recent key results show that constant bit gap capacity results can be obtained from linear deterministic models (LDMs). However, it…

Information Theory · Computer Science 2016-11-17 Rick Fritschek , Gerhard Wunder

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 the two-user Gaussian multiple-input multiple-output (MIMO) broadcast channel with common and confidential messages. In this channel, the transmitter sends a common message to both users, and a confidential message to each user…

Information Theory · Computer Science 2010-03-01 Ersen Ekrem , Sennur Ulukus

Interference alignment has emerged as a powerful tool in the analysis of multi-user networks. Despite considerable recent progress, the capacity region of the Gaussian K-user interference channel is still unknown in general, in part due to…

Information Theory · Computer Science 2016-11-15 Or Ordentlich , Uri Erez , Bobak Nazer

We obtain new outer bounds on the capacity regions of the two-user multiple access channel with generalized feedback (MAC-GF) and the two-user interference channel with generalized feedback (IC-GF). These outer bounds are based on the idea…

Information Theory · Computer Science 2016-11-18 Ravi Tandon , Sennur Ulukus

This work focuses on studying the half-duplex (HD) relaying in the Multiple Access Relay Channel (MARC) and the Compound Multiple Access Channel with a Relay (cMACr). A generalized Quantize-and-Forward (GQF) has been proposed to establish…

Information Theory · Computer Science 2014-01-15 Ming Lei , Mohammad Reza Soleymani

In this paper, we present a new cooperative communication scheme consisting of two users in half-duplex mode communicating with one destination over a discrete memoryless channel. The users encode messages in independent blocks and divide…

Information Theory · Computer Science 2011-06-03 Ahmad Abu Al Haija , Mai Vu

Compute-forward multiple access (CFMA) is a multiple access transmission scheme based on Compute-and-Forward (CF) which allows the receiver to first decode linear combinations of the transmitted signals and then solve for individual…

Information Theory · Computer Science 2023-05-29 Lanwei Zhang , Jamie Evans , Jingge Zhu

This paper investigates the problem of activity detection and channel estimation in cooperative multi-cell massive access systems with temporally correlated activity, where all access points (APs) are connected to a central unit via…

Signal Processing · Electrical Eng. & Systems 2023-04-20 Weifeng Zhu , Meixia Tao , Xiaojun Yuan , Fan Xu , Yunfeng Guan

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

We characterize the fundamental limits of transmission of information over a Gaussian multiple access channel (MAC) with the use of variable-length feedback codes and under a non-vanishing error probability formalism. We develop new…

Information Theory · Computer Science 2018-01-10 Lan V. Truong , Vincent Y. F. Tan

The problem of resource allocation is studied for two-sender two-receiver fading Gaussian interference channels (IFCs) and compound multiaccess channels (C-MACs). The senders in an IFC communicate with their own receiver (unicast) while…

Information Theory · Computer Science 2016-11-15 Lalitha Sankar , Elza Erkip , H. Vincent Poor

Interference is a fundamental feature of the wireless channel. To better understand the role of cooperation in interference management, the two-user Gaussian interference channel where the destination nodes can cooperate by virtue of being…

Information Theory · Computer Science 2011-01-28 Vinod M. Prabhakaran , Pramod Viswanath

Bosonic channels describe quantum-mechanically many practical communication links such as optical, microwave, and radiofrequency. We investigate the maximum rates for the bosonic multiple access channel (MAC) in the presence of thermal…

Quantum Physics · Physics 2022-07-19 Evan J. D. Anderson , Boulat A. Bash

Cooperation strategies allow communication devices to work together to improve network capacity. Consider a network consisting of a $k$-user multiple access channel (MAC) and a node that is connected to all $k$ encoders via rate-limited…

Information Theory · Computer Science 2016-11-17 Parham Noorzad , Michelle Effros , Michael Langberg

In a two-user channel, completion time refers to the number of channel uses spent by each user to transmit a bit pool with some given size. In this paper, the information-theoretic formulation of completion time is based on the concept of…

Information Theory · Computer Science 2015-08-04 Yuanpeng Liu , Elza Erkip