A power method based user selection for reconfigurable intelligent surface (RIS) assisted multiuser massive MISO systemsopen access
- Authors
- Min, Kyungsik; Jung, Minchae
- Issue Date
- Oct-2023
- Publisher
- 한국통신학회
- Keywords
- MIMO; RIS; User selection
- Citation
- ICT Express, v.9, no.5, pp 783 - 788
- Pages
- 6
- Journal Title
- ICT Express
- Volume
- 9
- Number
- 5
- Start Page
- 783
- End Page
- 788
- URI
- https://scholarworks.bwise.kr/sch/handle/2021.sw.sch/22468
- DOI
- 10.1016/j.icte.2022.08.002
- ISSN
- 2405-9595
2405-9595
- Abstract
- Reconfigurable intelligent surfaces (RISs) have recently emerged as effective solutions for providing massive connectivity. However, an effective RIS user selection method that can support massive devices remains undeveloped. In this study, a power method (PM)-based RIS user selection algorithm for RIS-assisted massive multiple-input multiple-output systems is proposed. It is proven that minimizing the condition number (CN) of the aggregated downlink channel matrix results in the same performance as maximizing the sum rate. Based on this analysis, a PM-based RIS user selection algorithm that utilizes a CN as an RIS user selection metric is proposed here. Although the complexity of conventional user selection algorithm is proportional to the square of the number of base station (BS) antennas (M2), that of the proposed algorithm is linearly proportional to the number of BS antennas (M). Simulation results demonstrate that, under a practical RIS control link, the proposed PMUS algorithm achieves better performance and lower complexity than the conventional user selection algorithm. (c) 2022 Published by Elsevier B.V. on behalf of The Korean Institute of Communications and Information Sciences. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > Department of Electronic Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.