Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2401.15056 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909083673559040 |
|---|---|
| author | Kaleem, Muhammad Ahmad Facenda, Gustavo Kasper Khisti, Ashish |
| author_facet | Kaleem, Muhammad Ahmad Facenda, Gustavo Kasper Khisti, Ashish |
| contents | This paper investigates adaptive streaming codes over a three-node relayed network. In this setting, a source transmits a sequence of message packets through a relay under a delay constraint of $T$ time slots per packet. The source-to-relay and relay-to-destination links are unreliable and introduce a maximum of $N_1$ and $N_2$ packet erasures respectively. Recent work has proposed adaptive (time variant) and nonadaptive (time invariant) code constructions for this setting and has shown that adaptive codes can achieve higher rates. However, the adaptive construction deals with many possibilities, leading to an impractical code with very large block lengths. In this work, we propose a simplified adaptive code construction which greatly improves the practicality of the code, with only a small cost to the achievable rates. We analyze the construction in terms of the achievable rates and field size requirements, and perform numerical simulations over statistical channels to estimate packet loss probabilities. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_15056 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Subset Adaptive Relaying for Streaming Erasure Codes Kaleem, Muhammad Ahmad Facenda, Gustavo Kasper Khisti, Ashish Information Theory This paper investigates adaptive streaming codes over a three-node relayed network. In this setting, a source transmits a sequence of message packets through a relay under a delay constraint of $T$ time slots per packet. The source-to-relay and relay-to-destination links are unreliable and introduce a maximum of $N_1$ and $N_2$ packet erasures respectively. Recent work has proposed adaptive (time variant) and nonadaptive (time invariant) code constructions for this setting and has shown that adaptive codes can achieve higher rates. However, the adaptive construction deals with many possibilities, leading to an impractical code with very large block lengths. In this work, we propose a simplified adaptive code construction which greatly improves the practicality of the code, with only a small cost to the achievable rates. We analyze the construction in terms of the achievable rates and field size requirements, and perform numerical simulations over statistical channels to estimate packet loss probabilities. |
| title | Subset Adaptive Relaying for Streaming Erasure Codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2401.15056 |