Kaiming Shen

Kaiming Shen

Auto-generated profile, based on publicly available information

Kaiming Shen

School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen, China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
12 March 2018 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
KSKaiming Shen
Kaiming Shen
WYWei Yu
Wei Yu
Fractional programming (FP) refers to a family of optimization problems that involve ratio term(s). This two-part paper explores the use of FP in the design and optimization of communication systems. Part I of this paper focuses on FP theory and on solving continuous problems. The main theoretical contribution is a novel quadratic transform technique for tackling the multiple-ratio concave-convex FP problem-in contrast to conventional FP techniques that mostly can only deal with the single-ratio or the max-min-ratio case. Multiple-ratio FP problems are important for the optimization of communication networks, because system-level design often involves multiple signal-to-interference-plus-noise ratio terms. This paper considers the applications of FP to solving continuous problems in communication system design, particularly for power control, beamforming, and energy efficiency maximization. These application cases illustrate that the proposed quadratic transform can greatly facilitate the optimization involving ratios by recasting the original nonconvex problem as a sequence of convex problems. This FP-based problem reformulation gives rise to an efficient iterative optimization algorithm with provable convergence to a stationary point. The paper further demonstrates close connections between the proposed FP approach and other well-known algorithms in the literature, such as the fixed-point iteration and the weighted minimum mean-square-error beamforming. The optimization of discrete problems is discussed in Part II of this paper.

9 March 2018 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
KSKaiming Shen
Kaiming Shen
WYWei Yu
Wei Yu
This two-part paper develops novel methodologies for using fractional programming (FP) techniques to design and optimize communication systems. Part I of this paper proposes a new quadratic transform for FP and treats its application for continuous optimization problems. In this Part II of the paper, we study discrete problems, such as those involving user scheduling, which are considerably more difficult to solve. Unlike the continuous problems, discrete or mixed discrete-continuous problems normally cannot be recast as convex problems. In contrast to the common heuristic of relaxing the discrete variables, this work reformulates the original problem in an FP form amenable to distributed combinatorial optimization. The paper illustrates this methodology by tackling the important and challenging problem of uplink coordinated multicell user scheduling in wireless cellular systems. Uplink scheduling is more challenging than downlink scheduling, because uplink user scheduling decisions significantly affect the interference pattern in nearby cells. Furthermore, the discrete scheduling variable needs to be optimized jointly with continuous variables such as transmit power levels and beamformers. The main idea of the proposed FP approach is to decouple the interaction among the interfering links, thereby permitting a distributed and joint optimization of the discrete and continuous variables with provable convergence. The paper shows that the well-known weighted minimum mean-square-error (WMMSE) algorithm can also be derived from a particular use of FP; but our proposed FP-based method significantly outperforms WMMSE when discrete user scheduling variables are involved, both in term of run-time efficiency and optimizing results.

11 June 2024 in Proceedings of the IEEE
Verified
Journal Article
Closed access
QWQingqing Wu
Qingqing Wu
BZBeixiong Zheng
Beixiong Zheng
Changsheng YouChangsheng You
Changsheng You
LZLipeng Zhu
Lipeng Zhu
KSKaiming Shen
Kaiming Shen
RZRui Zhang
Rui Zhang
Intelligent surfaces (ISs) have emerged as a key technology to empower a wide range of appealing applications for wireless networks, due to their low cost, high energy efficiency, flexibility of deployment, and capability of constructing favorable wireless channels/radio environments. Moreover, the recent advent of several new IS architectures further expanded their electromagnetic functionalities from passive reflection to active amplification, simultaneous reflection, and refraction, as well as holographic beamforming. However, the research on ISs is still in rapid progress and there have been recent technological advances in ISs and their emerging applications that are worthy of a timely review. Thus, in this article, we provide a comprehensive survey on the recent development and advances of ISs-aided wireless networks. Specifically, we start with an overview on the anticipated use cases of ISs in future wireless networks such as 6G, followed by a summary of the recent standardization activities related to ISs. Then, the main design issues of the commonly adopted reflection-based IS and their state-of-the-art solutions are presented in detail, including reflection optimization, deployment, signal modulation, wireless sensing, and integrated sensing and communications. Finally, recent progress and new challenges in advanced IS architectures are discussed to inspire future research.

7 November 2022 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
SRShuyi Ren
Shuyi Ren
KSKaiming Shen
Kaiming Shen
YZYaowen Zhang
Yaowen Zhang
XLXin Li
Xin Li
XCXin Chen
Xin Chen
ZLZhi-Quan Luo
Zhi-Quan Luo
This paper proposes a blind beamforming strategy for intelligent reflecting surface (IRS), aiming to boost the signal-to-noise ratio (SNR) by coordinating phase shifts across the reflective elements in the absence of channel information. Differing from most existing approaches that first estimate channels and then optimize phase shifts, the proposed blind beamforming method explores the wireless environment by extracting statistical features directly from random samples of the received signal power, without acquiring channel station information (CSI). This new method just requires a polynomial number of random samples to provide a quadratic SNR boost in the number of reflective elements without CSI, whereas the standard random-max sampling algorithm can only achieve a linear boost under the same condition. Moreover, we interpret blind beamforming from a least-squares point of view. Field tests demonstrate the significant advantages of the proposed blind beamforming approach over the benchmark methods in enhancing wireless transmission.

8 October 2019 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
KSKaiming Shen
Kaiming Shen
WYWei Yu
Wei Yu
LZLicheng Zhao
Licheng Zhao
DPDaniel P. Palomar
Daniel P. Palomar
Interference management is a fundamental issue in device-to-device (D2D) communications whenever the transmitter-and-receiver pairs are located in close proximity and frequencies are fully reused, so active links may severely interfere with each other. This paper devises an optimization strategy named FPLinQ to coordinate the link scheduling decisions among the interfering links, along with power control and beamforming. The key enabler is a novel optimization method called matrix fractional programming (FP) that generalizes previous scalar and vector forms of FP in allowing multiple data streams per link. From a theoretical perspective, this paper provides a deeper understanding of FP by showing a connection to the minorization-maximization (MM) algorithm. From an application perspective, this paper shows that as compared to the existing methods for coordinating scheduling in the D2D network, such as FlashLinQ, ITLinQ, and ITLinQ+, the proposed FPLinQ approach is more general in allowing multiple antennas at both the transmitters and the receivers, and further in allowing arbitrary and multiple possible associations between the devices via matching. Numerical results show that FPLinQ significantly outperforms the previous state-of-the-art in a typical D2D communication environment.

10 June 2022 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
WGWei Guo
Wei Guo
RLRan Li
Ran Li
CHChuan Huang
Chuan Huang
XQXiaoqi Qin
Xiaoqi Qin
KSKaiming Shen
Kaiming Shen
WZWei Zhang
Wei Zhang
This paper studies the joint device selection and power control scheme for wireless federated learning (FL), considering both the downlink and uplink communications between the parameter server (PS) and the terminal devices. In each round of model training, the PS first broadcasts the global model to the terminal devices in an analog fashion, and then the terminal devices perform local training and upload the updated model parameters to the PS via over-the-air computation (AirComp). First, we propose an AirComp-based adaptive reweighing scheme for the aggregation of local updated models, where the model aggregation weights are directly determined by the uplink transmit power values of the selected devices and which enables the joint learning and communication optimization simply by the device selection and power control. Furthermore, we provide a convergence analysis for the proposed wireless FL algorithm and the upper bound on the expected optimality gap between the expected and optimal global loss values is derived. With instantaneous channel state information (CSI), we formulate the optimality gap minimization problems under both the individual and sum uplink transmit power constraints, respectively, which are shown to be solved by the semidefinite programming (SDR) technique. Numerical results reveal that our proposed wireless FL algorithm achieves close to the best performance by using the ideal FedAvg scheme with error-free model exchange and full device participation.