English
Related papers

Related papers: One-shot Multiple Access Channel Simulation

200 papers

In this paper, we study the decentralized parallel multiple access channel (MAC) when transmitters selfishly maximize their individual spectral efficiency by selecting a single channel to transmit. More specifically, we investigate the set…

Computer Science and Game Theory · Computer Science 2011-12-09 Samir M. Perlaza , Samson Lasaulce , Mérouane Debbah

In this work, we study the real-time tracking and reconstruction of an information source with the purpose of actuation. A device monitors the state of the information source and transmits status updates to a receiver over a wireless…

Information Theory · Computer Science 2023-02-28 Mehrdad Salimnejad , Marios Kountouris , Nikolaos Pappas

This article considers the massive MIMO unsourced random access problem on a quasi-static Rayleigh fading channel. Given a fixed message length and a prescribed number of channel uses, the objective is to construct a coding scheme that…

Information Theory · Computer Science 2022-03-09 Michail Gkagkos , Krishna R. Narayanan , Jean-Francois Chamberland , Costas N. Georghiades

In this paper, we investigate the design of linear precoders for multiple-input multiple-output (MIMO) multiple access channels (MAC). We assume that statistical channel state information (CSI) is available at the transmitters and consider…

Information Theory · Computer Science 2014-01-22 Yongpeng Wu , Chao-Kai Wen , Chengshan Xiao , Xiqi Gao , Robert Schober

This study focuses on (traditional and unsourced) multiple-access communication over a single transmit and multiple ($M$) receive antennas. We assume full or partial channel state information (CSI) at the receiver. It is known that to fully…

Information Theory · Computer Science 2023-07-04 Alexander Fengler , Alejandro Lancho , Yury Polyanskiy

We prove the strong converse for the $N$-source Gaussian multiple access channel (MAC). In particular, we show that any rate tuple that can be supported by a sequence of codes with asymptotic average error probability less than one must lie…

Information Theory · Computer Science 2016-10-19 Silas L. Fong , Vincent Y. F. Tan

We consider the problem of designing low latency and low complexity schemes for channel state feedback over the MIMO-MAC (multiple-input multiple-output multiple access channel). We develop a framework for analyzing this problem in terms of…

Information Theory · Computer Science 2010-05-11 K. Raj Kumar , Giuseppe Caire

The multiple access channel (MAC) capacity with feedback is considered under feedback models designed to tease out which factors contribute to the MAC feedback capacity benefit. Comparing the capacity of a MAC with ``perfect'' feedback,…

Information Theory · Computer Science 2023-05-11 Oliver Kosut , Michelle Effros , Michael Langberg

A state-dependent discrete memoryless multiple access channel is considered to model an integrated sensing and communication system, where two transmitters wish to convey messages to a receiver while simultaneously estimating the state…

Information Theory · Computer Science 2025-06-19 Yao Liu , Min Li , An Liu , Lawrence Ong , Aylin Yener

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 investigate the problem of approximating the product $a^TBc$, where $a,c\in S^{n-1}$ and $B\in O_n$, in models of communication complexity and streaming algorithms. The worst meaningful approximation is to simply decide whether the…

Computational Complexity · Computer Science 2019-12-25 Hartmut Klauck , Debbie Lim

We consider the exact channel synthesis problem. This problem concerns the determination of the minimum amount of information required to create exact correlation remotely when there is a certain rate of randomness shared by two terminals.…

Information Theory · Computer Science 2019-09-27 Lei Yu , Vincent Y. F. Tan

Presence of multiple antennas on both sides of a communication channel promises significant improvements in system throughput and power efficiency. In effect, a new class of large multiple-input multiple-output (MIMO) communication systems…

Information Theory · Computer Science 2014-01-28 Maksym A. Girnyk , Mikko Vehkaperä , Lars K. Rasmussen

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

Two parties observing correlated random variables seek to run an interactive communication protocol. How many bits must they exchange to simulate the protocol, namely to produce a view with a joint distribution within a fixed statistical…

Information Theory · Computer Science 2016-02-01 Himanshu Tyagi , Shaileshh Venkatakrishnan , Pramod Viswanath , Shun Watanabe

We study communication over multiple access channels (MAC) where one of the users is possibly adversarial. When all users are non-adversarial, we want their messages to be decoded reliably. When an adversary is present, we consider two…

Information Theory · Computer Science 2019-04-29 Neha Sangwan , Mayank Bakshi , Bikash Kumar Dey , Vinod M. Prabhakaran

The two-user discrete memoryless state-dependent multiple-access channel (MAC) models a scenario in which two encoders transmit independent messages to a single receiver via a MAC whose channel law is governed by the pair of encoders'…

Information Theory · Computer Science 2010-07-23 Shraga I. Bross , Amos Lapidoth

In this work, we study two models of arbitrarily varying channels, when causal side information is available at the encoder in a causal manner. First, we study the arbitrarily varying channel (AVC) with input and state constraints, when the…

Information Theory · Computer Science 2017-01-23 Uzi Pereg , Yossef Steinberg

A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special cases of physically degraded channels and unidirectional…

Information Theory · Computer Science 2016-11-18 O. Simeone , D. Gunduz , H. V. Poor , A. Goldsmith , S. Shamai

This paper investigates the massive random access for a huge amount of user devices served by a base station (BS) equipped with a massive number of antennas. We consider a grant-free unsourced random access (U-RA) scheme where all users…

Information Theory · Computer Science 2020-09-15 Xinyu Xie , Yongpeng Wu , Junyuan Gao , Wenjun Zhang