Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant 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 41 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 21 tok/s Pro
GPT-5 High 20 tok/s Pro
GPT-4o 91 tok/s Pro
Kimi K2 178 tok/s Pro
GPT OSS 120B 474 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
2000 character limit reached

A Lightweight Machine Learning Assisted Power Optimization for Minimum Error in NOMA-CRS over Nakagami-$m$ channels (2108.12591v1)

Published 28 Aug 2021 in cs.IT and math.IT

Abstract: Non-orthogonal multiple access based cooperative relaying system (NOMA-CRS) has been proposed to alleviate the decay in spectral efficiency of the conventional CRS. However, existing NOMA-CRS studies assume perfect successive interference canceler at the relay and mostly investigate sum-rate whereas the error performance has not been taken into consideration. In this paper, we analyze error performance of the NOMA-CRS and the closed-form bit error probability (BEP) expression is derived over Nakagami-m fading channels. Then, thanks to the high performance of ML in challenging optimization problems, a joint power sharing-power allocation (PS-PA) scheme is proposed to minimize the bit error rate (BER) of the NOMA-CRS. The proposed ML-assisted optimization has a very low online implementation complexity. Based on provided extensive simulations, theoretical BEP analysis is validated. Besides, the proposed ML-aided PS-PA provides minimum BER (MBER) and outperforms previous PA strategies for the NOMA-CRS notably.

Citations (4)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

Summary

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

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

Follow-Up Questions

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