Code Design Principles for Ultra-Reliable Random Access with Preassigned Patterns
Loading...
Access rights
openAccess
acceptedVersion
URL
Journal Title
Journal ISSN
Volume Title
A4 Artikkeli konferenssijulkaisussa
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Date
2019-07-01
Major/Subject
Mcode
Degree programme
Language
en
Pages
5
Series
2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings, pp. 2604-2608, IEEE International Symposium on Information Theory
Abstract
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.Description
Keywords
Other note
Citation
Boyd, C, Vehkalahti, R, Tirkkonen, O & Laaksonen, A 2019, Code Design Principles for Ultra-Reliable Random Access with Preassigned Patterns . in 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings ., 8849228, IEEE International Symposium on Information Theory, IEEE, pp. 2604-2608, IEEE International Symposium on Information Theory, Paris, France, 07/07/2019 . https://doi.org/10.1109/ISIT.2019.8849228