For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Low-Complexity Detection Based on Landweber Method in the Uplink of Massive MIMO Systems
Xu BAO Wence ZHANG Jisheng DAI Jianxin DAI
IEICE TRANSACTIONS on Communications
Publication Date: 2018/11/01
Online ISSN: 1745-1345
Type of Manuscript: PAPER
Category: Wireless Communication Technologies
massive MIMO, uplink detection, Landweber method, low complexity,
Full Text: PDF(1.4MB)
>>Buy this Article
In this paper, we devise low-complexity uplink detection algorithms for Massive MIMO systems. We treat the uplink detection as an ill-posed problem and adopt the Landweber Method to solve it. In order to reduce the computational complexity and increase the convergence rate, we propose improved Landweber Method with optimal relax factor (ILM-O) algorithm. In addition, to reduce the order of Landweber Method by introducing a set of coefficients, we propose reduced order Landweber Method (ROLM) algorithm. An analysis on the convergence and the complexity is provided. Numerical results demonstrate that the proposed algorithms outperform the existing algorithm.