Recently, intelligent reflecting surfaces (IRSs) have drawn huge attention as a promising solution for 6G networks to enhance diverse performance metrics in a cost-effective way. For massive connectivity toward a higher spectral efficiency, we address an intelligent reflecting surface (IRS) to an uplink nonorthogonal multiple access (NOMA) network supported by a multiantenna receiver. We maximize the sum rate of the IRS-aided NOMA network by optimizing the IRS reflection pattern under unit modulus and practical reflection. For a moderate-sized IRS, we obtain an upper bound on the optimal sum rate by solving a determinant maximization (max-det) problem after rank relaxation, which also leads to a feasible solution through Gaussian randomization. For a large number of IRS elements, we apply the iterative algorithms relying on the gradient, such as Broyden–Fletcher–Goldfarb–Shanno (BFGS) and limited-memory BFGS algorithms for which the gradient of the sum rate is derived in a computationally efficient form. The results show that the max-det approach provides a near-optimal performance under unit modulus reflection, while the gradient-based iterative algorithms exhibit merits in performance and complexity for a large-sized IRS with practical reflection.
In this letter, we consider intelligent reflecting surface (IRS) aided nonorthogonal multiple access (NOMA) for the uplink employing multiple receive antennas in order to achieve high spectral efficiency and massive connectivity. In particular, the phase shifts of the IRS are optimized under a generalized reflection model to maximize the sum rate. For the unit modulus reflection, a determinant-maximization problem is formulated and solved through extended semidefinite relaxation (max-det). For the practical reflection, we apply the limited memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) algorithm by deriving the gradient of the complicated objective function. Based on the results, we observe that the max-det solution provides a near-optimal performance but at high complexity for a large number N of IRS elements, while the L-BFGS relieves the complexity issue for a large N and provides a performance comparable to or better than a conventional sequential optimization at a reduced computational time.