Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 198

The DOI matches its Crossref record.

Max-Min Fairness in IRS-Aided Multi-Cell MISO Systems With Joint Transmit and Reflective Beamforming

Open access
Xie, Hailiang, Xu, Jie, Liu, Ya-Feng · 2021 · IEEE Transactions on Wireless Communications

Abstract

This paper investigates an intelligent reflecting surface (IRS)-aided multi-cell multiple-input single-output (MISO) network with a set of multi-antenna base stations (BSs) each communicating with multiple single-antenna users, in which an IRS is dedicatedly deployed for assisting the wireless transmission and suppressing the inter-cell interference. Under this setup, we jointly optimize the coordinated transmit beamforming vectors at the BSs and the reflective beamforming vector (with both reflecting phases and amplitudes) at the IRS, for the purpose of maximizing the minimum weighted signal-to-interference-plus-noise ratio (SINR) at the users, subject to the individual maximum transmit power constraints at the BSs and the reflection constraints at the IRS. To solve the non-convex min-weighted-SINR maximization problem, we first present an exact-alternating-optimization approach to optimize the transmit and reflective beamforming vectors in an alternating manner, in which the transmit and reflective beamforming optimization subproblems are solved exactly in each iteration by using the techniques of second-order-cone program (SOCP) and semi-definite relaxation (SDR), respectively. However, the exact-alternating-optimization approach has high computational complexity, and may lead to compromised performance due to the uncertainty of randomization in SDR. To avoid these drawbacks, we further propose an inexact-alternating-optimization approach, in which the transmit and reflective beamforming optimization subproblems are solved inexactly in each iteration based on the principle of successive convex approximation (SCA). In addition, to further reduce the computational complexity, we propose a low-complexity inexact-alternating-optimization design, in which the reflective beamforming optimization subproblem is solved more inexactly. Via numerical results, it is shown that the proposed three designs achieve significantly increased min-weighted-SINR values, as compared with benchmark schemes without the IRS or with random reflective beamforming. It is also shown that the inexact-alternating-optimization design outperforms the exact-alternating-optimization one in terms of both the achieved min-weighted-SINR value and the computational complexity, while the low-complexity inexact-alternating-optimization design has much lower computational complexity with slightly compromised performance. Furthermore, we show that our proposed design can be applied to the scenario with unit-amplitude reflection constraints, with a negligible performance loss.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/twc.2020.3033332

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 198

Metadata

Authors
Xie, H., Xu, J., & Liu, Y.-F.
Venue
IEEE Transactions on Wireless Communications
Published
2021-02
Volume
20
Issue
2
Pages
1379-1393
ISSN
  • 1536-1276 (ISSN-L)
  • 1558-2248
OpenAlex
W3096513223
Cited by
198
References
0
FWCI
10.63
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Max-Min Fairness in IRS-Aided Multi-Cell MISO Systems With Joint Transmit and Reflective Beamforming. https://app.cochat.ai/papers/10.1109/twc.2020.3033332
The paper
Xie, H., Xu, J., & Liu, Y.-F. (2021). Max-Min Fairness in IRS-Aided Multi-Cell MISO Systems With Joint Transmit and Reflective Beamforming. IEEE Transactions on Wireless Communications. https://doi.org/10.1109/twc.2020.3033332

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.