z-logo
open-access-imgOpen Access
Coordinated multicell beamforming for massive multiple‐input multiple‐output systems based on uplink–downlink duality
Author(s) -
He Shiwen,
Huang Yongming,
Shi Yanru,
Qi Chenhao,
Jin Shi,
Yang Luxi
Publication year - 2016
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2015.1045
Subject(s) - beamforming , telecommunications link , computer science , mathematical optimization , backhaul (telecommunications) , base station , signal to interference plus noise ratio , wsdma , precoding , mathematics , power (physics) , telecommunications , mimo , physics , quantum mechanics
This paper studies joint beamforming and power allocation for multicell multiuser multi‐antenna systems with the objective of maximising the minimum signal‐to‐interference‐plus‐noise ratio (max–min SINR). The authors first consider developing an iterative algorithm to achieve the optimal performance by extending the uplink–downlink duality for finite‐scale wireless communication systems. The solution is then generalised to achieve the asymptotically optimal multicell beamforming with the aim to reduce the overhead of signalling exchange between coordinated base stations based on large dimension random matrix theory. Based on that, an efficient multicell beamforming algorithm is proposed to asymptotically achieve the max–min SINR. To further solve the complexity issue of large dimensional matrix inversion involved in the calculation of beamforming vectors, they propose a low‐complexity beamforming calculator based on truncated polynomial expansion approach. Numerical results validate the effectiveness of the authors’ proposed algorithms and show that they can achieve the optimal or asymptotically optimal performance in a massive multi‐input multi‐output system with low complexity and small backhaul overhead.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here