English
Related papers

Related papers: Achievable Rates and Outer Bound for the Half-Dupl…

200 papers

In this paper, the role of secret key with finite rate is studied to enhance the secrecy performance of the system when users are operating in interference limited scenarios. To address this problem, a 2-user Gaussian Z-IC with secrecy…

Information Theory · Computer Science 2021-05-20 Somalatha U , Parthajit Mohapatra

We first study the two-user additive noise multiple access channel (MAC) where the noise distribution is arbitrary. For such a MAC, we use spherical codebooks and either joint nearest neighbor (JNN) or successive interference cancellation…

Information Theory · Computer Science 2025-05-01 Yiming Wang , Lin Bai , Zhuangfei Wu , Lin Zhou

We consider the transmission of a common message from a transmitter to three receivers over a broadcast channel, referred to as a multicast channel in this case. All the receivers are allowed to cooperate with each other over full-duplex…

Information Theory · Computer Science 2017-02-20 Victor Exposito , Sheng Yang , Nicolas Gresset

We consider the multiple-access communication problem in a distributed setting for both the additive white Gaussian noise channel and the discrete memoryless channel. We propose a scheme called Distributed Rate Splitting to achieve the…

Information Theory · Computer Science 2016-11-18 Jian Cao , Edmund M. Yeh

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

In this paper, we consider a general K-user Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). We assume that the channel state is deterministic and known to all the nodes. While the private-message capacity region is…

Information Theory · Computer Science 2021-04-29 Zheng Li , Sheng Yang , Shlomo Shamai

Effective capacity, which provides the maximum constant arrival rate that a given service process can support while satisfying statistical delay constraints, is analyzed in a multiuser scenario. In particular, we study the achievable…

Information Theory · Computer Science 2009-10-22 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

In this report, the fundamental limits of simultaneous information and energy transmission in the two-user Gaussian multiple access channel (G-MAC) with and without feedback are fully characterized. More specifically, all the achievable…

Information Theory · Computer Science 2017-03-14 Selma Belhadj Amor , Samir M. Perlaza , Ioannis Krikidis , H. Vincent Poor

Posterior matching is a method proposed by Ofer Shayevitz and Meir Feder to design capacity achieving coding schemes for general point-to-point memoryless channels with feedback. In this paper, we present a way to extend posterior matching…

Information Theory · Computer Science 2016-11-17 Lan V. Truong

In this paper, achievable rates regions are derived for power constrained Gaussian broadcast channel of two users using finite dimension constellations. Various transmission strategies are studied, namely superposition coding (SC) and…

Information Theory · Computer Science 2014-03-24 Zeina Mheich , Florence Alberge , Pierre Duhamel

In this paper we present several strategies for multiple relay networks which are constrained by a half-duplex operation, i. e., each node either transmits or receives on a particular resource. Using the discrete memoryless multiple relay…

Information Theory · Computer Science 2007-12-24 P. Rost , G. Fettweis

A general time-varying feedback coding scheme is proposed for $M$-user fully connected symmetric Gaussian interference channels. Based on the analysis of the general coding scheme, we prove a theorem which gives a criterion for designing…

Information Theory · Computer Science 2019-10-01 Lan V. Truong , Hirosuke Yamamoto

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

A discrete memoryless generalized multiple access channel (GMAC) with confidential messages is studied, where two users attempt to transmit common information to a destination and each user also has private (confidential) information…

Information Theory · Computer Science 2007-07-13 Yingbin Liang , H. Vincent Poor

We analyze coding for energy efficiency in relay channels at a fixed source rate. We first propose a half-duplex decode-forward coding scheme for the Gaussian relay channel. We then derive three optimal sets of power allocation, which…

Information Theory · Computer Science 2016-11-18 Fanny Parzysz , Mai Vu , François Gagnon

In this paper, code pairs based on trellis coded modulation are proposed over PSK signal sets for a two-user Gaussian multiple access channel. In order to provide unique decodability property to the receiver and to maximally enlarge the…

Information Theory · Computer Science 2009-08-11 J. Harshan , B. Sundar Rajan

This paper concerns the transmission of two independent Gaussian sources over a two-user decentralized interference channel, assuming that the transmitters are unaware of the instantaneous CSIs. The availability of the channel state…

Signal Processing · Electrical Eng. & Systems 2017-12-21 Mohammadreza Darabi

This paper focuses on the problem of separately modulating and jointly estimating two independent continuous-valued parameters sent over a Gaussian multiple-access channel (MAC) under the mean square error (MSE) criterion. To this end, we…

Information Theory · Computer Science 2016-09-28 Ayse Unsal , Raymond Knopp , Neri Merhav

We characterize stability regions of two-user fading Gaussian multiple access (MAC) and broadcast (BC) networks with centralized scheduling. The data to be transmitted to the users is encoded into codewords of fixed length. The rates of the…

Information Theory · Computer Science 2007-07-13 Viveck R. Cadambe , Syed A. Jafar

This paper considers the single antenna, static Gaussian broadcast channel in the finite blocklength regime. Second order achievable and converse rate regions are presented. Both a global reliability requirement and per-user reliability…

Information Theory · Computer Science 2022-10-03 Daniela Tuninetti , Paul Sheldon , Besma Smida , Natasha Devroye