English
Related papers

Related papers: Near-Optimal Coding for Many-user Multiple Access …

200 papers

This paper proposes a new model called \emph{spatial continuum asymmetric channels} to study the channel capacity region of asymmetric scenarios in which either one source transmits to a spatial density of receivers or a density of…

Information Theory · Computer Science 2016-02-03 Jean-Marie Gorce , H. Vincent Poor , Jean-Marc Kelif

In this paper consider a two user multiple access channel with noisy feedback. There are two senders with independent messages who transmit symbols across an additive white Gaussian channel to a receiver, who in turn sends back a symbol…

Information Theory · Computer Science 2021-12-20 Deepanshu Vasal

In this paper, we consider the problem of evaluating capacity expression of a multiple access channel (MAC) with noiseless feedback. So far, the capacity expression for this channel is known through a multi letter directed information by…

Information Theory · Computer Science 2022-02-08 Deepanshu Vasal

We consider the problem of coding over the multi-user Interference Channel (IC). It is well-known that aligning the interfering signals results in improved achievable rates in certain setups involving more than two users. We argue that in…

Information Theory · Computer Science 2016-02-18 F. Shirani , S. S. Pradhan

We consider a Gaussian multiple-access channel with random user activity where the total number of users $\ell_n$ and the average number of active users $k_n$ may be unbounded. For this channel, we characterize the maximum number of bits…

Information Theory · Computer Science 2020-07-14 Jithin Ravi , Tobias Koch

With the complication of future communication scenarios, most conventional signal processing technologies of multi-user multiple-input multiple-output (MU-MIMO) become unreliable, which are designed based on ideal assumptions, such as…

Information Theory · Computer Science 2022-06-27 Yuhao Chi , Lei Liu , Guanghui Song , Ying Li , Yong Liang Guan , Chau Yuen

One of the major challenges in the medium access control (MAC) protocol design over cognitive Ad Hoc networks (CAHNs) is how to efficiently utilize multiple opportunistic channels, which vary dynamically and are subject to limited power…

Information Theory · Computer Science 2011-05-03 Yichen Wang , Pinyi Ren , Qinghe Du , Chao Zhang

The multi-access variant of the coded caching problem with $N$ files, $K$ users and $K$ caches, where each user has access to $L$ neighbouring caches in a cyclic wrap-around manner, is considered. A cut-set based lower bound on the optimal…

Information Theory · Computer Science 2022-01-25 K. K. Krishnan Namboodiri , B. Sundar Rajan

In 2017, Polyanskiy [1] showed that the trade-off between power and bandwidth efficiency for massive Gaussian random access is governed by two fundamentally different regimes: low power and high power. For both regimes, tight performance…

Information Theory · Computer Science 2021-05-12 Ralf Müller

Sparse superposition codes are a recent class of codes introduced by Barron and Joseph for efficient communication over the AWGN channel. With an appropriate power allocation, these codes have been shown to be asymptotically…

Information Theory · Computer Science 2018-03-19 Adam Greig , Ramji Venkataramanan

The paper establishes the capacity region of the Gaussian interference channel with many transmitter-receiver pairs constrained to use point-to-point codes. The capacity region is shown to be strictly larger in general than the achievable…

Information Theory · Computer Science 2011-02-15 Francois Baccelli , Abbas El Gamal , David Tse

A scheme is proposed that combines probabilistic signal shaping with bit-metric decoding. The transmitter generates symbols according to a distribution on the channel input alphabet. The symbols are labeled by bit strings. At the receiver,…

Information Theory · Computer Science 2014-04-22 Georg Böcherer

This paper presents a cross-layer approach for optimizing the delay performance of a multiuser diversity system with heterogeneous block-fading channels and a delay-sensitive bursty-traffic. We consider the downlink of a time-slotted…

Information Theory · Computer Science 2009-02-10 Jalil Seifali Harsini , Farshad Lahouti

This paper presents the first Network-Coded Multiple Access (NCMA) system with multiple users adopting different signal modulations, referred to as rate-diverse NCMA. A distinguishing feature of NCMA is the joint use of physical-layer…

Information Theory · Computer Science 2016-10-05 Haoyuan Pan , Lu Lu , Soung Chang Liew

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

In the scalar dirty multiple-access channel, in addition to Gaussian noise, two additive interference signals are present, each known non-causally to a single transmitter. It was shown by Philosof et al. that for strong interferences, an…

Information Theory · Computer Science 2017-06-20 Anatoly Khina , Yuval Kochman , Uri Erez

This paper considers a random access system where each sender can be in two modes of operation, active or not active, and where the set of active users is available to a common receiver only. Active transmitters encode data into independent…

Information Theory · Computer Science 2016-11-18 Paolo Minero , Massimo Franceschetti , David N. C. Tse

Low-density parity-check (LDPC) codes have been used for communication over a two-user Gaussian broadcast channel. It has been shown in the literature that the optimal decoding of such system requires joint decoding of both user messages at…

Information Theory · Computer Science 2016-11-18 Mahdi Ramezani , Masoud Ardakani

This paper investigates a multiuser millimeter-wave (mmWave) uplink system in which each user is equipped with a multi-antenna fluid antenna system (FAS) while the base station (BS) has multiple fixed-position antennas. Our primary…

Information Theory · Computer Science 2024-08-20 Hao Xu , Kai-Kit Wong , Wee Kiat New , Farshad Rostami Ghadi , Gui Zhou , Ross Murch , Chan-Byoung Chae , Yongxu Zhu , Shi Jin

Consider a random access communication scenario over a channel whose operation is defined for any number of possible transmitters. As in the model recently introduced by Polyanskiy for the Multiple Access Channel (MAC) with a fixed, known…

Information Theory · Computer Science 2021-03-19 Recep Can Yavas , Victoria Kostina , Michelle Effros