DeepAI AI Chat
Log In Sign Up

Code Design Principles for Ultra-Reliable Random Access with Preassigned Patterns

by   Christopher Boyd, et al.
Helsingin yliopisto

We study medium access control layer random access under the assumption that the receiver can perform successive interference cancellation, without feedback. During recent years, a number of protocols with impressive error performance have been suggested for this channel model. However, the random nature of these protocols causes an error floor which limits their usability when targeting ultra-reliable communications. In very recent works by Paolini et al. and Boyd et. al., it was shown that if each user employs predetermined combinatorial access patterns, this error floor disappears. In this paper, we develop code design criteria for deterministic random access protocols in the ultra-reliability region, and build codes based on these principles. The suggested design methods are supported by simulations.


page 1

page 2

page 3

page 4


Deterministic Patterns for Multiple Access in Latency-Constrained Ultra-Reliable Communications

The grant-free access is envisioned as one of the enablers of the ultra-...

Comment on "Open is not forever: a study of vanished open access journals"

We comment on a recent article by Laakso et al. (arXiv:2008.11933 [cs.DL...

Protograph LDPC Code Design for Asynchronous Random Access

This work addresses the physical layer channel code design for an uncoor...

Achieving Ultra-Reliable Communication via CRAN-Enabled Diversity Schemes

Internet of things is in progress to build a smart society, and wireless...

The Exact Load-Memory Tradeoff of Multi-Access Coded Caching With Combinatorial Topology

Recently, Muralidhar et al. proposed a novel multi-access system model w...

Does My Representation Capture X? Probe-Ably

Probing (or diagnostic classification) has become a popular strategy for...