Name
Title | ||
|---|---|---|
Investigation On Non-Orthogonal Multiple Access With Reduced Complexity Maximum Likelihood Receiver And Dynamic Resource Allocation |
Abstract | ||
|---|---|---|
Non-orthogonal multiple access (NOMA) is a promising multiple access scheme for further improving the spectrum efficiency compared to orthogonal multiple access (OMA) in the 5th Generation (5G) mobile communication systems. As inter-user interference cancellers for NOMA, two kinds of receiver structures are considered. One is the reduced complexity-maximum likelihood receiver (R-ML) and the other is the codeword level interference canceller (CWIC). In this paper, we show that the R-ML is superior to the CWIC in terms of scheduling flexibility. In addition, we propose a link to system (L2S) mapping scheme for the R-ML to conduct a system level evaluation, and show that the proposed scheme accurately predicts the block error rate (BLER) performance of the R-ML. The proposed L2S mapping scheme also demonstrates that the system level throughput performance of the R-ML is higher than that for the CWIC thanks to the scheduling flexibility. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1587/transcom.2016FGP0024 | IEICE TRANSACTIONS ON COMMUNICATIONS |
Keywords | Field | DocType |
non-orthogonal multiple access, reduced complexity-maximum likelihood receiver, link to system mapping, user scheduling | Mathematical optimization,Computer science,Maximum likelihood,Resource allocation,Distributed computing | Journal |
Volume | Issue | ISSN |
E100B | 8 | 0916-8516 |
Citations | PageRank | References |
0 | 0.34 | 10 |
Authors | ||
9 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yousuke Sano | 1 | 3 | 1.51 |
| Kazuaki Takeda | 2 | 188 | 25.92 |
| Satoshi Nagata | 3 | 627 | 53.40 |
| Takehiro Nakamura | 4 | 969 | 75.38 |
| Xiaohang Chen | 5 | 0 | 0.34 |
| Anxin Li | 6 | 582 | 42.97 |
| X. Zhang | 7 | 190 | 43.25 |
| Huiling Jiang | 8 | 1 | 1.16 |
| Kazuhiko Fukawa | 9 | 212 | 39.25 |