Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2212.01736

Help | Advanced Search

Computer Science > Information Theory

arXiv:2212.01736 (cs)
[Submitted on 4 Dec 2022 (v1) , last revised 2 May 2023 (this version, v2)]

Title: Downlink Transmission with Heterogeneous URLLC Services: Discrete Signaling With Single-User Decoding

Title: 下行传输与异构URLLC服务:单用户解码的离散信令

Authors:Min Qiu, Yu-Chih Huang, Jinhong Yuan
Abstract: The problem of designing downlink transmission schemes for supporting heterogeneous ultra-reliable low-latency communications (URLLC) and/or with other types of services is investigated. We consider the broadcast channel, where the base station sends superimposed signals to multiple users. Under heterogeneous blocklength constraints, strong users who are URLLC users cannot wait to receive the entire transmission frame and perform successive interference cancellation (SIC) due to stringent latency requirements, in contrast to the conventional infinite blocklength cases. Even if SIC is feasible, SIC may be imperfect under finite blocklength constraints. To cope with the heterogeneity in latency and reliability requirements, we propose a practical downlink transmission scheme with discrete signaling and single-user decoding (SUD), i.e., without SIC. We carefully design the discrete input distributions to enable efficient SUD by exploiting the structural interference. Furthermore, we derive the second-order achievable rate under heterogenous blocklength and error probability constraints and use it to guide the design of channel coding and modulations. It is shown that in terms of achievable rate under short blocklength, the proposed scheme with regular quadrature amplitude modulations and SUD can operate extremely close to the benchmark schemes that assume perfect SIC with Gaussian signaling.
Abstract: 设计用于支持异构超可靠低延迟通信(URLLC)和/或其他类型服务的下行链路传输方案的问题得到了研究。 我们考虑广播信道,其中基站向多个用户发送叠加信号。 在异构码长约束下,强用户(即URLLC用户)由于严格的时延要求,不能等待接收整个传输帧并执行连续干扰消除(SIC),这与传统的无限码长情况相反。 即使SIC是可行的,在有限码长约束下SIC可能不完美。 为了应对时延和可靠性要求的异构性,我们提出了一种具有离散信号和单用户解码(SUD)的实用下行链路传输方案,即没有SIC。 我们仔细设计了离散输入分布,以利用结构干扰实现高效的SUD。 此外,我们推导了在异构码长和误码概率约束下的二阶可实现速率,并用它来指导信道编码和调制的设计。 结果表明,在短码长条件下,采用常规正交幅度调制和SUD的所提方案可以非常接近假设完美SIC和高斯信号的基准方案。
Comments: 16 pages, 7 figures, accepted by IEEE Journal on Selected Areas in Communications
Subjects: Information Theory (cs.IT) ; Signal Processing (eess.SP)
Cite as: arXiv:2212.01736 [cs.IT]
  (or arXiv:2212.01736v2 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2212.01736
arXiv-issued DOI via DataCite

Submission history

From: Min Qiu [view email]
[v1] Sun, 4 Dec 2022 04:00:19 UTC (824 KB)
[v2] Tue, 2 May 2023 13:18:50 UTC (794 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2022-12
Change to browse by:
cs
eess
eess.SP
math
math.IT

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

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

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

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.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号