Zhongtao Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zhongtao Chen has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Yik-Chung Wu
Department of Electrical and Electronic Engineering, The University of Hong Kong, Pokfulam, Hong Kong
2 shared publications Bingyang Cheng
Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong, China
1 shared publication- Bo Ai
Beijing Jiaotong University
1 shared publication - Bokai Xu
State Key Laboratory of Advanced Rail Autonomous Operation, Beijing Jiaotong University, Beijing, China
1 shared publication - Harold Vincent Poor
Princeton University
1 shared publication - Jiayi Zhang
School of Electronic and Information Engineering and the Frontiers Science Center for Smart High-Speed Railway System, Beijing Jiaotong University, Beijing, China
1 shared publication
Latest Publications
- 23 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 74 (1053587X) , 654-669
Rank-Revealing Bayesian Block-Term Tensor Completion With Graph Information
Block-term decomposition (BTD), particularly its rank-(Lr,Lr, 1) special case, is widely used in signal processing. Traditional methods for computing BTD either unrealistically assume the number of blocks and block ranks are known or require exhaustive tuning of these parameters. While sparsity-promoting regularization has been introduced to estimate these parameters more efficiently, it still requires regularization parameter tuning. Bayesian learning addresses these issues by employing sparsity-promoting priors on the number of blocks and block ranks, but so far is limited to fully observed BTD tensors. To process incomplete BTD tensors, only a few optimization-based methods have been proposed, and they continue to suffer from heavy parameter tuning. To enable tuning-free BTD completion, a prior that simultaneously enforces block-wise sparsity and withinblock column-wise sparsity while incorporating graph structure is introduced within the Bayesian framework. Besides theoretically establishing the legitimacy of the prior distribution, a mean-field design is developed to obtain a closed-form updating variational inference (VI) algorithm without loss of graph information. Extensive experiments on both synthetic datasets and real-world datasets demonstrate the superiority of the proposed method over existing optimization-based algorithms and the Bayesian model without graph information, in terms of rank learning, tensor recovery, and factor recovery.
- 23 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 74 (1053587X) , 654-669
Rank-Revealing Bayesian Block-Term Tensor Completion With Graph Information
Block-term decomposition (BTD), particularly its rank-(Lr,Lr, 1) special case, is widely used in signal processing. Traditional methods for computing BTD either unrealistically assume the number of blocks and block ranks are known or require exhaustive tuning of these parameters. While sparsity-promoting regularization has been introduced to estimate these parameters more efficiently, it still requires regularization parameter tuning. Bayesian learning addresses these issues by employing sparsity-promoting priors on the number of blocks and block ranks, but so far is limited to fully observed BTD tensors. To process incomplete BTD tensors, only a few optimization-based methods have been proposed, and they continue to suffer from heavy parameter tuning. To enable tuning-free BTD completion, a prior that simultaneously enforces block-wise sparsity and withinblock column-wise sparsity while incorporating graph structure is introduced within the Bayesian framework. Besides theoretically establishing the legitimacy of the prior distribution, a mean-field design is developed to obtain a closed-form updating variational inference (VI) algorithm without loss of graph information. Extensive experiments on both synthetic datasets and real-world datasets demonstrate the superiority of the proposed method over existing optimization-based algorithms and the Bayesian model without graph information, in terms of rank learning, tensor recovery, and factor recovery.
- 30 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 14 (9) , 2957-2961
Channel Estimation for Rydberg Atomic Receivers
The rapid development of the quantum technology presents huge opportunities for 6G communications. Leveraging the quantum properties of highly excited Rydberg atoms, Rydberg atom-based antennas present distinct advantages, such as high sensitivity, broad frequency range, and compact size, over traditional antennas. To realize efficient precoding, accurate channel state information is essential. However, due to the distinct characteristics of atomic receivers, traditional channel estimation algorithms developed for conventional receivers are no longer applicable. To this end, we propose a novel channel estimation algorithm based on projection gradient descent (PGD), which is applicable to both one-dimensional (1D) and two-dimensional (2D) arrays. Simulation results are provided to show the effectiveness of our proposed channel estimation method.
- 30 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 14 (9) , 2957-2961
Channel Estimation for Rydberg Atomic Receivers
The rapid development of the quantum technology presents huge opportunities for 6G communications. Leveraging the quantum properties of highly excited Rydberg atoms, Rydberg atom-based antennas present distinct advantages, such as high sensitivity, broad frequency range, and compact size, over traditional antennas. To realize efficient precoding, accurate channel state information is essential. However, due to the distinct characteristics of atomic receivers, traditional channel estimation algorithms developed for conventional receivers are no longer applicable. To this end, we propose a novel channel estimation algorithm based on projection gradient descent (PGD), which is applicable to both one-dimensional (1D) and two-dimensional (2D) arrays. Simulation results are provided to show the effectiveness of our proposed channel estimation method.