Resource Allocation for the Uplink of a Multi-User Massive MIMO System

We study the uplink resource management of a multi-user multiple-input-multiple-output single cell for Zero-Forcing receive combining transmission. We consider jointly power allocation, user selection and modulation and coding scheme selection over multiple subchannels. Our contributions are twofold: we first propose a quasi-optimal offline algorithm that provides a target performance and then design and validate an efficient online proportional fair algorithm that performs the above steps. Due to user power constraints, the offline optimization is conducted jointly for all subchannels within a time slot, a computationally intensive task, prompting the proposal of a greedy offline algorithm that we validate in two ways: 1) for a small number of users, by solving the general problem to quasi-optimality and 2) for a larger number of users, by solving again to quasi-optimality a transformed version of the general problem when the channels are assumed flat. From the offline study, we find that, given the right user selection, equal power allocation can be employed without much degradation in performance. We also see that the number of channels allocated to users varies widely depending upon their channel gains. Using these insights, we propose our efficient real-time online algorithm that has runtime competitiveness with a state-of-the-art benchmark.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Mobile Computing
Published
2024-12-26
DOI
https://doi.org/10.1109/tmc.2024.3522207
Citations
2
Primary Topic
Advanced MIMO Systems Optimization
Type
article
Field-Weighted Citation Impact
0.42
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Resource Allocation for the Uplink of a Multi-User Massive MIMO System

Catherine Rosenberg, Haseen Rahman
2 citations
IEEE Transactions on Mobile Computing
Advanced MIMO Systems Optimization
0.42
article

Resource Allocation for the Uplink of a Multi-User Massive MIMO System

Catherine Rosenberg, Haseen Rahman
article en
2 citations

Abstract

We study the uplink resource management of a multi-user multiple-input-multiple-output single cell for Zero-Forcing receive combining transmission. We consider jointly power allocation, user selection and modulation and coding scheme selection over multiple subchannels. Our contributions are twofold: we first propose a quasi-optimal offline algorithm that provides a target performance and then design and validate an efficient online proportional fair algorithm that performs the above steps. Due to user power constraints, the offline optimization is conducted jointly for all subchannels within a time slot, a computationally intensive task, prompting the proposal of a greedy offline algorithm that we validate in two ways: 1) for a small number of users, by solving the general problem to quasi-optimality and 2) for a larger number of users, by solving again to quasi-optimality a transformed version of the general problem when the channels are assumed flat. From the offline study, we find that, given the right user selection, equal power allocation can be employed without much degradation in performance. We also see that the number of channels allocated to users varies widely depending upon their channel gains. Using these insights, we propose our efficient real-time online algorithm that has runtime competitiveness with a state-of-the-art benchmark.

IEEE Transactions on Mobile ComputingVol. 24(5)
University of Waterloo (CA)
Openalex Percentile: Top 36%
Advanced MIMO Systems Optimization
0.42
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.