Joint Newton Iteration and Neumann Series Method of Convergence-Accelerating Matrix Inversion Approximation in Linear Precoding for Massive MIMO Systems

14Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Due to large numbers of antennas and users, matrix inversion is complicated in linear precoding techniques for massive MIMO systems. Several approximated matrix inversion methods, including the Neumann series, have been proposed to reduce the complexity. However, the Neumann series does not converge fast enough. In this paper, to speed up convergence, a new joint Newton iteration and Neumann series method is proposed, with the first iteration result of Newton iteration method being employed to reconstruct the Neumann series. Then, a high probability convergence condition is established, which can offer useful guidelines for practical massive MIMO systems. Finally, simulation examples are given to demonstrate that the new joint Newton iteration and Neumann series method has a faster convergence rate compared to the previous Neumann series, with almost no increase in complexity when the iteration number is greater than or equal to 2.

Cite

CITATION STYLE

APA

Shao, L., & Zu, Y. (2016). Joint Newton Iteration and Neumann Series Method of Convergence-Accelerating Matrix Inversion Approximation in Linear Precoding for Massive MIMO Systems. Mathematical Problems in Engineering, 2016. https://doi.org/10.1155/2016/1745808

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free