Yufan Zhou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yufan Zhou has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- An Liu
Zhejiang University
4 shared publications - Baishuo Lin
College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China
1 shared publication - Kaiyuan Tian
State Key Laboratory of Advanced Optical Communication Systems and Networks, School of Electronics, Peking University, Beijing, China
1 shared publication - Wenkang Xu
College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China
1 shared publication Yani Chi
China Academy of Information and Communications Technology, Beijing, China
1 shared publicationYongbo Xiao
Zhejiang University
1 shared publication
Latest Publications
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25, 22987-23001
A Group-Wise Narrow Beam Design for Uplink Channel Estimation in Hybrid Beamforming Systems
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25, 22987-23001
A Group-Wise Narrow Beam Design for Uplink Channel Estimation in Hybrid Beamforming Systems
- 19 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 14 (11) , 3670-3674
Hybrid Beamforming Optimization for Robust Uplink Channel Tracking in Massive MIMO Systems
Hybrid beamforming (HBF) with partially connected antenna structure (PCAS) is crucial for enhancing the capacity and efficiency of massive MIMO with an affordable hardware cost and power consumption. However, the highly compressed measurements pose challenges for channel estimation, emphasizing the need to optimize the HBF for improved channel estimation performance. This letter introduces a novel optimization algorithm for HBF during channel estimation, incorporating the Cramér-Rao bound (CRB) and mutual information (MI) in the objective function to account for both established and emerging propagation paths. Simulations demonstrate that the proposed design significantly enhances channel tracking accuracy compared to various baseline schemes.
- 19 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 14 (11) , 3670-3674
Hybrid Beamforming Optimization for Robust Uplink Channel Tracking in Massive MIMO Systems
Hybrid beamforming (HBF) with partially connected antenna structure (PCAS) is crucial for enhancing the capacity and efficiency of massive MIMO with an affordable hardware cost and power consumption. However, the highly compressed measurements pose challenges for channel estimation, emphasizing the need to optimize the HBF for improved channel estimation performance. This letter introduces a novel optimization algorithm for HBF during channel estimation, incorporating the Cramér-Rao bound (CRB) and mutual information (MI) in the objective function to account for both established and emerging propagation paths. Simulations demonstrate that the proposed design significantly enhances channel tracking accuracy compared to various baseline schemes.
- 14 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25 (15361276) , 802-814
Scattering Environment Aware Joint Multi-User Channel Estimation and Localization With Spatially Reused Pilots
The growing number of users leads to an increase in pilot overhead, while the constraint of limited pilot resources poses a challenge in supporting all users with orthogonal pilots. By exploiting the spatial characteristics of the multi-user (MU) environment, it is possible to reduce pilot costs and improve the channel estimation performance. In practical scenarios, nearby users often share the same scatterers, whereas users situated farther apart tend to exhibit orthogonal channels. This paper proposes a two-timescale approach for joint MU channel estimation and localization, modeling the MU channel in the 3-D location-domain. In the long-timescale phase, the positions of the scatterers are estimated through a scatterer association algorithm based on density-based spatial clustering of applications with noise (DBSCAN). This enables the base station to group users via a graph-coloring-based user grouping algorithm, achieving spatial division multiplexing of pilots and reducing overhead. In the short timescale phase, a low-complexity scattering environment aware location-domain turbo channel estimation (SEA-LD-TurboCE) algorithm integrates overlapping scatterer information to achieve precise MU channel estimation and localization under spatially reused pilots. Simulation results verify the superior channel estimation and localization performance of our proposed scheme over the baselines.
- 14 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25 (15361276) , 802-814
Scattering Environment Aware Joint Multi-User Channel Estimation and Localization With Spatially Reused Pilots
The growing number of users leads to an increase in pilot overhead, while the constraint of limited pilot resources poses a challenge in supporting all users with orthogonal pilots. By exploiting the spatial characteristics of the multi-user (MU) environment, it is possible to reduce pilot costs and improve the channel estimation performance. In practical scenarios, nearby users often share the same scatterers, whereas users situated farther apart tend to exhibit orthogonal channels. This paper proposes a two-timescale approach for joint MU channel estimation and localization, modeling the MU channel in the 3-D location-domain. In the long-timescale phase, the positions of the scatterers are estimated through a scatterer association algorithm based on density-based spatial clustering of applications with noise (DBSCAN). This enables the base station to group users via a graph-coloring-based user grouping algorithm, achieving spatial division multiplexing of pilots and reducing overhead. In the short timescale phase, a low-complexity scattering environment aware location-domain turbo channel estimation (SEA-LD-TurboCE) algorithm integrates overlapping scatterer information to achieve precise MU channel estimation and localization under spatially reused pilots. Simulation results verify the superior channel estimation and localization performance of our proposed scheme over the baselines.
- 24 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 73 (1053587X) , 781-794
Subspace Constrained Variational Bayesian Inference for Structured Compressive Sensing With a Dynamic Grid
We investigate the problem of recovering a structured sparse signal from a linear observation model with an uncertain dynamic grid in the sensing matrix. The state-of-the-art expectation maximization based compressed sensing (EM-CS) methods, such as turbo compressed sensing (Turbo-CS) and turbo variational Bayesian inference (Turbo-VBI), have a relatively slow convergence speed due to the double-loop iterations between the E-step and M-step. Moreover, each inner iteration in the E-step involves a high-dimensional matrix inverse in general, which is unacceptable for problems with large signal dimensions or real-time calculation requirements. Although there are some attempts to avoid the high-dimensional matrix inverse by majorization minimization, the convergence speed and accuracy are often sacrificed. To better address this problem, we propose an alternating estimation framework based on a novel subspace constrained VBI (SC-VBI) method, in which the high-dimensional matrix inverse is replaced by a low-dimensional subspace constrained matrix inverse (with the dimension equal to the sparsity level). We further prove the convergence of the SC-VBI to a stationary solution of the Kullback-Leibler divergence minimization problem. Simulations demonstrate that the proposed SC-VBI algorithm can achieve a much better tradeoff between complexity per iteration, convergence speed, and performance compared to the state-of-the-art algorithms.
- 24 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 73 (1053587X) , 781-794
Subspace Constrained Variational Bayesian Inference for Structured Compressive Sensing With a Dynamic Grid
We investigate the problem of recovering a structured sparse signal from a linear observation model with an uncertain dynamic grid in the sensing matrix. The state-of-the-art expectation maximization based compressed sensing (EM-CS) methods, such as turbo compressed sensing (Turbo-CS) and turbo variational Bayesian inference (Turbo-VBI), have a relatively slow convergence speed due to the double-loop iterations between the E-step and M-step. Moreover, each inner iteration in the E-step involves a high-dimensional matrix inverse in general, which is unacceptable for problems with large signal dimensions or real-time calculation requirements. Although there are some attempts to avoid the high-dimensional matrix inverse by majorization minimization, the convergence speed and accuracy are often sacrificed. To better address this problem, we propose an alternating estimation framework based on a novel subspace constrained VBI (SC-VBI) method, in which the high-dimensional matrix inverse is replaced by a low-dimensional subspace constrained matrix inverse (with the dimension equal to the sparsity level). We further prove the convergence of the SC-VBI to a stationary solution of the Kullback-Leibler divergence minimization problem. Simulations demonstrate that the proposed SC-VBI algorithm can achieve a much better tradeoff between complexity per iteration, convergence speed, and performance compared to the state-of-the-art algorithms.