Reference : Pareto-Optimal Pilot Design for Cellular Massive MIMO Systems
Scientific journals : Article
Engineering, computing & technology : Electrical & electronics engineering
Security, Reliability and Trust
http://hdl.handle.net/10993/44628
Pareto-Optimal Pilot Design for Cellular Massive MIMO Systems
English
Le, Anh Tuan mailto [The Department of Design Engineering & Mathematics, Faculty of Science and Technology, Middlesex University, The Burroughs, Hendon, London, NW4 4BT, U. K.]
Trinh, van Chien mailto [University of Luxembourg > > >]
Reza Nakhai, Mohammad mailto [The Department of Engineering, King's College London, London, WC2R 2LS, U. K.]
Le-Ngoc, Tho mailto [The Department of Electrical and Computer Engineering, McGill University, Montreal, Quebec, H3A 0G4, Canada.]
4-Sep-2020
IEEE Transactions on Vehicular Technology
Institute of Electrical and Electronics Engineers
Yes (verified by ORBilu)
International
0018-9545
United States
[en] Massive MIMO ; Pilot Design ; Linear Matrix Inequality ; Multi-objective Optimization
[en] We introduce a non-orthogonal pilot design scheme that simultaneously minimizes two contradicting targets of channel estimation errors of all base stations (BSs) and the total pilot power consumption of all users in a multi-cell massive MIMO system, subject to the transmit power constraints of the users in the network. We formulate a multi-objective optimization problem (MOP) with two objective functions capturing the contradicting targets and find the Pareto optimal solutions for the pilot signals. Using weighted-sum-scalarization technique, we first convert the MOP to an equivalent single-objective optimization problem (SOP), which is not convex. Assuming that each BS is provided with the most recent knowledge of the pilot signals of the other BSs, we then decompose the SOP into a set of distributed non-convex optimization problems to be solved at individual BSs. Finally, we introduce an alternating optimization approach to cast each one of the resulting distributed optimization problems into a convex linear matrix inequality (LMI) form. We provide a mathematical proof for the convergence of the proposed alternating approach and a complexity analysis for the LMI optimization problem. Simulation results confirm that the proposed approach significantly reduces pilot power, whilst maintaining the same level of channel estimation error as in [1].
http://hdl.handle.net/10993/44628

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
TVT_2020_Camera_Ready.pdfAuthor postprint6.22 MBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.