Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 134 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 27 tok/s Pro
GPT-5 High 22 tok/s Pro
GPT-4o 84 tok/s Pro
Kimi K2 195 tok/s Pro
GPT OSS 120B 433 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Error Probability Analysis of NOMA-based Diamond Relaying Network (2001.03323v1)

Published 10 Jan 2020 in cs.IT and math.IT

Abstract: Non-orthogonal multiple access (NOMA)-based cooperative relaying systems (CRS) are very promising to overcome spectral inefficiency of conventional cooperative communications. Although NOMA-CRS have great recent attention, almost all studies investigate NOMA-CRS only in terms of capacity and outage probability. Error performances of NOMA-CRS have not been well-studied. In this paper, we analyze error performance of NOMA-based diamond relaying network (NOMA-DRN) with imperfect successive interference canceler (SIC) as a NOMA-CRS scheme. We derive exact bit error probability (BEP) for NOMA-DRN and provide a tight approximated BEP in the closed-form. In addition, high-SNR analysis is conducted to present that NOMA-DRN has an error floor. Moreover, it is proved that NOMA-DRN turns out to be a non-equiprobable communication system and we derive priori probabilities of symbols. All derived expressions are validated via computer simulations.

Citations (33)

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.