Reliability-Latency-Rate Tradeoff in Low-Latency Communications with Finite-Blocklength Coding
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912101049565184 |
|---|---|
| author | Li, Lintao Chen, Wei Popovski, Petar Letaief, Khaled B. |
| author_facet | Li, Lintao Chen, Wei Popovski, Petar Letaief, Khaled B. |
| contents | Low-latency communication plays an increasingly important role in delay-sensitive applications by ensuring the real-time information exchange. However, due to the constraint on the maximum instantaneous power, guaranteeing bounded latency is challenging. In this paper, we investigate the reliability-latency-rate tradeoff in low-latency communication systems with finite-blocklength coding (FBC). Specifically, we are interested in the fundamental tradeoff between error probability, delay-violation probability (DVP), and service rate. Based on the effective capacity (EC), we present the gain-conservation equations to characterize the reliability-latency-rate tradeoffs in low-latency communication systems. In particular, we investigate the low-latency transmissions over an additive white Gaussian noise (AWGN) channel and a Nakagami-$m$ fading channel. By defining the service rate gain, reliability gain, and real-time gain, we conduct an asymptotic analysis to reveal the fundamental reliability-latency-rate tradeoff of ultra-reliable and low-latency communications in the high signal-to-noise-ratio (SNR) regime. To analytically evaluate and optimize the quality-of-service-constrained throughput of low-latency communication systems adopting FBC, an EC-approximation method is conceived to derive the closed-form expression of that throughput. Our results may offer some insights into the efficient scheduling of low-latency wireless communications, in which statistical latency and reliability metrics are crucial. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_06769 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Reliability-Latency-Rate Tradeoff in Low-Latency Communications with Finite-Blocklength Coding Li, Lintao Chen, Wei Popovski, Petar Letaief, Khaled B. Information Theory Signal Processing Low-latency communication plays an increasingly important role in delay-sensitive applications by ensuring the real-time information exchange. However, due to the constraint on the maximum instantaneous power, guaranteeing bounded latency is challenging. In this paper, we investigate the reliability-latency-rate tradeoff in low-latency communication systems with finite-blocklength coding (FBC). Specifically, we are interested in the fundamental tradeoff between error probability, delay-violation probability (DVP), and service rate. Based on the effective capacity (EC), we present the gain-conservation equations to characterize the reliability-latency-rate tradeoffs in low-latency communication systems. In particular, we investigate the low-latency transmissions over an additive white Gaussian noise (AWGN) channel and a Nakagami-$m$ fading channel. By defining the service rate gain, reliability gain, and real-time gain, we conduct an asymptotic analysis to reveal the fundamental reliability-latency-rate tradeoff of ultra-reliable and low-latency communications in the high signal-to-noise-ratio (SNR) regime. To analytically evaluate and optimize the quality-of-service-constrained throughput of low-latency communication systems adopting FBC, an EC-approximation method is conceived to derive the closed-form expression of that throughput. Our results may offer some insights into the efficient scheduling of low-latency wireless communications, in which statistical latency and reliability metrics are crucial. |
| title | Reliability-Latency-Rate Tradeoff in Low-Latency Communications with Finite-Blocklength Coding |
| topic | Information Theory Signal Processing |
| url | https://arxiv.org/abs/2309.06769 |