Low-complexity sparse-aware multiuser detection for large-scale MIMO systems
Abstract Sparse-aware (SA) detectors have attracted a lot attention due to its significant performance and low-complexity, in particular for large-scale multiple-input multiple-output (MIMO) systems. Similar to the conventional multiuser detectors, the nonlinear or compressive sensing based SA detec...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2021-03-01
|
| Series: | EURASIP Journal on Wireless Communications and Networking |
| Subjects: | |
| Online Access: | https://doi.org/10.1186/s13638-021-01904-8 |
| _version_ | 1829521612066521088 |
|---|---|
| author | Rong Ran Hayoung Oh |
| author_facet | Rong Ran Hayoung Oh |
| author_sort | Rong Ran |
| collection | DOAJ |
| description | Abstract Sparse-aware (SA) detectors have attracted a lot attention due to its significant performance and low-complexity, in particular for large-scale multiple-input multiple-output (MIMO) systems. Similar to the conventional multiuser detectors, the nonlinear or compressive sensing based SA detectors provide the better performance but are not appropriate for the overdetermined multiuser MIMO systems in sense of power and time consumption. The linear SA detector provides a more elegant tradeoff between performance and complexity compared to the nonlinear ones. However, the major limitation of the linear SA detector is that, as the zero-forcing or minimum mean square error detector, it was derived by relaxing the finite-alphabet constraints, and therefore its performance is still sub-optimal. In this paper, we propose a novel SA detector, named single-dimensional search-based SA (SDSB-SA) detector, for overdetermined uplink MIMO systems. The proposed SDSB-SA detector adheres to the finite-alphabet constraints so that it outperforms the conventional linear SA detector, in particular, in high SNR regime. Meanwhile, the proposed detector follows a single-dimensional search manner, so it has a very low computational complexity which is feasible for light-ware Internet of Thing devices for ultra-reliable low-latency communication. Numerical results show that the the proposed SDSB-SA detector provides a relatively better tradeoff between the performance and complexity compared with several existing detectors. |
| first_indexed | 2024-12-16T15:18:19Z |
| format | Article |
| id | doaj.art-a853ad2eb48b4078a779373c8cdd6c98 |
| institution | Directory Open Access Journal |
| issn | 1687-1499 |
| language | English |
| last_indexed | 2024-12-16T15:18:19Z |
| publishDate | 2021-03-01 |
| publisher | SpringerOpen |
| record_format | Article |
| series | EURASIP Journal on Wireless Communications and Networking |
| spelling | doaj.art-a853ad2eb48b4078a779373c8cdd6c982022-12-21T22:26:44ZengSpringerOpenEURASIP Journal on Wireless Communications and Networking1687-14992021-03-012021111510.1186/s13638-021-01904-8Low-complexity sparse-aware multiuser detection for large-scale MIMO systemsRong Ran0Hayoung Oh1Department of Electrical and Computer Engineering, Ajou UniversitySKKU Institute for convergence, Sungkyunkwan UniversityAbstract Sparse-aware (SA) detectors have attracted a lot attention due to its significant performance and low-complexity, in particular for large-scale multiple-input multiple-output (MIMO) systems. Similar to the conventional multiuser detectors, the nonlinear or compressive sensing based SA detectors provide the better performance but are not appropriate for the overdetermined multiuser MIMO systems in sense of power and time consumption. The linear SA detector provides a more elegant tradeoff between performance and complexity compared to the nonlinear ones. However, the major limitation of the linear SA detector is that, as the zero-forcing or minimum mean square error detector, it was derived by relaxing the finite-alphabet constraints, and therefore its performance is still sub-optimal. In this paper, we propose a novel SA detector, named single-dimensional search-based SA (SDSB-SA) detector, for overdetermined uplink MIMO systems. The proposed SDSB-SA detector adheres to the finite-alphabet constraints so that it outperforms the conventional linear SA detector, in particular, in high SNR regime. Meanwhile, the proposed detector follows a single-dimensional search manner, so it has a very low computational complexity which is feasible for light-ware Internet of Thing devices for ultra-reliable low-latency communication. Numerical results show that the the proposed SDSB-SA detector provides a relatively better tradeoff between the performance and complexity compared with several existing detectors.https://doi.org/10.1186/s13638-021-01904-8Multiuser detectorSparse-aware detectorMIMO systems |
| spellingShingle | Rong Ran Hayoung Oh Low-complexity sparse-aware multiuser detection for large-scale MIMO systems EURASIP Journal on Wireless Communications and Networking Multiuser detector Sparse-aware detector MIMO systems |
| title | Low-complexity sparse-aware multiuser detection for large-scale MIMO systems |
| title_full | Low-complexity sparse-aware multiuser detection for large-scale MIMO systems |
| title_fullStr | Low-complexity sparse-aware multiuser detection for large-scale MIMO systems |
| title_full_unstemmed | Low-complexity sparse-aware multiuser detection for large-scale MIMO systems |
| title_short | Low-complexity sparse-aware multiuser detection for large-scale MIMO systems |
| title_sort | low complexity sparse aware multiuser detection for large scale mimo systems |
| topic | Multiuser detector Sparse-aware detector MIMO systems |
| url | https://doi.org/10.1186/s13638-021-01904-8 |
| work_keys_str_mv | AT rongran lowcomplexitysparseawaremultiuserdetectionforlargescalemimosystems AT hayoungoh lowcomplexitysparseawaremultiuserdetectionforlargescalemimosystems |