Near-optimal hybrid precoding for millimeter wave massive MIMO systems via cost-efficient Sub-connected structure

Millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) is a promising technology for next generation wireless communications. The utilisation of traditional full digital precoding techniques for mmWave massive MIMO systems is too costly. Fortunately, the hybrid (analogue/digital) pre...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IET communications Ročník 14; číslo 14; s. 2340 - 2349
Hlavní autori: Huang, Yu, Liu, Chen, Song, Yunchao, Yu, Xiaolei
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: The Institution of Engineering and Technology 25.08.2020
Predmet:
MSE
MSE
ISSN:1751-8628, 1751-8636
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) is a promising technology for next generation wireless communications. The utilisation of traditional full digital precoding techniques for mmWave massive MIMO systems is too costly. Fortunately, the hybrid (analogue/digital) precoding is a better choice. In this study, the authors investigate a near-optimal iterative approximation hybrid precoding algorithm via cost-efficient sub-connected structure for mmWave massive MIMO systems. Based on the minimum mean square error (MSE) criterion, the optimal design of the proposed hybrid precoders is non-convex. The original problem is reformulated as two optimisation sub-problems, where one of the sub-problems is convex and another is non-convex. First, the authors convert the non-convex sub-problem into a convex problem by relaxing the constant modulus constraint from beampattern with interference control method, and eliminating the block diagonal constraint from vector operation with the properties of Kronecker product. Then the two convex sub–problems are solved iteratively. The proposed algorithm can achieve a highly approximate optimal solution, which can be theoretically demonstrated to converge to a Karush-Kuhn-Tucker point of the original problem. Simulation results show that the proposed algorithm via both sub–connected and fully connected structure gets favourable performance in terms of MSE and achievable rate.
ISSN:1751-8628
1751-8636
DOI:10.1049/iet-com.2019.1353