The University of Southampton
University of Southampton Institutional Repository

Long-term rate-fairness-aware beamforming based massive MIMO systems

Long-term rate-fairness-aware beamforming based massive MIMO systems
Long-term rate-fairness-aware beamforming based massive MIMO systems
This is the first treatise on multi-user (MU) beamforming designed for achieving long-term rate-fairness in fulldimensional MU massive multi-input multi-output (m-MIMO) systems. Explicitly, based on the channel covariances, which can be assumed to be known beforehand, we address this problem by optimizing the following objective functions: the users’ signal-toleakage- noise ratios (SLNRs) using SLNR max-min optimization, geometric mean of SLNRs (GM-SLNR) based optimization, and SLNR soft max-min optimization. We develop a convex-solver based algorithm, which invokes a convex subproblem of cubic time-complexity at each iteration for solving the SLNR maxmin problem. We then develop closed-form expression based algorithms of scalable complexity for the solution of the GMSLNR and of the SLNR soft max-min problem. The simulations provided confirm the users’ improved-fairness ergodic rate distributions.
0090-6778
Zhu, W.
fa2e0293-f9dc-4dfd-b654-457ca7ab6504
Tuan, H.D.
47dc4b79-2c0f-43bd-8952-d8f4a6a04711
Dutkiewicz, E.
758c11d4-76a2-4df8-8ec9-451a8ff91aab
Fang, Y.
fa87057a-a0bd-40e1-9452-d6717dedcedf
Poor, H.V.
2ce6442b-62db-47b3-8d8e-484e7fad51af
Hanzo, L.
66e7266f-3066-4fc0-8391-e000acce71a1
Zhu, W.
fa2e0293-f9dc-4dfd-b654-457ca7ab6504
Tuan, H.D.
47dc4b79-2c0f-43bd-8952-d8f4a6a04711
Dutkiewicz, E.
758c11d4-76a2-4df8-8ec9-451a8ff91aab
Fang, Y.
fa87057a-a0bd-40e1-9452-d6717dedcedf
Poor, H.V.
2ce6442b-62db-47b3-8d8e-484e7fad51af
Hanzo, L.
66e7266f-3066-4fc0-8391-e000acce71a1

Zhu, W., Tuan, H.D., Dutkiewicz, E., Fang, Y., Poor, H.V. and Hanzo, L. (2023) Long-term rate-fairness-aware beamforming based massive MIMO systems. IEEE Transactions on Communications. (In Press)

Record type: Article

Abstract

This is the first treatise on multi-user (MU) beamforming designed for achieving long-term rate-fairness in fulldimensional MU massive multi-input multi-output (m-MIMO) systems. Explicitly, based on the channel covariances, which can be assumed to be known beforehand, we address this problem by optimizing the following objective functions: the users’ signal-toleakage- noise ratios (SLNRs) using SLNR max-min optimization, geometric mean of SLNRs (GM-SLNR) based optimization, and SLNR soft max-min optimization. We develop a convex-solver based algorithm, which invokes a convex subproblem of cubic time-complexity at each iteration for solving the SLNR maxmin problem. We then develop closed-form expression based algorithms of scalable complexity for the solution of the GMSLNR and of the SLNR soft max-min problem. The simulations provided confirm the users’ improved-fairness ergodic rate distributions.

Text
3D_statis_BF_final - Accepted Manuscript
Download (489kB)

More information

Accepted/In Press date: 8 December 2023

Identifiers

Local EPrints ID: 485566
URI: http://eprints.soton.ac.uk/id/eprint/485566
ISSN: 0090-6778
PURE UUID: 1b8936a9-5a3d-489f-be04-081ee8c35db5
ORCID for L. Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 11 Dec 2023 17:34
Last modified: 18 Mar 2024 02:36

Export record

Contributors

Author: W. Zhu
Author: H.D. Tuan
Author: E. Dutkiewicz
Author: Y. Fang
Author: H.V. Poor
Author: L. Hanzo ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×