Nothing Special   »   [go: up one dir, main page]
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:2209.11387 (cs)
[Submitted on 23 Sep 2022]

Title:Achievable Diversity Order of HARQ-Aided Downlink NOMA Systems

Authors:Zheng Shi, Chenmeng Zhang, Yaru Fu, Hong Wang, Guanghua Yang, Shaodan Ma
View PDF
Abstract:The combination between non-orthogonal multiple access (NOMA) and hybrid automatic repeat request (HARQ) is capable of realizing ultra-reliability, high throughput and many concurrent connections particularly for emerging communication systems. This paper focuses on characterizing the asymptotic scaling law of the outage probability of HARQ-aided NOMA systems with respect to the transmit power, i.e., diversity order. The analysis of diversity order is carried out for three basic types of HARQ-aided downlink NOMA systems, including Type I HARQ, HARQ with chase combining (HARQ-CC) and HARQ with incremental redundancy (HARQ-IR). The diversity orders of three HARQ-aided downlink NOMA systems are derived in closed-form, where an integration domain partition trick is developed to obtain the bounds of the outage probability specially for HARQ-CC and HARQ-IR-aided NOMA systems. The analytical results show that the diversity order is a decreasing step function of transmission rate, and full time diversity can only be achieved under a sufficiently low transmission rate. It is also revealed that HARQ-IR-aided NOMA systems have the largest diversity order, followed by HARQ-CC-aided and then Type I HARQ-aided NOMA systems. Additionally, the users' diversity orders follow a descending order according to their respective average channel gains. Furthermore, we expand discussions on the cases of power-efficient transmissions and imperfect channel state information (CSI). Monte Carlo simulations finally confirm our analysis.
Subjects: Information Theory (cs.IT)
Cite as: arXiv:2209.11387 [cs.IT]
  (or arXiv:2209.11387v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2209.11387

Submission history

From: Zheng Shi [view email]
[v1] Fri, 23 Sep 2022 03:33:21 UTC (4,405 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2022-09
Change to browse by:
cs
math
math.IT

References & Citations

export BibTeX citation

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?)

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?)