Peng Wang

Peng Wang

Auto-generated profile, based on publicly available information

Peng Wang

School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2024 in IEEE Communications Letters
Verified
Journal Article
Closed access
PWPeng Wang
Peng Wang
JLJianjun Li
Jianjun Li
AZAihua Zhang
Aihua Zhang
BNBing Ning
Bing Ning
BSBule Sun
Bule Sun
PSPeng Sun
Peng Sun
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.

10 September 2025 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
LPLizhuo Pang
Lizhuo Pang
PWPeng Wang
Peng Wang
HLHua Li
Hua Li
XWXiyuan Wang
Xiyuan Wang
LLLintao Li
Lintao Li
XDXiaoming Dai
Xiaoming Dai
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.