Kuo Cao

Kuo Cao


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
20 June 2022 in Entropy
Verified
Journal Article
Open access
PDF file
SJShengteng Jiang
Shengteng Jiang
YLYueling Liu
Yueling Liu
YZYichi Zhang
Yichi Zhang
PLPeng Luo
Peng Luo
KCKuo Cao
Kuo Cao
JWJibo Wei
Jibo Wei
Semantic communication is a promising technology used to overcome the challenges of large bandwidth and power requirements caused by the data explosion. Semantic representation is an important issue in semantic communication. The knowledge graph, powered by deep learning, can improve the accuracy of semantic representation while removing semantic ambiguity. Therefore, we propose a semantic communication system based on the knowledge graph. Specifically, in our system, the transmitted sentences are converted into triplets by using the knowledge graph. Triplets can be viewed as basic semantic symbols for semantic extraction and restoration and can be sorted based on semantic importance. Moreover, the proposed communication system adaptively adjusts the transmitted contents according to channel quality and allocates more transmission resources to important triplets to enhance communication reliability. Simulation results show that the proposed system significantly enhances the reliability of the communication in the low signal-to-noise regime compared to the traditional schemes.

18 February 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
DGDengke Guo
Dengke Guo
KCKuo Cao
Kuo Cao
JXJun Xiong
Jun Xiong
DMDongtang Ma
Dongtang Ma
HZHaiao Zhao
Haiao Zhao
Devices in the Internet of Things (IoT) are usually limited in computing resources and energy capacity, which means that encryption schemes with higher complexity are not suitable for them to ensure secure communication. As a promising solution to this problem, physical layer key generation suggests that shared secret keys can be generated from noisy wireless channel measurements to enhance the security of wireless communications. In this article, we propose a key generation scheme with extremely low implementation complexity, which allows physical layer key generation to be implemented on IoT nodes. First, we preprocess the channel measurements with simple moving average filtering before quantization to improve channel reciprocity. Next, a bidirectional difference quantization scheme is proposed to realize reliable quantization of channel measurements, which is ingenious in that the quantization process does not depend on quantization thresholds, and thus, the mismatched key bits caused by measurements close to quantization thresholds can be effectively avoided. Then, we propose an improved Cascade protocol to achieve lightweight and efficient information reconciliation. The simulation results show that our scheme can well balance the reliability and efficiency of key generation, and has excellent performance in terms of implementation complexity and key randomness.

6 July 2021 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
KMKai Mei
Kai Mei
JLJun Liu
Jun Liu
XZXiaoying Zhang
Xiaoying Zhang
KCKuo Cao
Kuo Cao
NRNandana Rajatheva
Nandana Rajatheva
JWJibo Wei
Jibo Wei
In this paper, we devise a highly efficient machine learning-based channel estimation for orthogonal frequency division multiplexing (OFDM) systems, in which the training of the estimator is performed online. A simple learning module is employed for the proposed learning-based estimator. The training process is thus much faster and the required training data is reduced significantly. Besides, a training data construction approach utilizing least square (LS) estimation results is proposed so that the training data can be collected during the data transmission. The feasibility of this novel construction approach is verified by theoretical analysis and simulations. Based on this construction approach, two alternative training data generation schemes are proposed. One scheme transmits additional block pilot symbols to create training data, while the other scheme adopts a decision-directed method and does not require extra pilot overhead. Simulation results show the robustness of the proposed channel estimation method. Furthermore, the proposed method shows better adaptation to practical imperfections compared with the conventional minimum mean-square error (MMSE) channel estimation. It outperforms the existing machine learning-based channel estimation techniques under varying channel conditions.

23 February 2017 in IEEE Access
Verified
Journal Article
Open access
KCKuo Cao
Kuo Cao
YWYongpeng Wu
Yongpeng Wu
YCYueming Cai
Yueming Cai
WYWeiwei Yang
Weiwei Yang
This paper considers secure transmission with the aid of a helper for finite alphabet signals in multiple-input-multiple-output multiple antenna eavesdropper networks, where the helper transmits a jamming signal along with the confidential message sent by the source node to confuse the eavesdropper. For the scenario in which the only statistical channel-state-information (CSI) of the eavesdropper links is available at the transmitter, the ergodic secrecy rate lacks closed-form expression, and the evaluation of the ergodic secrecy rate is computationally prohibitive. To address this problem, an accurate approximation of the ergodic secrecy rate is proposed to reduce the computational complexity. Utilizing this approximation of the ergodic secrecy rate, the joint optimization of precoding design and power allocation between the source and the helper is investigated to improve the ergodic secrecy rate. Furthermore, to achieve a tradeoff between computational complexity and performance, low-complexity schemes without iteration are proposed based on the analysis at extreme signal-to-noise ratio (SNR). In the low SNR regime, we prove that it is optimal to transmit confidential messages with full power, and the beamforming design is the first-order optimal precoder. At high SNR, we transform the problem of precoding design into a semi-definite programming problem, which can be efficiently solved by the interior-point method.

21 March 2018 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
KCKuo Cao
Kuo Cao
YCYueming Cai
Yueming Cai
Yongpeng WuYongpeng Wu
Yongpeng Wu
WYWeiwei Yang
Weiwei Yang
This paper considers secure communication for amplify-and-forward (AF) relay networks with finite alphabet input. The joint optimization of power selection and beamforming design for improving the physical layer security of AF relay networks with single and multiple eavesdroppers is investigated. For the case with one eavesdropper, we transform the problem of multi-variable beamforming design into a single-variable optimization problem through semi-definite programming and solve it with one-dimensional optimization techniques. Moreover, the corresponding source power is obtained by utilizing the relation between the mutual information and minimum mean square error. Then, an iterative two-step algorithm is proposed to maximize the achievable secrecy rate. In the presence of multiple eavesdroppers, a zero-forcing beamforming scheme, where the confidential signal is nulled out in the direction of all eavesdroppers, is proposed to enhance the physical layer security. We decouple the source power and the beamforming vector by transforming the achievable secrecy rate into a single-variable function of the source power. Then, the suboptimal source power and the corresponding beamforming vector with low-complexity are derived. Numerical examples show that the proposed schemes significantly enhance the secrecy performance of the AF relay networks.

12 January 2018 in IEEE Access
Verified
Journal Article
Open access
KCKuo Cao
Kuo Cao
YCYueming Cai
Yueming Cai
YWYongpeng Wu
Yongpeng Wu
WYWeiwei Yang
Weiwei Yang
XGXinrong Guan
Xinrong Guan
This paper considers secure transmission design for multiple-input-single-output (MISO) multiple multi-antenna eavesdroppers networks with finite alphabet inputs. To improve the achievable secrecy rate, the joint optimization of beamforming vector and transmitting power is studied. We transform the multi-variable problem into a single-variable problem, and then derive the beamforming vector and the transmitting power using one-dimensional search method. Specially, the secure transmission designs in the extremely signal-to-noise ratio (SNR) regime are investigated. In the low SNR regime, the problem of beamforming design is transformed into a semidefinite programming problem, which can be handled by interiorpoint- based methods, and the optimal transmitting power is obtained. Besides, two different secure schemes, which are zeroforce beamforming scheme and joint beamforming and jamming scheme, are proposed to increase the achievable secrecy rate at high SNR. Numerical results demonstrate that the proposed schemes significantly improve the secrecy performance of the system.