Peng Wang
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
Peng Wang has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Aihua Zhang
School of Information and Communication Engineering, Zhongyuan University of Technology, Zhengzhou, China
1 shared publication - Bing Ning
School of Information and Communication Engineering, Zhongyuan University of Technology, Zhengzhou, China
1 shared publication - Bule Sun
Beijing Key Laboratory of Mobile Computing and Pervasive Device and the Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, China, and University of Chinese Academy of Sciences, Beijing 100049, China
1 shared publication - Hua Li
School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China
1 shared publication - Jianjun Li
School of Information and Communication Engineering, Zhongyuan University of Technology, Zhengzhou, China
1 shared publication - Lintao Li
School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China
1 shared publication
Latest Publications
- 10 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (3) , 4205-4217
A Graph-Based Theoretical Framework and Performance Analysis of Pattern Division Random Access
This paper investigates the theoretical foundations and practical benefits of pattern division random access (PDRA) within the massive multiple input multiple output (MIMO) assisted grant-free paradigm. PDRA leverages the superposition or finite-field operations of orthogonal/quasi-orthogonal structural building blocks to provide substantial pilot diversity, thereby effectively mitigating pilot collisions. We characterize PDRA through a random uniform graph process, establishing a novel connection between PDRA and decoding of graph-based codes. Theoretical performance limits are derived for the per-user probability of error (PUPE), quantifying user distinguishability during channel estimation. Furthermore, we conduct a detailed PUPE performance analysis of the PDRA scheme with successive interference cancellation (PDRA-SIC) in the finite-blocklength regime, demonstrating its capability to efficiently resolve collisions and mitigate interference. The analysis shows that PDRA-SIC achieves significantly improved PUPE performance compared to conventional single-pilot schemes in massive ultra-reliable low-latency communication (mURLLC) scenarios, underscoring its practical potential for next-generation wireless systems.
- 10 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (3) , 4205-4217
A Graph-Based Theoretical Framework and Performance Analysis of Pattern Division Random Access
This paper investigates the theoretical foundations and practical benefits of pattern division random access (PDRA) within the massive multiple input multiple output (MIMO) assisted grant-free paradigm. PDRA leverages the superposition or finite-field operations of orthogonal/quasi-orthogonal structural building blocks to provide substantial pilot diversity, thereby effectively mitigating pilot collisions. We characterize PDRA through a random uniform graph process, establishing a novel connection between PDRA and decoding of graph-based codes. Theoretical performance limits are derived for the per-user probability of error (PUPE), quantifying user distinguishability during channel estimation. Furthermore, we conduct a detailed PUPE performance analysis of the PDRA scheme with successive interference cancellation (PDRA-SIC) in the finite-blocklength regime, demonstrating its capability to efficiently resolve collisions and mitigate interference. The analysis shows that PDRA-SIC achieves significantly improved PUPE performance compared to conventional single-pilot schemes in massive ultra-reliable low-latency communication (mURLLC) scenarios, underscoring its practical potential for next-generation wireless systems.
- 1 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 28 (2) , 417-421
Two-Stage Based Partial Online Optimization Channel Prediction for Massive MIMO in High-Mobility
In 5G massive multiple-input multiple-output (MIMO) systems, to decrease the pilot overhead, the pilot symbols are not transmitted in every slot, where the slot is the smallest resource allocation unit consisting of several OFDM symbols. For the channel state information (CSI) of the slots without pilot symbols, the channel prediction methods are needed. Although the existing channel prediction methods with online training or optimization can dynamically capture the changing channel in high mobility, abundant additional pilot symbols are required, which aggravate the pilot overhead. In this letter, without any additional pilot symbols, the partial online optimization channel prediction based on two-stage is proposed. In the first stage, with several historical CSI of the slots with pilot symbols, the CSI of the next slot in which the pilot symbols will be transmitted is predicted in advance. By reusing the existing pilot symbols in every several slots, the model parameters can keep being online optimized. In the second stage, combing the predicted CSI in the first stage and the CSI of few previous slots in which the pilot symbols were transmitted, the CSI of the slots without pilot symbols can be predicted via the interpolation operation. Numerical simulation results show that the proposed architecture can achieve high accurate channel prediction in high mobility scenarios without any additional pilot overhead.
- 1 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 28 (2) , 417-421
Two-Stage Based Partial Online Optimization Channel Prediction for Massive MIMO in High-Mobility
In 5G massive multiple-input multiple-output (MIMO) systems, to decrease the pilot overhead, the pilot symbols are not transmitted in every slot, where the slot is the smallest resource allocation unit consisting of several OFDM symbols. For the channel state information (CSI) of the slots without pilot symbols, the channel prediction methods are needed. Although the existing channel prediction methods with online training or optimization can dynamically capture the changing channel in high mobility, abundant additional pilot symbols are required, which aggravate the pilot overhead. In this letter, without any additional pilot symbols, the partial online optimization channel prediction based on two-stage is proposed. In the first stage, with several historical CSI of the slots with pilot symbols, the CSI of the next slot in which the pilot symbols will be transmitted is predicted in advance. By reusing the existing pilot symbols in every several slots, the model parameters can keep being online optimized. In the second stage, combing the predicted CSI in the first stage and the CSI of few previous slots in which the pilot symbols were transmitted, the CSI of the slots without pilot symbols can be predicted via the interpolation operation. Numerical simulation results show that the proposed architecture can achieve high accurate channel prediction in high mobility scenarios without any additional pilot overhead.