Pith. sign in

REVIEW

Intelligent Reflecting Surface Aided Multigroup Multicast MISO Communication Systems

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 1909.04606 v4 pith:UUHWLBAV submitted 2019-09-10 eess.SP cs.ITmath.IT

Intelligent Reflecting Surface Aided Multigroup Multicast MISO Communication Systems

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

Intelligent reflecting surface (IRS) has recently been envisioned to offer unprecedented massive multiple-input multiple-output (MIMO)-like gains by deploying large-scale and low-cost passive reflection elements. By adjusting the reflection coefficients, the IRS can change the phase shifts on the impinging electromagnetic waves so that it can smartly reconfigure the signal propagation environment and enhance the power of the desired received signal or suppress the interference signal. In this paper, we consider downlink multigroup multicast communication systems assisted by an IRS. We aim for maximizing the sum rate of all the multicasting groups by the joint optimization of the precoding matrix at the base station (BS) and the reflection coefficients at the IRS under both the power and unit-modulus constraint. To tackle this non-convex problem, we propose two efficient algorithms under the majorization--minimization (MM) algorithm framework. Specifically, a concave lower bound surrogate objective function of each user's rate has been derived firstly, based on which two sets of variables can be updated alternately by solving two corresponding second-order cone programming (SOCP) problems. Then, in order to reduce the computational complexity, we derive another concave lower bound function of each group's rate for each set of variables at every iteration, and obtain the closed-form solutions under these loose surrogate objective functions. Finally, the simulation results demonstrate the benefits in terms of the spectral and energy efficiency of the introduced IRS and the effectiveness in terms of the convergence and complexity of our proposed algorithms.

discussion (0)

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