TL;DR
This paper introduces convex formulations and four efficient solvers for resource allocation in MIMO MAC, significantly improving speed and scalability while matching the quality of commercial solvers.
Contribution
It presents novel convex formulations and four solvers for MIMO MAC resource allocation, exploiting polymatroid structure and duality, with open-source implementation.
Findings
Solvers match commercial solver quality in solution accuracy.
Proposed methods run up to 100 times faster than commercial solvers.
Scalable to large regimes where commercial solvers time out.
Abstract
Resource allocation in the multiple-input multiple-output (MIMO) multiple access channel (MAC) is a fundamental problem in multiuser communications, yet it is increasingly treated as non-convex and computationally intractable. This has motivated a large body of heuristic machine learning and successive-approximation methods. Results here show that the MIMO MAC admits canonical convex formulations and present four solvers that together characterize its capacity region. maxRMAC performs weighted sum-rate maximization under per-user energy constraints, minPMAC finds the minimum weighted energy required to support target rates, maxRESMAC performs weighted sum-rate maximization under a total energy constraint, and admMAC tests rate-region feasibility. The solvers exploit the polymatroid structure of the MAC rate region and the separability of the dual Lagrangian across frequency tones, which…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
