期刊
SYMMETRY-BASEL
卷 12, 期 2, 页码 -出版社
MDPI
DOI: 10.3390/sym12020306
关键词
5G; Massive MIMO; iterative methods; stair matrix; Neumann series; successive overrelaxation; Gauss-Seidel; Jacobi
资金
- Research Council (TRC) of the Sultanate of Oman under the Block Funding Program
- TRC Block Funding Agreement [BFP/RGP/ICT/18/079]
- Research Program through the National Research Foundation of Korea [NRF-2019R1A2C1005920]
Fifth-generation (5G) communications system is commercially introduced by several mobile operators where sub-6 GHz bands are the backbone of the 5G networks. A large-scale multiple-input multiple-output (MIMO), or massive MIMO (mMIMO), technology has a major impact to secure high data rate, high spectral efficiency, and quality of service (QoS). It could also have a major role in the beyond-5G systems. A massive number of antennas seek advanced signal processing to detect and equalize the signal. However, optimal detectors, such as the maximum likelihood (ML) and maximum posterior (MAP), are not desirable in implementation due to extremely high complexity. Therefore, sub-optimum solutions have been introduced to obtain and guarantee enough balance between the performance and the computational complexity. In this paper, a robust and joint low complexity detection algorithm is proposed based on the Jacobi (JA) and Gauss-Seidel (GS) methods. In such iterative methods, the performance, complexity, and convergence rate are highly dependent on the initial vector. In this paper, initial solution is proposed by exploiting the benefits of a stair matrix to obtain a fast convergence rate, high performance, and low complexity. Numerical results show that proposed algorithm achieves high accuracy and relieve the computational complexity even when the BS-to-user-antenna ratio (BUAR) is small.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据