Forward-Reverse Orthogonal Matching Pursuit-Union-Subspace Pursuit-Based Multiuser Detector for Uplink Grant-Free NOMA Networks
Multiuser Detection (MUD) is quite challenging in uplink grant-free non-orthogonal multiple access wireless communication networks in which users sporadically transmit data. The reason for this is that the base station (BS) must perform detection of both multiuser activity and user signals concurren...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-12-01
|
| Series: | Electronics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2079-9292/11/1/125 |
| _version_ | 1797499208376254464 |
|---|---|
| author | Olutayo Oyeyemi Oyerinde |
| author_facet | Olutayo Oyeyemi Oyerinde |
| author_sort | Olutayo Oyeyemi Oyerinde |
| collection | DOAJ |
| description | Multiuser Detection (MUD) is quite challenging in uplink grant-free non-orthogonal multiple access wireless communication networks in which users sporadically transmit data. The reason for this is that the base station (BS) must perform detection of both multiuser activity and user signals concurrently, because knowledge of user activity status is not available at the BS. In this paper, a new multiuser detector, named the Forward-Reverse Orthogonal Matching Pursuit–Union–Subspace pursuit (FROMPUS)-based MUD, is proposed. The detector takes advantage of the concept of an initial support set. This serves as initial knowledge that is then employed in the reconstruction of active users’ signals. In addition, the detector uses the “serial-include” technique of incorporating a likely support set element candidates and a reliability testing procedure in which the most prominent elements of the support set are selected. To assess the performance of the proposed detector, computer simulations are performed. The results obtained for various parameter settings show that the FROMPUS performs better than any of the other five detectors considered in this paper. However, this excellent performance comes with a slightly higher computational complexity cost. Nonetheless, the cost is inconsequential, since the detector operates at the BS where complexity is of low priority in comparison to performance. |
| first_indexed | 2024-03-10T03:44:10Z |
| format | Article |
| id | doaj.art-26c3d32e0e7c4a0b96d3c7e11f76b4fb |
| institution | Directory Open Access Journal |
| issn | 2079-9292 |
| language | English |
| last_indexed | 2024-03-10T03:44:10Z |
| publishDate | 2021-12-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Electronics |
| spelling | doaj.art-26c3d32e0e7c4a0b96d3c7e11f76b4fb2023-11-23T11:23:17ZengMDPI AGElectronics2079-92922021-12-0111112510.3390/electronics11010125Forward-Reverse Orthogonal Matching Pursuit-Union-Subspace Pursuit-Based Multiuser Detector for Uplink Grant-Free NOMA NetworksOlutayo Oyeyemi Oyerinde0School of Electrical and Information Engineering, University of the Witwatersrand, Johannesburg 2050, South AfricaMultiuser Detection (MUD) is quite challenging in uplink grant-free non-orthogonal multiple access wireless communication networks in which users sporadically transmit data. The reason for this is that the base station (BS) must perform detection of both multiuser activity and user signals concurrently, because knowledge of user activity status is not available at the BS. In this paper, a new multiuser detector, named the Forward-Reverse Orthogonal Matching Pursuit–Union–Subspace pursuit (FROMPUS)-based MUD, is proposed. The detector takes advantage of the concept of an initial support set. This serves as initial knowledge that is then employed in the reconstruction of active users’ signals. In addition, the detector uses the “serial-include” technique of incorporating a likely support set element candidates and a reliability testing procedure in which the most prominent elements of the support set are selected. To assess the performance of the proposed detector, computer simulations are performed. The results obtained for various parameter settings show that the FROMPUS performs better than any of the other five detectors considered in this paper. However, this excellent performance comes with a slightly higher computational complexity cost. Nonetheless, the cost is inconsequential, since the detector operates at the BS where complexity is of low priority in comparison to performance.https://www.mdpi.com/2079-9292/11/1/125NOMAuplink grant freecompressive sensinggreedy algorithmsmultiuser detector5G |
| spellingShingle | Olutayo Oyeyemi Oyerinde Forward-Reverse Orthogonal Matching Pursuit-Union-Subspace Pursuit-Based Multiuser Detector for Uplink Grant-Free NOMA Networks Electronics NOMA uplink grant free compressive sensing greedy algorithms multiuser detector 5G |
| title | Forward-Reverse Orthogonal Matching Pursuit-Union-Subspace Pursuit-Based Multiuser Detector for Uplink Grant-Free NOMA Networks |
| title_full | Forward-Reverse Orthogonal Matching Pursuit-Union-Subspace Pursuit-Based Multiuser Detector for Uplink Grant-Free NOMA Networks |
| title_fullStr | Forward-Reverse Orthogonal Matching Pursuit-Union-Subspace Pursuit-Based Multiuser Detector for Uplink Grant-Free NOMA Networks |
| title_full_unstemmed | Forward-Reverse Orthogonal Matching Pursuit-Union-Subspace Pursuit-Based Multiuser Detector for Uplink Grant-Free NOMA Networks |
| title_short | Forward-Reverse Orthogonal Matching Pursuit-Union-Subspace Pursuit-Based Multiuser Detector for Uplink Grant-Free NOMA Networks |
| title_sort | forward reverse orthogonal matching pursuit union subspace pursuit based multiuser detector for uplink grant free noma networks |
| topic | NOMA uplink grant free compressive sensing greedy algorithms multiuser detector 5G |
| url | https://www.mdpi.com/2079-9292/11/1/125 |
| work_keys_str_mv | AT olutayooyeyemioyerinde forwardreverseorthogonalmatchingpursuitunionsubspacepursuitbasedmultiuserdetectorforuplinkgrantfreenomanetworks |