- Home
- Search Results
- Page 1 of 1
Search for: All records
-
Total Resources4
- Resource Type
-
0000000004000000
- More
- Availability
-
40
- Author / Contributor
- Filter by Author / Creator
-
-
Renzo, Marco Di (4)
-
Han, Zhu (2)
-
Pan, Cunhua (2)
-
Song, Lingyang (2)
-
Zhang, Hongliang (2)
-
Zhou, Gui (2)
-
Bian, Kaigui (1)
-
Di, Boya (1)
-
Hong, Sheng (1)
-
Hu, Jingzhi (1)
-
Lee Swindlehurst, A. (1)
-
Pan, Yijin (1)
-
Peng, Zhangjie (1)
-
Poor, H. Vincent (1)
-
Ren, Hong (1)
-
Swindlehurst, A Lee (1)
-
Weng, Ruisong (1)
-
Wu, Tuo (1)
-
Zhang, Angela Yingjun (1)
-
Zhang, Haobo (1)
-
- Filter by Editor
-
-
& Spizer, S. M. (0)
-
& . Spizer, S. (0)
-
& Ahn, J. (0)
-
& Bateiha, S. (0)
-
& Bosch, N. (0)
-
& Brennan K. (0)
-
& Brennan, K. (0)
-
& Chen, B. (0)
-
& Chen, Bodong (0)
-
& Drown, S. (0)
-
& Ferretti, F. (0)
-
& Higgins, A. (0)
-
& J. Peters (0)
-
& Kali, Y. (0)
-
& Ruiz-Arias, P.M. (0)
-
& S. Spitzer (0)
-
& Sahin. I. (0)
-
& Spitzer, S. (0)
-
& Spitzer, S.M. (0)
-
(submitted - in Review for IEEE ICASSP-2024) (0)
-
-
Have feedback or suggestions for a way to improve these results?
!
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
This paper investigates reconfigurable intelligent surface (RIS)-assisted secure multiuser communication systems in the presence of hardware impairments (HIs) at the RIS and the transceivers. We jointly optimize the beamforming vectors at the base station (BS) and the phase shifts of the reflecting elements at the RIS so as to maximize the weighted minimum approximate ergodic secrecy rate (WMAESR), subject to the transmission power constraints at the BS and unit-modulus constraints at the RIS. To solve the formulated optimization problem, we first decouple it into two tractable subproblems and then use the block coordinate descent (BCD) method to alternately optimize the subproblems. Two different methods are proposed to solve the two obtained subproblems. The first method transforms each subproblem into a second order cone programming (SOCP) problem by invoking the penalty convex–concave procedure (CCP) method and the closed-form fractional programming (FP) criterion, and then directly solves them by using CVX. The second method leverages the minorization-maximization (MM) algorithm. Specifically, we first derive a concave approximation function, which is a lower bound of the original objective function, and then the two subproblems are transformed into two simple surrogate problems that admit closed-form solutions. Simulation results verify the performance gains of the proposed robust transmission methods over existing non-robust designs. In addition, the MM algorithm is shown to have much lower complexity than the SOCP-based algorithm.more » « less
-
Zhang, Haobo; Zhang, Hongliang; Di, Boya; Renzo, Marco Di; Han, Zhu; Poor, H. Vincent; Song, Lingyang (, IEEE Journal on Selected Areas in Communications)
-
Pan, Cunhua; Zhou, Gui; Zhi, Kangda; Hong, Sheng; Wu, Tuo; Pan, Yijin; Ren, Hong; Renzo, Marco Di; Lee Swindlehurst, A.; Zhang, Rui; et al (, IEEE Journal of Selected Topics in Signal Processing)
-
Hu, Jingzhi; Zhang, Hongliang; Bian, Kaigui; Renzo, Marco Di; Han, Zhu; Song, Lingyang (, IEEE Journal on Selected Areas in Communications)
An official website of the United States government
