English
Related papers

Related papers: Signal Shaping for Two-User Gaussian Multiple Acce…

200 papers

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

In this paper, we derive new closed-form expressions for the gradient of the mutual information with respect to arbitrary parameters of the two-user multiple access channel (MAC). The derived relations generalize the fundamental relation…

Information Theory · Computer Science 2014-11-07 Samah A. M. Ghanem

We consider the problem of shared randomness-assisted multiple access channel (MAC) simulation for product inputs and characterize the one-shot communication cost region via almost-matching inner and outer bounds in terms of the smooth…

Information Theory · Computer Science 2026-03-26 Aditya Nema , Sreejith Sreekumar , Mario Berta

Approximate capacity regions are established for a class of interfering multiple access channels consisting of two multiple-access channels (MACs), each with an arbitrary number of transmitters, with one transmitter in each MAC causing…

Information Theory · Computer Science 2018-09-05 Yimin Pang , Mahesh K. Varanasi

The capacity of a network in which a multiple access channel (MAC) generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case.…

Information Theory · Computer Science 2012-09-06 Fangfang Zhu , Xiaohu Shang , Biao Chen , H. Vincent Poor

A new lower bound for the average probability or error for a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This bound has a structure very similar to the well-known sphere packing packing bound derived by…

Information Theory · Computer Science 2010-10-08 Ali Nazari , S. Sandeep Pradhan , Achilleas Anastasopoulos

A multi-input multi-output (MIMO) Gaussian channel with two transmit antennas and two receive antennas is studied that is subject to an input peak-power constraint. The capacity and the capacity-achieving input distribution are unknown in…

Information Theory · Computer Science 2024-01-31 Alex Dytso , Luca Barletta , Gerhard Kramer

This paper addresses the problem of distributed state estimation via multiple access channels (MACs). We consider a scenario where two encoders are simultaneously communicating their measurements through a noisy channel. Firstly, the…

Systems and Control · Electrical Eng. & Systems 2022-12-23 Ghassen Zafzouf , Girish N. Nair , Farhad Farokhi

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

We consider a multiple-input multiple-output (MIMO) multiple access channel (MAC), where the channel between each transmitter and the receiver is modeled by the doubly-scattering channel model. Based on novel techniques from random matrix…

Information Theory · Computer Science 2011-05-11 Jakob Hoydis , Romain Couillet , Merouane Debbah

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

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

For two-user interference channels, the capacity is known for the case where interference is stronger than the desired signal. Moreover, it is known that if the interference is above a certain level, it does not reduce the capacity at all.…

Information Theory · Computer Science 2012-06-21 Frederic Knabe , Aydin Sezgin

This paper studies the impact of probabilistic shaping on effective signal-to-noise ratios (SNRs) and achievable information rates (AIRs) in a back-to-back configuration and in unrepeated nonlinear fiber transmissions. For back-to-back,…

This paper studies the second-order asymptotics of coding rates for the discrete memoryless multiple-access channel with a fixed target error probability. Using constant-composition random coding, coded time-sharing, and a variant of…

Information Theory · Computer Science 2014-11-18 Jonathan Scarlett , Alfonso Martinez , Albert Guillén i Fàbregas

We study the power-versus-distortion trade-off for the transmission of a memoryless bivariate Gaussian source over a two-to-one Gaussian multiple-access channel with perfect causal feedback. In this problem, each of two separate…

Information Theory · Computer Science 2009-03-23 Amos Lapidoth , Stephan Tinguely

Achievable rate regions and outer bounds are derived for three-user interference channels where the transmitters cooperate in a unidirectional manner via a noncausal message-sharing mechanism. The three-user channel facilitates different…

Information Theory · Computer Science 2016-11-17 K. G. Nagananda , Parthajit Mohapatra , Chandra R. Murthy , Shalinee Kishore

We study the throughput capacity region of the Gaussian multi-access (MAC) fading channel with perfect channel state information (CSI) at the receiver and at the transmitters, at low power regime. We show that it has a multidimensional…

Information Theory · Computer Science 2013-11-01 Zouheir Rezki , Mohamed-Slim Alouini

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

We study the problem of coding over a general discrete memoryless broadcast channel controlled by random parameters. The parameters are available at the transmitter in a non-causal manner and are subject to a state masking constraint on the…

Information Theory · Computer Science 2018-10-30 Michael Dikshtein , Shlomo Shamai