Zhichao Shao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Zhichao Shao has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Rodrigo C. de Lamare
Centre for Telecommunications Studies, Pontifical Catholic University of Rio de Janeiro, Rio de Janeiro, Brazil
6 shared publications - Lukas T. N. Landau
Department of Electrical Engineering, Pontifical Catholic University of Rio de Janeiro, Rio de Janeiro, Brazil
3 shared publications - Xiaojun Yuan
University of Electronic Science and Technology of China
3 shared publications - Wence Zhang
School of computer, Jiangsu University, Zhenjiang, China
2 shared publications - Xu Bao
Jiangsu University
2 shared publications Ana Beatriz L. B. Fernandes
Centro de Estudos em Telecomunicaes, Pontifcia Universidade Catlica do Rio de Janeiro, Rio de Janeiro, Brazil
1 shared publication
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (11) , 29010-29014
On the EE-Optimal Hybrid Structure for mmWave Massive MIMO Systems
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (11) , 29010-29014
On the EE-Optimal Hybrid Structure for mmWave Massive MIMO Systems
- 10 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (11) , 24044-24056
A Low-Complexity Channel Knowledge Map Construction Based on Environmental Partitioning and Interpolation Weight Learning
The channel knowledge map (CKM) is an emerging technology for enabling future integrated sensing and communication (ISAC) services that have attracted significant research interests in recent years. Current methods for constructing CKM primarily include interpolation-based, model-based, and machine learning algorithms. However, these methods are often limited by their low-estimation accuracy or high-computational complexity. To address these challenges, we propose a novel approach to construct CKM based on environmental partitioning and interpolation weight learning (EPIWL). The proposed method leverages channel state information (CSI) from partially known locations to interpolate and estimate the channel state in the target region, thus completing the CKM construction. To reduce the computational complexity, we proposed a graph-based feature aggregation and community detection-based partitioning (GFA-CD-P) algorithm, which selects representative anchor points through environmental partitioning, thereby decreasing the computational load. Furthermore, we propose an interpolation weight learning scheme based on Kolmogorov–Arnold network (KAN) and multihead cross attention (MHCA), namely, KM-IWL algorithm, which automatically learn the weight between anchor points and target points, enhancing both the efficiency and accuracy of CKM construction. The experimental results demonstrate that the proposed EPIWL approach achieves a 10-dB improvement in the normalized mean squared error (NMSE) and reduces the computational complexity by over 60% compared with existing schemes, showcasing robust performance and excellent generalization capability.
- 10 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (11) , 24044-24056
A Low-Complexity Channel Knowledge Map Construction Based on Environmental Partitioning and Interpolation Weight Learning
The channel knowledge map (CKM) is an emerging technology for enabling future integrated sensing and communication (ISAC) services that have attracted significant research interests in recent years. Current methods for constructing CKM primarily include interpolation-based, model-based, and machine learning algorithms. However, these methods are often limited by their low-estimation accuracy or high-computational complexity. To address these challenges, we propose a novel approach to construct CKM based on environmental partitioning and interpolation weight learning (EPIWL). The proposed method leverages channel state information (CSI) from partially known locations to interpolate and estimate the channel state in the target region, thus completing the CKM construction. To reduce the computational complexity, we proposed a graph-based feature aggregation and community detection-based partitioning (GFA-CD-P) algorithm, which selects representative anchor points through environmental partitioning, thereby decreasing the computational load. Furthermore, we propose an interpolation weight learning scheme based on Kolmogorov–Arnold network (KAN) and multihead cross attention (MHCA), namely, KM-IWL algorithm, which automatically learn the weight between anchor points and target points, enhancing both the efficiency and accuracy of CKM construction. The experimental results demonstrate that the proposed EPIWL approach achieves a 10-dB improvement in the normalized mean squared error (NMSE) and reduces the computational complexity by over 60% compared with existing schemes, showcasing robust performance and excellent generalization capability.
- 9 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (11) , 17490-17502
Joint User Activity Detection, Channel Estimation, and Data Detection With Delay-Calibration for Asynchronous mMTC
This work considers uplink asynchronous massive machine-type communications (mMTC), where a large number of low-power and low-cost devices with sporadic activity patterns asynchronously transmit short packets to an access point (AP) equipped with multiple receive antennas. The asynchronous transmission reduces the required coordination between the activated devices and the AP, simplifying the transmitter design but making the receiver design more challenging. In this work, we propose a joint user activity detection, channel estimation, and data detection with delay-calibration (JUCED-DC) algorithm, and investigate the benefits of oversampling in estimating continuous-valued time delays at the receiver. The proposed JUCED-DC algorithm is based on the expectation-maximization (EM) method. In the expectation step of EM, a message passing based joint user activity detection, channel estimation, and data detection (JUCED) algorithm is proposed to obtain the posterior probabilities of channel and data; in the maximization step of EM, a greedy search based delay-calibration algorithm is utilized to update the time delays. We analyze the efficacy of the proposed JUCED algorithm through the Bayesian Cramér-Rao bound. Moreover, we propose to incorporate soft input and soft output decoding into the message passing of the JUCED algorithm to further improve the system's performance. Numerical results demonstrate the effectiveness of the proposed algorithms in terms of the normalized mean-squared errors of channel and data symbols, the bit error rate of data bits, and the probability of misdetection. Compared to the baseline methods, the proposed algorithms can achieve performance improvements of over 80%.
- 9 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (11) , 17490-17502
Joint User Activity Detection, Channel Estimation, and Data Detection With Delay-Calibration for Asynchronous mMTC
This work considers uplink asynchronous massive machine-type communications (mMTC), where a large number of low-power and low-cost devices with sporadic activity patterns asynchronously transmit short packets to an access point (AP) equipped with multiple receive antennas. The asynchronous transmission reduces the required coordination between the activated devices and the AP, simplifying the transmitter design but making the receiver design more challenging. In this work, we propose a joint user activity detection, channel estimation, and data detection with delay-calibration (JUCED-DC) algorithm, and investigate the benefits of oversampling in estimating continuous-valued time delays at the receiver. The proposed JUCED-DC algorithm is based on the expectation-maximization (EM) method. In the expectation step of EM, a message passing based joint user activity detection, channel estimation, and data detection (JUCED) algorithm is proposed to obtain the posterior probabilities of channel and data; in the maximization step of EM, a greedy search based delay-calibration algorithm is utilized to update the time delays. We analyze the efficacy of the proposed JUCED algorithm through the Bayesian Cramér-Rao bound. Moreover, we propose to incorporate soft input and soft output decoding into the message passing of the JUCED algorithm to further improve the system's performance. Numerical results demonstrate the effectiveness of the proposed algorithms in terms of the normalized mean-squared errors of channel and data symbols, the bit error rate of data bits, and the probability of misdetection. Compared to the baseline methods, the proposed algorithms can achieve performance improvements of over 80%.
- 31 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (8) , 12689-12702
User Activity Detection With Delay-Calibration for Asynchronous Massive Random Access
This work considers an uplink asynchronous massive random access scenario in which a large number of users asynchronously access a base station equipped with multiple receive antennas. The objective is to alleviate the problem of massive collision due to the limited number of orthogonal preambles of an access scheme in which user activity detection is performed. We propose a user activity detection with delay-calibration (UAD-DC) algorithm and investigate the benefits of oversampling for the estimation of continuous time delays at the receiver. The proposed algorithm iteratively estimates time delays and detects active users by noting that the collided users can be identified through accurate estimation of time delays. Due to the sporadic user activity patterns, the user activity detection problem can be formulated as a compressive sensing (CS) problem. It is solved by a modified Turbo-CS algorithm under the consideration of correlated noise samples resulting from oversampling. A sliding window technique is applied in the proposed algorithm to reduce the overall computational complexity. Moreover, we propose a new design for the pulse shaping filter by minimizing the Bayesian Cramér-Rao bound of the detection problem under the constraint of limited spectral bandwidth. Numerical results demonstrate the efficacy of the proposed algorithm in terms of the normalized mean squared error of the estimated channel, the probability of misdetection, and the successful detection ratio.
- 31 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (8) , 12689-12702
User Activity Detection With Delay-Calibration for Asynchronous Massive Random Access
This work considers an uplink asynchronous massive random access scenario in which a large number of users asynchronously access a base station equipped with multiple receive antennas. The objective is to alleviate the problem of massive collision due to the limited number of orthogonal preambles of an access scheme in which user activity detection is performed. We propose a user activity detection with delay-calibration (UAD-DC) algorithm and investigate the benefits of oversampling for the estimation of continuous time delays at the receiver. The proposed algorithm iteratively estimates time delays and detects active users by noting that the collided users can be identified through accurate estimation of time delays. Due to the sporadic user activity patterns, the user activity detection problem can be formulated as a compressive sensing (CS) problem. It is solved by a modified Turbo-CS algorithm under the consideration of correlated noise samples resulting from oversampling. A sliding window technique is applied in the proposed algorithm to reduce the overall computational complexity. Moreover, we propose a new design for the pulse shaping filter by minimizing the Bayesian Cramér-Rao bound of the detection problem under the constraint of limited spectral bandwidth. Numerical results demonstrate the efficacy of the proposed algorithm in terms of the normalized mean squared error of the estimated channel, the probability of misdetection, and the successful detection ratio.
- 12 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (8) , 8101-8116
Joint Localization and Information Transfer for Reconfigurable Intelligent Surface Aided Full-Duplex Systems
In this work, we investigate a reconfigurable intelligent surface (RIS) aided integrated sensing and communication scenario, where a base station (BS) communicates with multiple devices in a full-duplex mode, and senses the positions of these devices simultaneously. An RIS is assumed to be mounted on each device to enhance the reflected echoes. Meanwhile, the information of each device is passively transferred to the BS via reflection modulation. We aim to tackle the problem of joint localization and information retrieval at the BS. A grid based parametric model is constructed and the joint estimation problem is formulated as a compressive sensing problem. We propose a novel message-passing algorithm to solve the considered problem, and a progressive approximation method to reduce the computational complexity involved in the message passing. Moreover, an expectation-maximization (EM) algorithm is applied for tuning the grid parameters to mitigate the model mismatch problem. Finally, we analyze the efficacy of the proposed algorithm through the Bayesian Cramér-Rao bound. Numerical results demonstrate the feasibility of the proposed scheme and the superior performance of the proposed EM-based message-passing algorithm.
- 12 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (8) , 8101-8116
Joint Localization and Information Transfer for Reconfigurable Intelligent Surface Aided Full-Duplex Systems
In this work, we investigate a reconfigurable intelligent surface (RIS) aided integrated sensing and communication scenario, where a base station (BS) communicates with multiple devices in a full-duplex mode, and senses the positions of these devices simultaneously. An RIS is assumed to be mounted on each device to enhance the reflected echoes. Meanwhile, the information of each device is passively transferred to the BS via reflection modulation. We aim to tackle the problem of joint localization and information retrieval at the BS. A grid based parametric model is constructed and the joint estimation problem is formulated as a compressive sensing problem. We propose a novel message-passing algorithm to solve the considered problem, and a progressive approximation method to reduce the computational complexity involved in the message passing. Moreover, an expectation-maximization (EM) algorithm is applied for tuning the grid parameters to mitigate the model mismatch problem. Finally, we analyze the efficacy of the proposed algorithm through the Bayesian Cramér-Rao bound. Numerical results demonstrate the feasibility of the proposed scheme and the superior performance of the proposed EM-based message-passing algorithm.
- 14 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 71 (2) , 908-922
Multiuser-MIMO Systems Using Comparator Network-Aided Receivers With 1-Bit Quantization
Low-resolution analog-to-digital converters (ADCs) are promising for reducing energy consumption and costs of multiuser multiple-input multiple-output (MIMO) systems with many antennas. We propose low-resolution multiuser MIMO receivers where the signals are simultaneously processed by 1-bit ADCs and a comparator network, which can be interpreted as additional virtual channels with binary outputs. We distinguish the proposed comparator networks in fully and partially connected. For such receivers, we develop the low-resolution aware linear minimum mean-squared error (LRA-LMMSE) channel estimator and detector according to the Bussgang theorem. We also develop a robust detector which takes into account the channel state information (CSI) mismatch statistics. By exploiting knowledge of the channel coefficients we devise a mean-square error (MSE) greedy search and a sequential signal-to-interference-plus-noise ratio (SINR) search for optimization of partially connected networks. Numerical results show that a system with extra virtual channels can outperform a system with additional receive antennas, in terms of bit error rate (BER). Furthermore, by employing the proposed channel estimation with its error statistics, we construct a lower bound on the ergodic sum rate for a linear receiver. Simulation results confirm that the proposed approach outperforms the conventional 1-bit MIMO system in terms of BER, MSE and sum rate.
- 14 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 71 (2) , 908-922
Multiuser-MIMO Systems Using Comparator Network-Aided Receivers With 1-Bit Quantization
Low-resolution analog-to-digital converters (ADCs) are promising for reducing energy consumption and costs of multiuser multiple-input multiple-output (MIMO) systems with many antennas. We propose low-resolution multiuser MIMO receivers where the signals are simultaneously processed by 1-bit ADCs and a comparator network, which can be interpreted as additional virtual channels with binary outputs. We distinguish the proposed comparator networks in fully and partially connected. For such receivers, we develop the low-resolution aware linear minimum mean-squared error (LRA-LMMSE) channel estimator and detector according to the Bussgang theorem. We also develop a robust detector which takes into account the channel state information (CSI) mismatch statistics. By exploiting knowledge of the channel coefficients we devise a mean-square error (MSE) greedy search and a sequential signal-to-interference-plus-noise ratio (SINR) search for optimization of partially connected networks. Numerical results show that a system with extra virtual channels can outperform a system with additional receive antennas, in terms of bit error rate (BER). Furthermore, by employing the proposed channel estimation with its error statistics, we construct a lower bound on the ergodic sum rate for a linear receiver. Simulation results confirm that the proposed approach outperforms the conventional 1-bit MIMO system in terms of BER, MSE and sum rate.
- 12 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 69 (5) , 3423-3435
Dynamic Oversampling for 1-Bit ADCs in Large-Scale Multiple-Antenna Systems
In this work, large-scale multiple-antenna systems are investigated, where the base station employs a large antenna array with low-cost and low-power 1-bit analog-to-digital converters. To compensate for the performance loss caused by the coarse quantization, oversampling is applied at the receiver. Unlike existing works that use uniform oversampling, which samples the signal at a constant rate, a novel dynamic oversampling scheme is proposed. The basic idea is to perform time-varying nonuniform oversampling, which selects samples with nonuniform patterns that vary over time. We consider two system design criteria: a design that maximizes the achievable sum rate and another design that minimizes the mean square error of detected symbols. Dynamic oversampling is carried out using a dimension reduction matrix Δ, which can be computed by the generalized eigenvalue decomposition or by novel submatrix-level feature selection algorithms. Moreover, the proposed scheme is analyzed in terms of convergence, computational complexity and power consumption at the receiver. Simulations show that systems with the proposed dynamic oversampling outperform those with uniform oversampling in terms of computational cost, achievable sum rate and symbol error rate performance.
- 12 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 69 (5) , 3423-3435
Dynamic Oversampling for 1-Bit ADCs in Large-Scale Multiple-Antenna Systems
In this work, large-scale multiple-antenna systems are investigated, where the base station employs a large antenna array with low-cost and low-power 1-bit analog-to-digital converters. To compensate for the performance loss caused by the coarse quantization, oversampling is applied at the receiver. Unlike existing works that use uniform oversampling, which samples the signal at a constant rate, a novel dynamic oversampling scheme is proposed. The basic idea is to perform time-varying nonuniform oversampling, which selects samples with nonuniform patterns that vary over time. We consider two system design criteria: a design that maximizes the achievable sum rate and another design that minimizes the mean square error of detected symbols. Dynamic oversampling is carried out using a dimension reduction matrix Δ, which can be computed by the generalized eigenvalue decomposition or by novel submatrix-level feature selection algorithms. Moreover, the proposed scheme is analyzed in terms of convergence, computational complexity and power consumption at the receiver. Simulations show that systems with the proposed dynamic oversampling outperform those with uniform oversampling in terms of computational cost, achievable sum rate and symbol error rate performance.
- Open Access
- 4 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 85243-85256
Channel Estimation for Large-Scale Multiple-Antenna Systems Using 1-Bit ADCs and Oversampling
Large-scale multiple-antenna systems with large bandwidth are fundamental for future wireless communications, where the base station employs a large antenna array. In this scenario, one problem faced is the large energy consumption as the number of receive antennas scales up. Recently, low-resolution analog-to-digital converters (ADCs) have attracted much attention. Specifically, 1-bit ADCs are suitable for such systems due to their low cost and low energy consumption. This paper considers uplink large-scale multiple-antenna systems with 1-bit ADCs on each receive antenna. We investigate the benefits of using oversampling for channel estimation in terms of the mean square error and symbol error rate performance. In particular, low-resolution aware channel estimators are developed based on the Bussgang decomposition for 1-bit oversampled systems and analytical bounds on the mean square error are also investigated. Numerical results are provided to illustrate the performance of the proposed channel estimation algorithms and the derived theoretical bounds.
- 4 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 85243-85256
Open AccessChannel Estimation for Large-Scale Multiple-Antenna Systems Using 1-Bit ADCs and Oversampling
Large-scale multiple-antenna systems with large bandwidth are fundamental for future wireless communications, where the base station employs a large antenna array. In this scenario, one problem faced is the large energy consumption as the number of receive antennas scales up. Recently, low-resolution analog-to-digital converters (ADCs) have attracted much attention. Specifically, 1-bit ADCs are suitable for such systems due to their low cost and low energy consumption. This paper considers uplink large-scale multiple-antenna systems with 1-bit ADCs on each receive antenna. We investigate the benefits of using oversampling for channel estimation in terms of the mean square error and symbol error rate performance. In particular, low-resolution aware channel estimators are developed based on the Bussgang decomposition for 1-bit oversampled systems and analytical bounds on the mean square error are also investigated. Numerical results are provided to illustrate the performance of the proposed channel estimation algorithms and the derived theoretical bounds.
- Open Access
- 4 May 2018
- Published by Institution of Engineering and Technology (IET) in IET Communications
- Vol. 12 (9) , 1094-1101
Knowledge‐aided informed dynamic scheduling for LDPC decoding of short blocks
Low‐density parity‐check (LDPC) codes have excellent performance for a wide range of applications at reasonable complexity. LDPC codes with short blocks avoid the high latency of codes with large block lengths, making them potential candidates for ultra reliable low‐latency applications of future wireless standards. In this work, a novel informed dynamic scheduling (IDS) strategy for decoding LDPC codes, denoted reliability‐based residual belief propagation (Rel‐RBP), is developed by exploiting the reliability of the message and the residuals of the possible updates to choose the messages to be used by the decoding algorithm. A different measure for each iteration of the IDS schemes is also presented, which underlies the high cost of those algorithms in terms of computational complexity and motivates the development of the proposed strategy. Simulations show that Rel‐RBP speeds up the decoding at reduced complexity and results in error rate performance gains over prior work.
- 4 May 2018
- Published by Institution of Engineering and Technology (IET) in IET Communications
- Vol. 12 (9) , 1094-1101
Open AccessKnowledge‐aided informed dynamic scheduling for LDPC decoding of short blocks
Low‐density parity‐check (LDPC) codes have excellent performance for a wide range of applications at reasonable complexity. LDPC codes with short blocks avoid the high latency of codes with large block lengths, making them potential candidates for ultra reliable low‐latency applications of future wireless standards. In this work, a novel informed dynamic scheduling (IDS) strategy for decoding LDPC codes, denoted reliability‐based residual belief propagation (Rel‐RBP), is developed by exploiting the reliability of the message and the residuals of the possible updates to choose the messages to be used by the decoding algorithm. A different measure for each iteration of the IDS schemes is also presented, which underlies the high cost of those algorithms in terms of computational complexity and motivates the development of the proposed strategy. Simulations show that Rel‐RBP speeds up the decoding at reduced complexity and results in error rate performance gains over prior work.
- 27 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 7 (3) , 476-479
Iterative Detection and Decoding for Large-Scale Multiple-Antenna Systems With 1-Bit ADCs
We present a novel iterative detection and decoding scheme for uplink large-scale multiuser multiple-antenna systems. In order to reduce the receiver's energy consumption and computational complexity, 1-bit analog-to-digital converters are used in the front-end. The performance loss due to the 1-bit quantization can be mitigated by using large-scale antenna arrays. We propose a linear low-resolution-aware minimum mean square error detector for soft multiuser interference mitigation. Moreover, short block length low-density parity-check codes are considered for avoiding high latency. In the channel decoder, a quasi-uniform quantizer with scaling factors is devised to lower the error floor of low-density parity-check codes. Simulations show good performance of the system in terms of bit error rate as compared to prior work.
- 27 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 7 (3) , 476-479
Iterative Detection and Decoding for Large-Scale Multiple-Antenna Systems With 1-Bit ADCs
We present a novel iterative detection and decoding scheme for uplink large-scale multiuser multiple-antenna systems. In order to reduce the receiver's energy consumption and computational complexity, 1-bit analog-to-digital converters are used in the front-end. The performance loss due to the 1-bit quantization can be mitigated by using large-scale antenna arrays. We propose a linear low-resolution-aware minimum mean square error detector for soft multiuser interference mitigation. Moreover, short block length low-density parity-check codes are considered for avoiding high latency. In the channel decoder, a quasi-uniform quantizer with scaling factors is devised to lower the error floor of low-density parity-check codes. Simulations show good performance of the system in terms of bit error rate as compared to prior work.