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

Lin Shao and Yunxiao Zu

Mathematical Problems in Engineering, 2016, vol. 2016, 1-5

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.

Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2016/1745808.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2016/1745808.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:1745808

DOI: 10.1155/2016/1745808

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().