The Strongly Asynchronous Massive Access Channel

07/26/2018
by   Sara Shahi, et al.
0

This paper considers a Strongly Asynchronous and Slotted Massive Access Channel (SAS-MAC) where K_n:=e^nν different users transmit a randomly selected message among M_n:=e^nR ones within a strong asynchronous window of length A_n:=e^nα blocks, where each block lasts n channel uses. A global probability of error is enforced, ensuring that all the users' identities and messages are correctly identified and decoded. Achievability bounds are derived for the case that different users have similar channels, the case that users' channels can be chosen from a set which has polynomially many elements in the blocklength n, and the case with no restriction on the users' channels. A general converse bound on the capacity region and a converse bound on the maximum growth rate of the number of users are derived.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/11/2019

Error Exponents for Asynchronous Multiple Access Channels. Controlled Asynchronism may Outperform Synchronism

Exponential error bounds are derived for frame-asynchronous discrete mem...
research
01/05/2023

Capacity Region of Asynchronous Multiple Access Channels with FTN

This paper studies the capacity region of asynchronous multiple access c...
research
05/09/2021

Feedback Gains for Gaussian Massive Multiple-Access Channels

Feedback is shown to increase the sum-rate capacity of K-user Gaussian m...
research
03/17/2021

Massive Uncoordinated Access With Random User Activity

We extend the seminal work by Polyanskiy (2017) on massive uncoordinated...
research
02/14/2022

On Payment Channels in Asynchronous Money Transfer Systems

Money transfer is an abstraction that realizes the core of cryptocurrenc...
research
08/23/2022

A Quinary Coding and Matrix Structure-based Channel Hopping Algorithm for Blind Rendezvous in Cognitive Radio Networks

The multi-channel blind rendezvous problem in distributed cognitive radi...
research
05/11/2023

An Asynchronous Massive Access Scheme with Dynamic Range Considerations

This paper studies the performance of a transmission and reception schem...

Please sign up or login with your details

Forgot password? Click here to reset