Shu Cai

Dr. Shu Cai

orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 November 2019 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
LLLei Li
Lei Li
TCTsung-Hui Chang
Tsung-Hui Chang
SCShu Cai
Shu Cai
This paper considers an unmanned-aerial-vehicleenabled (UAV-enabled) wireless network where a relay UAV is used for two-way communications between a ground base station (BS) and a set of distant user equipment (UE). The UAV adopts the amplify-and-forward strategy for two-way relaying over orthogonal frequency bands. The UAV positioning and the transmission powers of all nodes are jointly designed to maximize the sum rate of both uplink and downlink subject to transmission power constraints and the signal-to-noise ratio constraint on the UAV control channel. The formulated joint positioning and power control (JPPC) problem has an intricate expression of the sum rate due to two-way transmissions and is difficult to solve in general. We propose a novel concave surrogate function for the sum rate and employ the successive convex approximation (SCA) technique for obtaining a high-quality approximate solution. We show that the proposed surrogate function has a small curvature and enables a fast convergence of SCA. Furthermore, we develop a computationally efficient JPPC algorithm by applying the fast iterative shrinkage-thresholding algorithm (FISTA) type accelerated gradient projection (AGP) algorithm to solve the SCA problem as well as one of the projection subproblems, resulting in a double-loop AGP method. Simulation results show that the proposed JPPC algorithms are not only computationally efficient but also greatly outperform the heuristic approaches.

1 August 2017 in Signal Processing
Verified
Journal Article
Open access
SCShu Cai
Shu Cai
GWGang Wang
Gang Wang
JZJun Zhang
Jun Zhang
KWKai Kit Wong
Kai Kit Wong
HZHongbo Zhu
Hongbo Zhu

1 June 2023 in Digital Communications and Networks
Verified
Journal Article
Open access
WXWenwan Xu
Wenwan Xu
JZJun Zhang
Jun Zhang
SCShu Cai
Shu Cai
JWJue Wang
Jue Wang
YWYi Wu
Yi Wu

30 December 2022 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
SCShu Cai
Shu Cai
HZHongbo Zhu
Hongbo Zhu
CSChao Shen
Chao Shen
TCTsung-Hui Chang
Tsung-Hui Chang
Consider a multi-casting system where a multi-antenna base station (BS) sends multiple data streams to multiple users via symbol-level precoding (SLP). Unlike most of the existing literature which assume single-antenna users, we consider joint SLP and linear receive beamforming (SLP-RBF) design, to investigate the performance boost brought by multi-antenna users. The SLP-RBF problem minimizes the total transmission power subject to the user symbol error probability (SEP) constraints. It turns out that, due to the RBF, the problem involves a large number of non-convex bilinear terms and is much more challenging to handle. In this paper, our goal is to develop computationally efficient algorithms to tackle the SLP-RBF problem. We first introduce several convex approximation forms for the bilinear terms and develop a successive convex approximation (SCA) based algorithm. Furthermore, by exploiting the problem structure and a rank-reduction transformation (RDT), we equivalently write the problem as a dimension-reduced problem with simple box constraints. The reformulated problem enables us to develop a highly efficient iterative algorithm based on accelerated gradient descent methods. We also extend the study to the SLP-RBF problem with one-bit transmission constraints. Since the RDT is no longer applicable, we develop an algorithm based on successive upper-bound minimization (SUM) and alternating direction method of multipliers (ADMM). Simulation results show that the joint SLP-RBF design offers significant power efficiency gains over SLP methods, and the proposed algorithms is time efficient and can handle a large scale system.

23 August 2022 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
SCShu Cai
Shu Cai
HQHeshuai Qu
Heshuai Qu
JZJun Zhang
Jun Zhang
XSXiaoye Shi
Xiaoye Shi
HZHongbo Zhu
Hongbo Zhu
This paper investigates an intelligent reflective surface (IRS) aided secure wireless communication system, in which a multi-antenna base station (BS) transmits confidential messages to multiple users via symbol-level precoding (SLP). We consider the two cases where the eavesdropper (Eve) has no channel state information (CSI) and global CSI, respectively, to investigate the possible worst and best eavesdropping performance, and the security improvement brought by the joint SLP-IRS design. For the former, we consider the user-receive signal-to-interference-noise ratio (SINR) balancing problem under the constraints of transmission power and security, and prove that SLP is inherently safe. For the latter, we assume that a smart Eve can intercept signals using brute-force and maximum likelihood detection methods. First, its received SINR is derived under the artificial noise framework, and then a two-step design scheme for SLP and IRS is proposed. In particular, an iterative penalty method is proposed for the IRS design step. Simulation results verify the analysis and show that IRS can significantly enhance the security of system.

15 June 2022 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
JLJiacheng Lu
Jiacheng Lu
JZJun Zhang
Jun Zhang
SCShu Cai
Shu Cai
BLBin Li
Bin Li
XZXiaowei Zhu
Xiaowei Zhu
Wei HongWei Hong
Wei Hong
This letter considers downlink wideband channel estimation in an asymmetrical full-digital system where the number of uplink receive radio frequency chains is less than that of the downlink. This channel inconsistency will reduce downlink channel estimation accuracy. To deal with this problem, we adopt the coprime array topology in uplink receive antennas. Then, two iterative algorithms which are based on alternating direction method of multipliers and block-sparsity orthogonal matching pursuit, respectively, are developed to rebuild downlink channel. Simulation results demonstrate the effectiveness of the proposed scheme in the asymmetrical full-digital system.