Computer Science > Information Theory
[Submitted on 16 Sep 2021 (v1), last revised 14 Jun 2022 (this version, v2)]
Title:Gaussian Broadcast Channels under Heterogeneous Blocklength Constraints
View PDFAbstract:Future wireless access networks aim to simultaneously support a large number of devices with heterogeneous service requirements, including data rates, error rates, and latencies. While achievable rate and capacity results exist for Gaussian broadcast channels in the asymptotic blocklength regime, the characterization of second-order achievable rate regions for heterogeneous blocklength constraints is not available. Therefore, we investigate a two-user Gaussian broadcast channel (GBC) with heterogeneous blocklength constraints, specified according to users' channel output signal-to-noise ratios (SNRs). We assume the user with higher output SNR has a shorter blocklength constraint. We show that with sufficiently large output SNR, the stronger user can perform the \textit{early decoding} (ED) technique to decode and subtract the interference via successive interference cancellation (SIC). To achieve it, we derive an explicit lower bound on the necessary number of received symbols for a successful ED, using an independent and identically distributed Gaussian input. A second-order rate of the weaker user who suffers from an SNR change due to the heterogeneous blocklength constraint, is also derived. Numerical results show that ED can outperform the hybrid non-orthogonal multiple access scheme when the stronger channel is sufficiently better than the weaker one. Under the considered setting, about 7-dB SNR gain can be achieved. These results shows that ED with SIC is a promising technique for the future wireless networks.
Submission history
From: Pin-Hsun Lin [view email][v1] Thu, 16 Sep 2021 07:26:03 UTC (524 KB)
[v2] Tue, 14 Jun 2022 06:49:46 UTC (501 KB)
Current browse context:
cs.IT
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.