Max-Min Rate Optimization for Uplink IRS-NOMA With Receive Beamforming

نویسندگان

چکیده

This letter addresses an intelligent reflecting surface (IRS) to the uplink nonorthogonal multiple access (NOMA) served by a multiantenna receiver for effective data collection from massive devices. We aim achieve max-min fairness of network optimizing receive beamforming, IRS reflection, and transmit power allocation (PA) For this purpose, first, we design block coordinate descent (BCD) algorithm that reduces complexity conventional reflection optimization. Next, nonlinear optimization (NLO) problem solvable with limited-memory Broyden-Fletcher-Goldfarb-Shanno bounded (L-BFGS-B) algorithm, which is renowned handling large-scale problems, cope large elements The formed smooth but complex objective function depends on phase shift PA vectors gradient derived in computationally efficient form. results reveal proposed BCD NLO L-BFGS-B outperform performance complexity, where approach offers substantial reduction.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

NOMA in Distributed Antenna System for Max-Min Fairness and Max-Sum-Rate

Distributed antenna system (DAS) has been deployed for over a decade. DAS has advantages in capacity especially for the cell edge users, in both single-cell and multi-cell environments. In this paper, non-orthogonal multiple access (NOMA) is suggested in single-cell DAS to maximize user fairness and sumrate. Two transmission strategies are considered: NOMA with single selection transmission and...

متن کامل

Min-max-min robust combinatorial optimization

The idea of k-adaptability in two-stage robust optimization is to calculate a fixed number k of second-stage policies here-and-now. After the actual scenario is revealed, the best of these policies is selected. This idea leads to a min-max-min problem. In this paper, we consider the case where no first stage variables exist and propose to use this approach to solve combinatorial optimization pr...

متن کامل

Min-max-min Robust Combinatorial Optimization Subject to Discrete Uncertainty

We consider combinatorial optimization problems with uncertain objective functions. In the min-max-min robust optimization approach, a fixed number k of feasible solutions is computed such that the respective best of them is optimal in the worst case. The idea is to calculate a set of candidate solutions in a potentially expensive preprocessing and then select the best solution out of this set ...

متن کامل

Downlink MBER Transmit Beamforming Design Based on Uplink MBER Receive Beamforming for TDD-SDMA Induced MIMO Systems

The downlink minimum bit error rate (MBER) transmit beamforming is directly designed based on the uplink MBER receive beamforming solution for time division duplex (TDD) space-division multiple-access (SDMA) induced multiple-input multiple-output (MIMO) systems, where the base station (BS) is equipped with multiple antennas to support multiple single-antenna mobile terminals (MTs). It is shown ...

متن کامل

Control-theoretic max-min flow control with minimum rate guarantee

In this paper we present a novel controltheoretic explicit rate (ER) allocation algorithm for the MAX-MIN flow control of elastic traffic services with minimum rate guarantee in the context of the ATM ABR service. The proposed ER algorithm is simple in that the number of operations required to compute it at a switch is minimized, scalable in that per-VC (virtual circuit) operations including pe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Wireless Communications Letters

سال: 2022

ISSN: ['2162-2337', '2162-2345']

DOI: https://doi.org/10.1109/lwc.2022.3206903