Wanchen Hu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Wanchen Hu has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Jie Yang
Key Laboratory for Information Science of Electromagnetic Waves (MoE), College of Future Information Technology, Fudan University, Shanghai, China
5 shared publications - Yi Jiang
Key Laboratory for Information Science of Electromagnetic Waves (MoE), School of Information Science and Technology, Fudan University, Shanghai, China
4 shared publications - Shuangyang Li
Faculty of Electrical Engineering and Computer Science, Technical University of Berlin, Berlin, Germany
3 shared publications - Yu Zhu
Key Laboratory for Information Science of Electromagnetic Waves (MoE), College of Future Information Technology, Fudan University, Shanghai, China
3 shared publications - Giuseppe Caire
Technische Universität Berlin
2 shared publications - Xin Liang
Key Laboratory for Information Science of Electromagnetic Waves (MoE), School of Information Science and Technology, Fudan University, Shanghai, China
2 shared publications
Latest Publications
- 8 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25 (15361276) , 16480-16495
Communication-Centric ISAC Based on Zak-OTFS: A Novel Backpropagation Algorithm for Delay-Doppler Sensing
In this paper, we investigate delay-Doppler (DD) sensing in a communication-centric integrated sensing and communication (ISAC) framework based on Zak transform-based orthogonal time frequency space (Zak-OTFS) modulation. Specifically, we consider target sensing with communication waveforms and propose a novel backpropagation (BP) algorithm for multi-target DD parameter estimation. We formulate the radar sensing task as a maximum likelihood parameter estimation problem, which is highly non-convex. By exploiting the structural analogy between parameter estimation and neural network training, the BP algorithm treats the DD parameters as tunable network weights and efficiently computes their gradients via the chain rule, enabling accurate and parallelized estimation. To facilitate the algorithm implementation, a successive interference cancellation method based on DD domain twisted convolution is developed to obtain coarse DD estimates. Furthermore, a constant false alarm rate based dynamic merging strategy is introduced to adaptively estimate the number of targets during the BP process. Comprehensive theoretical analyses are conducted, including the derivation of the Cramér–Rao bound (CRB) for Zak-OTFS systems and performance evaluation under various challenging sensing scenarios. Simulation results demonstrate that the proposed algorithm achieves high estimation accuracy and validates the theoretical analysis.
- 8 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25 (15361276) , 16480-16495
Communication-Centric ISAC Based on Zak-OTFS: A Novel Backpropagation Algorithm for Delay-Doppler Sensing
In this paper, we investigate delay-Doppler (DD) sensing in a communication-centric integrated sensing and communication (ISAC) framework based on Zak transform-based orthogonal time frequency space (Zak-OTFS) modulation. Specifically, we consider target sensing with communication waveforms and propose a novel backpropagation (BP) algorithm for multi-target DD parameter estimation. We formulate the radar sensing task as a maximum likelihood parameter estimation problem, which is highly non-convex. By exploiting the structural analogy between parameter estimation and neural network training, the BP algorithm treats the DD parameters as tunable network weights and efficiently computes their gradients via the chain rule, enabling accurate and parallelized estimation. To facilitate the algorithm implementation, a successive interference cancellation method based on DD domain twisted convolution is developed to obtain coarse DD estimates. Furthermore, a constant false alarm rate based dynamic merging strategy is introduced to adaptively estimate the number of targets during the BP process. Comprehensive theoretical analyses are conducted, including the derivation of the Cramér–Rao bound (CRB) for Zak-OTFS systems and performance evaluation under various challenging sensing scenarios. Simulation results demonstrate that the proposed algorithm achieves high estimation accuracy and validates the theoretical analysis.
- 6 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 44 (07338716) , 3557-3574
Complexity-Scalable Near-Optimal Transceiver Design for Massive MIMO-BICM Systems
The 6th generation (6G) and future wireless networks are envisioned to employ multiple-input multiple-output (MIMO) transmissions with large array sizes, and therefore, the adoption of complexity-scalable transceiver becomes crucial. In this paper, we propose a novel complexity-scalable transceiver design for MIMO systems exploiting bit-interleaved coded modulation (termed MIMO-BICM systems). The proposed scheme leverages the channel bidiagonalization decomposition (CBD), based on which an optimization framework for the precoder and post-processor is developed for maximizing the mutual information (MI) with finite-alphabet inputs. Particularly, we unveil that the desired precoder and post-processor behave distinctively different with respect to the operating signal-to-noise ratio (SNR), where the equivalent channel condition number (ECCN) serves as an effective indicator for the overall achievable rate performance. Specifically, at low SNRs, diagonal transmission with a large ECCN is advantageous, while at high SNRs, uniform subchannel gains with a small ECCN are preferred. This allows us to further propose a low-complexity generalized parallel CBD design (GP-CBD) based on the Givens rotation according to a well-approximated closed-form performance metric on the achievable rates that takes into account the insights from the ECCN. Numerical results validate the superior performance of the proposed scheme in terms of achievable rate and bit error rate (BER), compared to state-of-the-art designs across various modulation and coding schemes (MCSs).
- 6 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 44 (07338716) , 3557-3574
Complexity-Scalable Near-Optimal Transceiver Design for Massive MIMO-BICM Systems
The 6th generation (6G) and future wireless networks are envisioned to employ multiple-input multiple-output (MIMO) transmissions with large array sizes, and therefore, the adoption of complexity-scalable transceiver becomes crucial. In this paper, we propose a novel complexity-scalable transceiver design for MIMO systems exploiting bit-interleaved coded modulation (termed MIMO-BICM systems). The proposed scheme leverages the channel bidiagonalization decomposition (CBD), based on which an optimization framework for the precoder and post-processor is developed for maximizing the mutual information (MI) with finite-alphabet inputs. Particularly, we unveil that the desired precoder and post-processor behave distinctively different with respect to the operating signal-to-noise ratio (SNR), where the equivalent channel condition number (ECCN) serves as an effective indicator for the overall achievable rate performance. Specifically, at low SNRs, diagonal transmission with a large ECCN is advantageous, while at high SNRs, uniform subchannel gains with a small ECCN are preferred. This allows us to further propose a low-complexity generalized parallel CBD design (GP-CBD) based on the Givens rotation according to a well-approximated closed-form performance metric on the achievable rates that takes into account the insights from the ECCN. Numerical results validate the superior performance of the proposed scheme in terms of achievable rate and bit error rate (BER), compared to state-of-the-art designs across various modulation and coding schemes (MCSs).
- 23 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 30 (10897798) , 627-631
Large Language Models for Beam Prediction Under the mmWave Massive MIMO Hybrid-Field Channels
Millimeter-wave (mmWave) technology is a key enabling technology for next-generation wireless communications. However, beam prediction (BP) in millimeter-wave massive multiple-input multiple-output (MIMO) systems is challenging in high mobility scenarios, especially in non-stationary time-varying hybrid-field channels. In this case, the number of multi paths, time delay, angle of departure (AoD), Doppler offset, and the propagation distance vary simultaneously at different time instants. In this paper, we introduce a BP framework leveraging generative large language models (LLM), specifically GPT-2. The proposed BP-GPT approach utilizes historical channel state information (CSI) to predict optimal beamforming vectors that maximize spectral efficiency in these non-stationary time-varying hybrid-field conditions. Extensive simulations demonstrate the superior performance and robustness of BP-GPT over conventional neural network-based methods.
- 23 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 30 (10897798) , 627-631
Large Language Models for Beam Prediction Under the mmWave Massive MIMO Hybrid-Field Channels
Millimeter-wave (mmWave) technology is a key enabling technology for next-generation wireless communications. However, beam prediction (BP) in millimeter-wave massive multiple-input multiple-output (MIMO) systems is challenging in high mobility scenarios, especially in non-stationary time-varying hybrid-field channels. In this case, the number of multi paths, time delay, angle of departure (AoD), Doppler offset, and the propagation distance vary simultaneously at different time instants. In this paper, we introduce a BP framework leveraging generative large language models (LLM), specifically GPT-2. The proposed BP-GPT approach utilizes historical channel state information (CSI) to predict optimal beamforming vectors that maximize spectral efficiency in these non-stationary time-varying hybrid-field conditions. Extensive simulations demonstrate the superior performance and robustness of BP-GPT over conventional neural network-based methods.
- 1 November 2025
- Published by Elsevier in Signal Processing
- Vol. 240
Joint low-complexity precoding and iterative soft detection for MIMO-BICM systems
- 1 November 2025
- Published by Elsevier in Signal Processing
- Vol. 240
Joint low-complexity precoding and iterative soft detection for MIMO-BICM systems
- 27 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (5) , 7688-7702
Data-Assisted Channel Estimation and Prediction Using CRB-KF for mmWave Communications
This paper proposes a novel channel estimation and prediction framework for millimeter-wave (mmWave) communications. For time-invariant channels, we develop the fast Fourier transform - gradient descent (FFT-GD) algorithm, leveraging the channel sparsity to efficiently estimate the parameters, including the angles-of-arrival (AoAs) and the complex gains. To enhance estimation accuracy, we propose the data-assisted FFT-GD (DAFG) algorithm, which jointly performs data detection and channel estimation within an expectation-maximization (EM) framework. For time-variant channels, we innovate with a Cramér-Rao bound Kalman filter (CRB-KF)-based DAFG algorithm, incorporating an autoregressive (AR) model to exploit temporal correlations of the parameters for channel prediction. This approach effectively addresses the nonlinearity challenge associated with mmWave channel parameters, resulting in improved estimation accuracy. Simulation results show that both FFT-GD and DAFG methods approach the CRB, and the CRB-KF-based DAFG maintains channel estimation accuracy across multiple frames.
- 27 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (5) , 7688-7702
Data-Assisted Channel Estimation and Prediction Using CRB-KF for mmWave Communications
This paper proposes a novel channel estimation and prediction framework for millimeter-wave (mmWave) communications. For time-invariant channels, we develop the fast Fourier transform - gradient descent (FFT-GD) algorithm, leveraging the channel sparsity to efficiently estimate the parameters, including the angles-of-arrival (AoAs) and the complex gains. To enhance estimation accuracy, we propose the data-assisted FFT-GD (DAFG) algorithm, which jointly performs data detection and channel estimation within an expectation-maximization (EM) framework. For time-variant channels, we innovate with a Cramér-Rao bound Kalman filter (CRB-KF)-based DAFG algorithm, incorporating an autoregressive (AR) model to exploit temporal correlations of the parameters for channel prediction. This approach effectively addresses the nonlinearity challenge associated with mmWave channel parameters, resulting in improved estimation accuracy. Simulation results show that both FFT-GD and DAFG methods approach the CRB, and the CRB-KF-based DAFG maintains channel estimation accuracy across multiple frames.
- 1 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (12) , 14931-14944
Parametric MIMO-OFDM Channel Estimation: A Quasi Neural Network Approach
This paper presents a quasi-neural network (Quasi-NN) approach for parametric channel estimation in multi-input multi-output orthogonal frequency division multiplexing (MIMO-OFDM) systems. A unified Quasi-NN framework is proposed for both the single-user (SU) and the multi-user (MU) scenarios, enabling the joint estimation of the direction of arrival, direction of departure, time delay, complex gain, and the number of multipaths. The artificial neural network-like structure of the Quasi-NN allows the application of the backpropagation algorithm while requiring only real-time pilot signals for online network training. Furthermore, considering the issue of high pilot overhead in MU MIMO-OFDM systems, we develop a location assisted Quasi-NN (LA-QNN) that utilizes a location-parameter database to reduce the pilot overhead while maintaining accurate channel estimation. Simulation results show that the proposed Quasi-NN approaches the Cramér Rao bound, and the proposed LA-QNN scheme provides a better balance between channel estimation performance and pilot overhead in the MU scenario.
- 1 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (12) , 14931-14944
Parametric MIMO-OFDM Channel Estimation: A Quasi Neural Network Approach
This paper presents a quasi-neural network (Quasi-NN) approach for parametric channel estimation in multi-input multi-output orthogonal frequency division multiplexing (MIMO-OFDM) systems. A unified Quasi-NN framework is proposed for both the single-user (SU) and the multi-user (MU) scenarios, enabling the joint estimation of the direction of arrival, direction of departure, time delay, complex gain, and the number of multipaths. The artificial neural network-like structure of the Quasi-NN allows the application of the backpropagation algorithm while requiring only real-time pilot signals for online network training. Furthermore, considering the issue of high pilot overhead in MU MIMO-OFDM systems, we develop a location assisted Quasi-NN (LA-QNN) that utilizes a location-parameter database to reduce the pilot overhead while maintaining accurate channel estimation. Simulation results show that the proposed Quasi-NN approaches the Cramér Rao bound, and the proposed LA-QNN scheme provides a better balance between channel estimation performance and pilot overhead in the MU scenario.
- 14 June 2025
- Published by Elsevier in Signal Processing
- Vol. 238
Phase rotated uniform channel decomposition for MIMO-OFDM communications
- 14 June 2025
- Published by Elsevier in Signal Processing
- Vol. 238
Phase rotated uniform channel decomposition for MIMO-OFDM communications
- 7 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 12 (1) , 163-167
Channel Bi-Diagonalization for MIMO Communications
This letter proposes a multi-input multi-output (MIMO) transceiver design termed channel bi-diagonalization (CBD), whose precoder and equalizer bi-diagonalize the channel matrix. By representing the bidiagonal MIMO channel with a trellis diagram, we can apply the Viterbi algorithm for the maximum likelihood (ML) detection and decoding, or the BCJR algorithm for the maximum a posteriori (MAP) detection and decoding, which drastically simplifies the optimal MIMO communications. Simulation results verify the superior performance of the proposed CBD scheme.
- 7 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 12 (1) , 163-167
Channel Bi-Diagonalization for MIMO Communications
This letter proposes a multi-input multi-output (MIMO) transceiver design termed channel bi-diagonalization (CBD), whose precoder and equalizer bi-diagonalize the channel matrix. By representing the bidiagonal MIMO channel with a trellis diagram, we can apply the Viterbi algorithm for the maximum likelihood (ML) detection and decoding, or the BCJR algorithm for the maximum a posteriori (MAP) detection and decoding, which drastically simplifies the optimal MIMO communications. Simulation results verify the superior performance of the proposed CBD scheme.