Capacity-achieving MIMO-NOMA : iterative LMMSE detection
This paper considers a low-complexity iterative Linear Minimum Mean Square Error (LMMSE) multi-user detector for the Multiple-Input and Multiple-Output system with Non-Orthogonal Multiple Access (MIMO-NOMA), where multiple single-antenna users simultaneously communicate with a multiple-antenna ba...
Saved in:
Main Authors: | , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/137251 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-137251 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1372512020-03-11T07:36:52Z Capacity-achieving MIMO-NOMA : iterative LMMSE detection Liu, Lei Chi, Yuhao Yuen, Chau Guan, Yong Liang Li, Ying School of Electrical and Electronic Engineering Engineering::Electrical and electronic engineering Detectors MIMO-NOMA This paper considers a low-complexity iterative Linear Minimum Mean Square Error (LMMSE) multi-user detector for the Multiple-Input and Multiple-Output system with Non-Orthogonal Multiple Access (MIMO-NOMA), where multiple single-antenna users simultaneously communicate with a multiple-antenna base station (BS). While LMMSE being a linear detector has a low complexity, it has suboptimal performance in multi-user detection scenario due to the mismatch between LMMSE detection and multi-user decoding. Therefore, in this paper, we provide the matching conditions between the detector and decoders for MIMO-NOMA, which are then used to derive the achievable rate of the iterative detection. We prove that a matched iterative LMMSE detector can achieve (i) the optimal capacity of symmetric MIMO-NOMA with any number of users, (ii) the optimal sum capacity of asymmetric MIMO-NOMA with any number of users, (iii) all the maximal extreme points in the capacity region of asymmetric MIMO-NOMA with any number of users, (iv) all points in the capacity region of two-user and three-user asymmetric MIMO-NOMA systems. In addition, a kind of practical low-complexity error-correcting multiuser code, called irregular repeat-accumulate code, is designed to match the LMMSE detector. Numerical results shows that the bit error rate performance of the proposed iterative LMMSE detection outperforms the state-of-art methods and is within 0.8dB from the associated capacity limit. Accepted version 2020-03-11T07:36:52Z 2020-03-11T07:36:52Z 2019 Journal Article Liu, L., Chi, Y., Yuen, C., Guan, Y. L., & Li, Y. (2019). Capacity-achieving MIMO-NOMA : iterative LMMSE detection. IEEE Transactions on Signal Processing, 67(7), 1758–1773. doi:10.1109/TSP.2019.2896242 1053-587X https://hdl.handle.net/10356/137251 10.1109/TSP.2019.2896242 2-s2.0-85061032122 7 67 1758 1773 en IEEE Transactions on Signal Processing © 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: https://doi.org/10.1109/TSP.2019.2896242. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
country |
Singapore |
collection |
DR-NTU |
language |
English |
topic |
Engineering::Electrical and electronic engineering Detectors MIMO-NOMA |
spellingShingle |
Engineering::Electrical and electronic engineering Detectors MIMO-NOMA Liu, Lei Chi, Yuhao Yuen, Chau Guan, Yong Liang Li, Ying Capacity-achieving MIMO-NOMA : iterative LMMSE detection |
description |
This paper considers a low-complexity iterative Linear Minimum Mean Square
Error (LMMSE) multi-user detector for the Multiple-Input and Multiple-Output
system with Non-Orthogonal Multiple Access (MIMO-NOMA), where multiple
single-antenna users simultaneously communicate with a multiple-antenna base
station (BS). While LMMSE being a linear detector has a low complexity, it has
suboptimal performance in multi-user detection scenario due to the mismatch
between LMMSE detection and multi-user decoding. Therefore, in this paper, we
provide the matching conditions between the detector and decoders for
MIMO-NOMA, which are then used to derive the achievable rate of the iterative
detection. We prove that a matched iterative LMMSE detector can achieve (i) the
optimal capacity of symmetric MIMO-NOMA with any number of users, (ii) the
optimal sum capacity of asymmetric MIMO-NOMA with any number of users, (iii)
all the maximal extreme points in the capacity region of asymmetric MIMO-NOMA
with any number of users, (iv) all points in the capacity region of two-user
and three-user asymmetric MIMO-NOMA systems. In addition, a kind of practical
low-complexity error-correcting multiuser code, called irregular
repeat-accumulate code, is designed to match the LMMSE detector. Numerical
results shows that the bit error rate performance of the proposed iterative
LMMSE detection outperforms the state-of-art methods and is within 0.8dB from
the associated capacity limit. |
author2 |
School of Electrical and Electronic Engineering |
author_facet |
School of Electrical and Electronic Engineering Liu, Lei Chi, Yuhao Yuen, Chau Guan, Yong Liang Li, Ying |
format |
Article |
author |
Liu, Lei Chi, Yuhao Yuen, Chau Guan, Yong Liang Li, Ying |
author_sort |
Liu, Lei |
title |
Capacity-achieving MIMO-NOMA : iterative LMMSE detection |
title_short |
Capacity-achieving MIMO-NOMA : iterative LMMSE detection |
title_full |
Capacity-achieving MIMO-NOMA : iterative LMMSE detection |
title_fullStr |
Capacity-achieving MIMO-NOMA : iterative LMMSE detection |
title_full_unstemmed |
Capacity-achieving MIMO-NOMA : iterative LMMSE detection |
title_sort |
capacity-achieving mimo-noma : iterative lmmse detection |
publishDate |
2020 |
url |
https://hdl.handle.net/10356/137251 |
_version_ |
1681043715266707456 |