On BER for Low Complexity Non-SIC NOMA with M-User 


Vol. 45,  No. 9, pp. 1555-1561, Sep.  2020
10.7840/kics.2020.45.9.1555


PDF Full-Text
  Abstract

In non-orthogonal multiple access (NOMA), one of factors for implementation complexity is successive interference cancellation (SIC), which is essential for each user to operate at quality of service (QoS). In this letter, we consider the NOMA scheme with M-user, without the SIC complexity. First, we derive the closed-form BER expression. Then it is shown that the non-SIC NOMA BER is comparable to the SIC NOMA BER. This can be possible, with two reasons; one is the power allocation of the user fairness, and the other is the optimal maximum-likelihood (ML) detection.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

K. Chung, "On BER for Low Complexity Non-SIC NOMA with M-User," The Journal of Korean Institute of Communications and Information Sciences, vol. 45, no. 9, pp. 1555-1561, 2020. DOI: 10.7840/kics.2020.45.9.1555.

[ACM Style]

Kyuhyuk Chung. 2020. On BER for Low Complexity Non-SIC NOMA with M-User. The Journal of Korean Institute of Communications and Information Sciences, 45, 9, (2020), 1555-1561. DOI: 10.7840/kics.2020.45.9.1555.

[KICS Style]

Kyuhyuk Chung, "On BER for Low Complexity Non-SIC NOMA with M-User," The Journal of Korean Institute of Communications and Information Sciences, vol. 45, no. 9, pp. 1555-1561, 9. 2020. (https://doi.org/10.7840/kics.2020.45.9.1555)

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880