H. Asgharimoghaddam, A. Tölli, L. Sanguinetti and M. Debbah, "Decentralizing Multicell Beamforming via Deterministic Equivalents," in IEEE Transactions on Communications, vol. 67, no. 3, pp. 1894-1909, March 2019. doi: 10.1109/TCOMM.2018.2883445
Decentralizing multicell beamforming via deterministic equivalents
|Author:||Asgharimoghaddam, Hossein1; Tölli, Antti1; Sanguinetti, Luca2,3;|
1Centre for Wireless Communications, University of Oulu, 90014 Oulu, Finland
2Dipartimento di Ingegneria dell’Informazione, University of Pisa, 56126 Pisa, Italy
3Large Systems and Networks Group, CentraleSupélec, Université Paris-Saclay, 91192 Gif-sur-Yvette, France
4Mathematical and Algorithmic Sciences Lab, Huawei Technologies Co. Ltd., 92100 Boulogne-Billancourt, France
|Online Access:||PDF Full Text (PDF, 0.8 MB)|
|Persistent link:|| http://urn.fi/urn:nbn:fi-fe2019052817574
Institute of Electrical and Electronics Engineers,
|Publish Date:|| 2019-05-28
This paper focuses on developing a decentralized framework for coordinated minimum power beamforming wherein L base stations (BSs), each equipped with N antennas, serve K single-antenna users with specific rate constraints. This is realized by considering user specific intercell interference (ICI) strength as the principal coupling parameter among BSs. First, explicit deterministic expressions for transmit powers are derived for spatially correlated channels in the asymptotic regime in which N and K grow large with a non-trivial ratio K/N. These asymptotic expressions are then used to compute approximations of the optimal ICI values that depend only on the channel statistics. By relying on the approximate ICI values as coordination parameters, a distributed non-iterative coordination algorithm, suitable for large networks with limited backhaul, is proposed. A heuristic algorithm is also proposed relaxing coordination requirements even further as it only needs pathloss values for non-local channels. The proposed algorithms satisfy the target rates for all users even when N and K are relatively small. Finally, the potential benefits of grouping users with similar statistics are investigated to further reduce the overhead and computational effort of the proposed solutions. Simulation results show that the proposed methods yield near-optimal performance.
IEEE transactions on communications
|Pages:||1894 - 1909|
|Type of Publication:||
A1 Journal article – refereed
|Field of Science:||
213 Electronic, automation and communications engineering, electronics
This work was supported in part by the Academy of Finland 6Genesis Flagship (grant No. 318927), the Academy of Finland funding No. 279101 and European Union FP7 project ICT-317669 METIS. L. Sanguinetti and M. Debbah have been supported by the ERC Starting Grant 305123 MORE.
|Academy of Finland Grant Number:||
318927 (Academy of Finland Funding decision)
279101 (Academy of Finland Funding decision)
© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.