.png){kind=icon}
Return
Low-Complexity SSOR-Based Precoding for Massive MIMO Systems
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2016.2525807.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
With the increase of the number of base station (BS) antennas in massive multiple-input multiple-output (MIMO) systems, linear precoding schemes are able to achieve the near-optimal performance, and thus are more attractive than nonlinear precoding techniques. However, conventional linear precoding schemes such as zero-forcing (ZF) precoding involve the matrix inversion of large size with high computational complexity, especially in massive MIMO systems. To reduce the complexity, in this letter, we propose a low-complexity linear precoding scheme based on the symmetric successive over relaxation (SSOR) method. Moreover, we propose a simple way to approximate the optimal relaxation parameter of the SSOR-based precoding by exploiting the channel property of asymptotical orthogonality in massive MIMO systems. We show that the proposed SSOR-based precoding can reduce the complexity of the classical ZF precoding by about one order of magnitude without performance loss, and it also outperforms the recently proposed linear approximate precoding schemes in typical fading channels.
Keywords:
Massive multiple-input multiple-output (MIMO)
linear precoding
SSOR method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSaveUsing satellite data and deep learning to estimate educational outcomes in data-sparse environments
PREAI
ShareSave
ShareSave
View more