A signal detection algorithm based on chebyshev accelerated symmetrical successive over-relaxation iteration for massive MIMO system

Author(s):  
Xiaoxiang Liu ◽  
Jing Zhang
Electronics ◽  
2021 ◽  
Vol 10 (5) ◽  
pp. 578
Author(s):  
Robin Chataut ◽  
Robert Akl ◽  
Utpal Kumar Dey ◽  
Mohammadreza Robaei

With the limitedness of the sub-6 GHz bandwidth, the world is exploring a thrilling wireless technology known as massive MIMO. This wireless access technology is swiftly becoming key for 5G, B5G, and 6G network deployment. The massive MIMO system brings together antennas at both base stations and the user terminals to provide high spectral service. Despite the fact that massive MIMO offers astronomical benefits such as low latency, high data rate, improved array gain, and far better reliability, it faces several implementation challenges due to the hundreds of antennas at the base station. The signal detection at the base station during the uplink is one of the critical issues in this technology. Detection of user signal becomes computationally complex with a multitude of antennas present in the massive MIMO systems. This paper proposes a novel preconditioned and accelerated Gauss–Siedel algorithm referred to as Symmetric Successive Over-relaxation Preconditioned Gauss-Seidel (SSORGS). The proposed algorithm will address the signal detection challenges associated with massive MIMO technology. Furthermore, we enhance the convergence rate of the proposed algorithm by introducing a novel Symmetric Successive Over-relaxation preconditioner (SSOR) scheme and an initialization scheme based on the instantaneous channel condition between the base station and the user. The simulation results show that the proposed algorithm referred to as Symmetric Successive Over-relaxation Preconditioned Gauss-Seidel (SSORGS) provides optimal BER performance. At BER =10−3, over the range of SNR, the SSORGS algorithm performs better than the traditional algorithms. Additionally, the proposed algorithm is computationally more efficient than the traditional algorithms. Furthermore, we designed a comprehensive hardware architecture for the SSORGS algorithm to find the interrelated components necessary to build the actual physical system.


2019 ◽  
Vol 12 (20) ◽  
pp. 1-10
Author(s):  
M. Kasiselvanathan ◽  
N. Sathish Kumar ◽  
◽  

2019 ◽  
Vol 2019 ◽  
pp. 1-12
Author(s):  
Thanh-Binh Nguyen ◽  
Minh-Tuan Le ◽  
Vu-Duc Ngo

In this paper, a parallel group detection (PGD) algorithm is proposed in order to address the degradation in the bit error rate (BER) performance of linear detectors when they are used in high-load massive MIMO systems. The algorithm is constructed by converting the equivalent extended massive MIMO system into two subsystems, which can be simultaneously detected by the classical detection procedures. Then, using the PGD and the classical ZF as well as the QR-decomposition- (QRD-) based detectors, we proposed two new detectors, called ZF-based PGD (ZF-PGD) and QRD-based PGD (QRD-PGD). The PGD is further combined with the sorted longest basis (SLB) algorithm to make the signal recovery more accurate, thereby resulting in two new detectors, namely, the ZF-PGD-SLB and the QRD-PGD-SLB. Various complexity evaluations and simulations prove that the proposed detectors can significantly improve the BER performance compared to their classical linear and QRD counterparts with the practical complexity levels. Hence, our proposed detectors can be used as efficient means of estimating the transmitted signals in high-load massive MIMO systems.


Sign in / Sign up

Export Citation Format

Share Document