Efficient detection technique in a MIMO system using the received signal compensation algorithm
Abstract In this article, we address the problem of improving the performance of linear detection techniques to satisfy the growing demand for bandwidth for multiuser multimedia applications. Specifically, the technical performance of linear detection in spatial multiplexing should be improved, foll...
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer
2025-07-01
|
| Series: | Discover Applied Sciences |
| Subjects: | |
| Online Access: | https://doi.org/10.1007/s42452-025-07402-6 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Abstract In this article, we address the problem of improving the performance of linear detection techniques to satisfy the growing demand for bandwidth for multiuser multimedia applications. Specifically, the technical performance of linear detection in spatial multiplexing should be improved, followed by the reception of the downlink signal. This article proposes a coupling of the algorithm for power compensation of received signals between zero forcing (ZF) and the minimum mean square error (MMSE) associated with the technique of successive interference cancellation (SIC) and a sorting system (Sort) without increasing complexity. Thus, we propose the assumptions of coupling and performance evaluation. The results were obtained for three configurations of multiple input multiple output antennas with binary phase-shift keying (BPSK) modulation via MATLAB 2020 software. The results showed that the use of ZF-SIC-Sort or MMSE-SIC-Sort in combination with the algorithm for compensating for the power of the received signals was a better compromise between the bit error rate (BER) and signal-to-noise ratio (SNR). The proposed method yields better performance for an SNR of approximately 0 dB and a BER $$\ge 10^{ - 2}$$ ; this approach has potential for future use in new generation networks. |
|---|---|
| ISSN: | 3004-9261 |