Yunlong Cai

Yunlong Cai

Auto-generated profile, based on publicly available information

Yunlong Cai

Zhejiang University

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
31 October 2018 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
QHQiyu Hu
Qiyu Hu
YCYunlong Cai
Yunlong Cai
Guanding YuGuanding Yu
Guanding Yu
ZQZhijin Qin
Zhijin Qin
MZMinjian Zhao
Minjian Zhao
GLGeoffrey Ye Li
Geoffrey Ye Li

26 October 2017 in IEEE Communications Surveys & Tutorials
Verified
Journal Article
Open access
YCYunlong Cai
Yunlong Cai
ZQZhijin Qin
Zhijin Qin
FCFangyu Cui
Fangyu Cui
GLGeoffrey Ye Li
Geoffrey Ye Li
JMJulie A. McCann
Julie A. McCann
Fifth generation (5G) wireless networks face various challenges in order to support large-scale heterogeneous traffic and users, therefore new modulation and multiple access (MA) schemes are being developed to meet the changing demands. As this research space is ever increasing, it becomes more important to analyze the various approaches, therefore, in this article we present a comprehensive overview of the most promising modulation and MA schemes for 5G networks. Unlike other surreys of 5G networks, our article focuses on multiplexing techniques, including modulation techniques in orthogonal multiple access (OMA) and various types of non-orthogonal multiple access (NOMA) techniques. Specifically, we first introduce different types of modulation schemes, potential for OMA, and compare their performance in terms of spectral efficiency, out-of-band leakage, and bit-error rate. We then pay close attention to various types of NOMA candidates, including power-domain NOMA, code-domain NOMA, and NOMA multiplexing in multiple domains. From this exploration, we can identify the opportunities and challenges that will have the most significant impacts on modulation and MA designs for 5G networks.

18 June 2018 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
JRJinke Ren
Jinke Ren
Guanding YuGuanding Yu
Guanding Yu
YCYunlong Cai
Yunlong Cai
YHYinghui He
Yinghui He
By offloading intensive computation tasks to the edge cloud located at the cellular base stations, mobile-edge computation offloading (MECO) has been regarded as a promising means to accomplish the ambitious millisecond-scale endto- end latency requirement of the fifth-generation networks. In this paper, we investigate the latency-minimization problem in a multi-user time-division multiple access MECO system with joint communication and computation resource allocation. Three different computation models are studied, i.e., local compression, edge cloud compression, and partial compression offloading. First, closed-form expressions of optimal resource allocation and minimum system delay for both local and edge cloud compression models are derived. Then, for the partial compression offloading model, we formulate a piecewise optimization problem and prove that the optimal data segmentation strategy has a piecewise structure. Based on this result, an optimal joint communication and computation resource allocation algorithm is developed. To gain more insights, we also analyze a specific scenario where communication resource is adequate while computation resource is limited. In this special case, the closed-form solution of the piecewise optimization problem can be derived. Our proposed algorithms are finally verified by numerical results, which show that the novel partial compression offloading model can significantly reduce the end-to-end latency.

12 April 2023 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
QHQiyu Hu
Qiyu Hu
GZGuangyi Zhang
Guangyi Zhang
ZQZhijin Qin
Zhijin Qin
YCYunlong Cai
Yunlong Cai
Guanding YuGuanding Yu
Guanding Yu
GLGeoffrey Ye Li
Geoffrey Ye Li
Although semantic communications have exhibited satisfactory performance on a large number of tasks, the impact of semantic noise and the robustness of the systems have not been well investigated. Semantic noise refers to the misleading between the intended semantic symbols and received ones, thus causes the failure of tasks. In this paper, we first propose a framework for the robust end-to-end semantic communication systems to combat the semantic noise. In particular, we analyze sample-dependent and sample-independent semantic noise. To combat the semantic noise, the adversarial training with weight perturbation is developed to incorporate the samples with semantic noise in the training dataset. Then, we propose to mask a portion of the input, where the semantic noise appears frequently, and design the masked vector quantized-variational autoencoder (VQ-VAE) with the noise-related masking strategy. We use a discrete codebook shared by the transmitter and the receiver for encoded feature representation. To further improve the system robustness, we develop a feature importance module (FIM) to suppress the noise-related and task-unrelated features. Thus, the transmitter simply needs to transmit the indices of these important task-related features in the codebook. Simulation results show that the proposed method can be applied in many downstream tasks and significantly improve the robustness against semantic noise with remarkable reduction on the transmission overhead.

30 October 2020 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
QHQiyu Hu
Qiyu Hu
YCYunlong Cai
Yunlong Cai
QSQingjiang Shi
Qingjiang Shi
KXKaidi Xu
Kaidi Xu
Guanding YuGuanding Yu
Guanding Yu
ZDZhi Ding
Zhi Ding
Optimization theory assisted algorithms have received great attention for precoding design in multiuser multiple-input multiple-output (MU-MIMO) systems. Although the resultant optimization algorithms are able to provide excellent performance, they generally require considerable computational complexity, which gets in the way of their practical application in real-time systems. In this work, in order to address this issue, we first propose a framework for deep-unfolding, where a general form of iterative algorithm induced deep-unfolding neural network (IAIDNN) is developed in matrix form to better solve the problems in communication systems. Then, we implement the proposed deep-unfolding framework to solve the sum-rate maximization problem for precoding design in MU-MIMO systems. An efficient IAIDNN based on the structure of the classic weighted minimum mean-square error (WMMSE) iterative algorithm is developed. Specifically, the iterative WMMSE algorithm is unfolded into a layer-wise structure, where a number of trainable parameters are introduced to replace the high-complexity operations in the forward propagation. To train the network, a generalized chain rule of the IAIDNN is proposed to depict the recurrence relation of gradients between two adjacent layers in the back propagation. Moreover, we discuss the computational complexity and generalization ability of the proposed scheme. Simulation results show that the proposed IAIDNN efficiently achieves the performance of the iterative WMMSE algorithm with reduced computational complexity.

9 February 2024 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
GZGuangyi Zhang
Guangyi Zhang
QHQiyu Hu
Qiyu Hu
ZQZhijin Qin
Zhijin Qin
YCYunlong Cai
Yunlong Cai
Guanding YuGuanding Yu
Guanding Yu
XTXiaoming Tao
Xiaoming Tao
Task-oriented semantic communications have achieved significant performance gains. However, the employed deep neural networks in semantic communications have to be updated when the task is changed or multiple models need to be stored for performing different tasks. To address this issue, we develop a unified deep learning-enabled semantic communication system (U-DeepSC), where a unified end-to-end framework can serve many different tasks with multiple modalities of data. As the number of required features varies from task to task, we propose a vector-wise dynamic scheme that can adjust the number of transmitted symbols for different tasks. Moreover, our dynamic scheme can also adaptively adjust the number of transmitted features under different channel conditions to optimize the transmission efficiency. Particularly, we devise a lightweight feature selection module (FSM) to evaluate the importance of feature vectors, which can hierarchically drop redundant feature vectors and significantly accelerate the inference. To reduce the transmission overhead, we then design a unified codebook for feature representation to serve multiple tasks, where only the indices of these task-specific features in the codebook are transmitted. According to the simulation results, the proposed U-DeepSC achieves comparable performance to the task-oriented semantic communication system designed for a specific task but with significant reduction in both transmission overhead and model size.