Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2202.09890 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929317721669632 |
|---|---|
| author | Kotaba, Radosław Vehkalahti, Roope Stefanović, Čedomir Tirkkonen, Olav Popovski, Petar |
| author_facet | Kotaba, Radosław Vehkalahti, Roope Stefanović, Čedomir Tirkkonen, Olav Popovski, Petar |
| contents | We study a scenario in which multiple uncoordinated devices aim to achieve reliable transmissions within a given time frame. The devices are intermittently active and access a shared pool of channel resources in a grant-free manner by utilizing multiple transmissions (K-repetition coding). This allows them to achieve diversity and improve the reliability within a certain latency constraint. We focus on two access methods: one where devices choose K slots at random and another one where the access patterns are deterministic and follow a specific code design, namely the Steiner System. We analyze the problem under two signal models that involve different complexity for the receiver. First, collision model is considered, where only interference-free transmissions can be used and combined. Second, a model treating interference as noise is analyzed, where the receiver is capable of utilizing all K replicas, applying maximum ratio combining (MRC). For both signal models, we investigate receivers with and without successive interference cancellation (SIC). We develop approximations and bounds for the outage probabilities that very closely match simulation results. Overall, we show that deterministic access patterns have the potential to significantly outperform random selection in terms of reliability. Furthermore, deterministic access patterns offer a simplified system design. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2202_09890 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Deterministic Patterns for Multiple Access with Latency and Reliability Guarantees Kotaba, Radosław Vehkalahti, Roope Stefanović, Čedomir Tirkkonen, Olav Popovski, Petar Information Theory We study a scenario in which multiple uncoordinated devices aim to achieve reliable transmissions within a given time frame. The devices are intermittently active and access a shared pool of channel resources in a grant-free manner by utilizing multiple transmissions (K-repetition coding). This allows them to achieve diversity and improve the reliability within a certain latency constraint. We focus on two access methods: one where devices choose K slots at random and another one where the access patterns are deterministic and follow a specific code design, namely the Steiner System. We analyze the problem under two signal models that involve different complexity for the receiver. First, collision model is considered, where only interference-free transmissions can be used and combined. Second, a model treating interference as noise is analyzed, where the receiver is capable of utilizing all K replicas, applying maximum ratio combining (MRC). For both signal models, we investigate receivers with and without successive interference cancellation (SIC). We develop approximations and bounds for the outage probabilities that very closely match simulation results. Overall, we show that deterministic access patterns have the potential to significantly outperform random selection in terms of reliability. Furthermore, deterministic access patterns offer a simplified system design. |
| title | Deterministic Patterns for Multiple Access with Latency and Reliability Guarantees |
| topic | Information Theory |
| url | https://arxiv.org/abs/2202.09890 |