Pith. sign in

REVIEW

Simultaneous Beam and User Selection for the Beamspace mmWave/THz Massive MIMO Downlink

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2208.09792 v2 pith:RQKF4S42 submitted 2022-08-21 eess.SP cs.ITcs.SYeess.SYmath.IT

Simultaneous Beam and User Selection for the Beamspace mmWave/THz Massive MIMO Downlink

classification eess.SP cs.ITcs.SYeess.SYmath.IT
keywords beamselectionuserbeamspaceproblemmassivemimoalgorithms
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Beamspace millimeter-wave (mmWave) and terahertz (THz) massive MIMO constitute attractive schemes for next-generation communications, given their abundant bandwidth and high throughput. However, their user and beam selection problem has to be efficiently addressed. Inspired by this challenge, we develop low-complexity solutions explicitly. We introduce the dirty paper coding (DPC) into the joint user and beam selection problem. We unveil the compelling properties of the DPC sum rate in beamspace massive MIMO, showing its monotonic evolution against the number of users and beams selected. We then exploit its beneficial properties for substantially simplifying the joint user and beam selection problem. Furthermore, we develop a set of algorithms striking unique trade-offs for solving the simplified problem, facilitating simultaneous user and beam selection based on partial beamspace channels for the first time. Additionally, we derive the sum rate bound of the algorithms and analyze their complexity. Our simulation results validate the effectiveness of the proposed design and analysis, confirming their superiority over prior solutions.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.