Wenqiang Pu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Wenqiang Pu has a total of 80 co-authors. Here are the top co-authors by number of shared publications:
- Hongwei Liu
School of Mathematics and Statistics, XiDian University, Xi’an, China
24 shared publications - Junkun Yan
National Laboratory of Radar Signal Processing, Xidian University, Xian, China
19 shared publications - Qingjiang Shi
Tongji University
9 shared publications - Maria Sabrina Greco
University of Pisa
8 shared publications - Ming-Yi You
National Key Laboratory of Electromagnetic Space Security, No. 36 Research Institute of CETC, Jiaxing, China
8 shared publications - Bo Jiu
National Key Laboratory of Radar Signal Processing, Xidian University, Xian, China
7 shared publications
Latest Publications
- 22 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 74 (1053587X) , 2434-2447
Optimistic Thompson Sampling for No-Regret Learning in Unknown Games
We study the problem of learning to play a repeated multi-player game with an unknown reward function and bandit feedback. The central challenge arises from the need to balance exploration and exploitation under bandit feedback while strategically responding to other players. To address this, we propose Thompson Sampling-based algorithms that leverage available information about opponents’ actions and reward structures, resulting in a significant reduction in regret bound. Building on these insights, we introduce the Optimism-then-NoRegret framework, which encompasses various game algorithms as special cases. Simulation evaluations on three distinct types of games show that our proposed algorithms consistently and substantially outperform standard baselines.
- 22 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 74 (1053587X) , 2434-2447
Optimistic Thompson Sampling for No-Regret Learning in Unknown Games
We study the problem of learning to play a repeated multi-player game with an unknown reward function and bandit feedback. The central challenge arises from the need to balance exploration and exploitation under bandit feedback while strategically responding to other players. To address this, we propose Thompson Sampling-based algorithms that leverage available information about opponents’ actions and reward structures, resulting in a significant reduction in regret bound. Building on these insights, we introduce the Optimism-then-NoRegret framework, which encompasses various game algorithms as special cases. Simulation evaluations on three distinct types of games show that our proposed algorithms consistently and substantially outperform standard baselines.
- 20 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. PP (00189251) , 1-14
Joint Sensing and Communication Time Resource Allocation Approach in ISAC Networks
This paper considers integrated sensing and communication (ISAC) networks with multiple base stations that are responsible for multiple targets tracking and communication tasks. Specifically, we focus on the time resource allocation of ISAC networks, as it plays a critical role of achieving accurate target tracking and efficient data transmission. To this end, we formulate a non-linear and non-convex optimization problem to decide time resource allocated from each base station to targets tracking and users communication. The problem is then reformulated by transforming its non-convex constraints and solved using an alternating direction method of multipliers (ADMM)-based approach. Simulation results demonstrate that the proposed ADMM approach outperforms conventional non linear solutions, such as genetic algorithm, in terms of both target tracking accuracy and data throughput.
- 20 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. PP (00189251) , 1-14
Joint Sensing and Communication Time Resource Allocation Approach in ISAC Networks
This paper considers integrated sensing and communication (ISAC) networks with multiple base stations that are responsible for multiple targets tracking and communication tasks. Specifically, we focus on the time resource allocation of ISAC networks, as it plays a critical role of achieving accurate target tracking and efficient data transmission. To this end, we formulate a non-linear and non-convex optimization problem to decide time resource allocated from each base station to targets tracking and users communication. The problem is then reformulated by transforming its non-convex constraints and solved using an alternating direction method of multipliers (ADMM)-based approach. Simulation results demonstrate that the proposed ADMM approach outperforms conventional non linear solutions, such as genetic algorithm, in terms of both target tracking accuracy and data throughput.
- 12 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 74 (1053587X) , 2053-2068
Collaborative Strategy Learning Based Transmit Resource Management Scheme for Multiple Target Tracking in Multi-Cooperative Jamming Environment
This paper proposes a collaborative strategy learning based transmit resource management (CSLTRM) scheme for radar systems in a multi-cooperative jamming environment. Its key idea is to utilize the optimization technique to coordinate the transmit power and frequency in order to improve the target tracking accuracy. To combat multi-cooperative jamming, we first build an active MDP to sense the potential collaborative strategy within a Reinforcement Learning framework. Combining the reward and state transition function of the MDP, a weighted predictable Bayesian Cramér–Rao lower bound is constructed to evaluate the target tracking performance under the multi-cooperative jamming environment, and then the CSLTRM scheme is designed as a mixed-integer optimization model. In order to effectively obtain the joint transmit scheme, we develop a cyclic alternating minimization (CAM) method to solve the resulting optimization problem. Specifically, the CAM consists of two key steps: frequencies selection and power allocation. We provide a lower bound for the frequencies selection problem and thereby reduce the action space of the original optimization model. Then, the final transmit frequencies are further determined with the help of the cooperative information implicit in the anti-jamming model. After the transmit frequencies are given, the power allocation problem is solved by a convex optimization method. Simulation results also show that the proposed method can effectively reduce the impact of multi-cooperative jamming while improving target tracking accuracy with a limited power budget.
- 12 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 74 (1053587X) , 2053-2068
Collaborative Strategy Learning Based Transmit Resource Management Scheme for Multiple Target Tracking in Multi-Cooperative Jamming Environment
This paper proposes a collaborative strategy learning based transmit resource management (CSLTRM) scheme for radar systems in a multi-cooperative jamming environment. Its key idea is to utilize the optimization technique to coordinate the transmit power and frequency in order to improve the target tracking accuracy. To combat multi-cooperative jamming, we first build an active MDP to sense the potential collaborative strategy within a Reinforcement Learning framework. Combining the reward and state transition function of the MDP, a weighted predictable Bayesian Cramér–Rao lower bound is constructed to evaluate the target tracking performance under the multi-cooperative jamming environment, and then the CSLTRM scheme is designed as a mixed-integer optimization model. In order to effectively obtain the joint transmit scheme, we develop a cyclic alternating minimization (CAM) method to solve the resulting optimization problem. Specifically, the CAM consists of two key steps: frequencies selection and power allocation. We provide a lower bound for the frequencies selection problem and thereby reduce the action space of the original optimization model. Then, the final transmit frequencies are further determined with the help of the cooperative information implicit in the anti-jamming model. After the transmit frequencies are given, the power allocation problem is solved by a convex optimization method. Simulation results also show that the proposed method can effectively reduce the impact of multi-cooperative jamming while improving target tracking accuracy with a limited power budget.
- 5 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. PP (1053587X) , 1-14
Radio Map Estimation via Latent Domain Plug-and-Play Denoising
Radio map estimation (RME), also known as spectrum cartography, aims to reconstruct the strength of radio interference across different domains (e.g., space and frequency) from sparsely sampled measurements. To tackle this typical inverse problem, state-of-the-art RME methods rely on handcrafted or data-driven structural information of radio maps. However, the former often struggles to model complex radio frequency (RF) environments and the latter requires excessive trainingߞmaking it hard to quickly adapt to in situ sensing tasks. This work presents an RME approach based on plug-and-play (PnP) denoising, a technique from computational imaging. The idea is to leverage the observation that the denoising operations of signals like natural images and radio maps are similarߞdespite the nontrivial differences of the signals themselves. Hence, sophisticated denoisers designed for or learned from natural images can be directly employed to assist RME, avoiding using radio map data for training. Unlike conventional PnP methods that operate directly in the data domain, the proposed method exploits the classical spatio-spectral decomposition model of radio maps and proposes an ADMM algorithm that denoises in the latent factor that only represents the spatial domain. This design significantly improves computational efficiency and enhances noise robustness. Theoretical aspects, e.g., recoverability of the complete radio map and convergence of the ADMM algorithm are analyzed. Synthetic and real data experiments are conducted to demonstrate the effectiveness of our approach.
- 5 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. PP (1053587X) , 1-14
Radio Map Estimation via Latent Domain Plug-and-Play Denoising
Radio map estimation (RME), also known as spectrum cartography, aims to reconstruct the strength of radio interference across different domains (e.g., space and frequency) from sparsely sampled measurements. To tackle this typical inverse problem, state-of-the-art RME methods rely on handcrafted or data-driven structural information of radio maps. However, the former often struggles to model complex radio frequency (RF) environments and the latter requires excessive trainingߞmaking it hard to quickly adapt to in situ sensing tasks. This work presents an RME approach based on plug-and-play (PnP) denoising, a technique from computational imaging. The idea is to leverage the observation that the denoising operations of signals like natural images and radio maps are similarߞdespite the nontrivial differences of the signals themselves. Hence, sophisticated denoisers designed for or learned from natural images can be directly employed to assist RME, avoiding using radio map data for training. Unlike conventional PnP methods that operate directly in the data domain, the proposed method exploits the classical spatio-spectral decomposition model of radio maps and proposes an ADMM algorithm that denoises in the latent factor that only represents the spatial domain. This design significantly improves computational efficiency and enhances noise robustness. Theoretical aspects, e.g., recoverability of the complete radio map and convergence of the ADMM algorithm are analyzed. Synthetic and real data experiments are conducted to demonstrate the effectiveness of our approach.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 74, 4853-4863
Robust Direct Position Determination With Contaminated Measurements
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 74, 4853-4863
Robust Direct Position Determination With Contaminated Measurements
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (10) , 1-17
Failure Recovery for Network Slicing in Software-Defined Integrated Satellite-Terrestrial Networks
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (10) , 1-17
Failure Recovery for Network Slicing in Software-Defined Integrated Satellite-Terrestrial Networks
- 9 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (5) , 7354-7372
Reliability-Enhanced Network Slicing for Time-Varying Software-Defined Space Information Network
In software-defined satellite information networks (SD-SINs), each requested service can be characterized by a predetermined sequence of virtual network functions (VNFs), referred to as a service function chain (SFC). However, VNFs shared by multiple requested services are prone to failures, causing service interruptions. Furthermore, the rapid movement of satellites results in an intermittent yet predictable network topology. Moreover, efficient use of multi-dimensional heterogeneous resources can enhance reliability and network performance. Therefore, in this paper, we investigate reliability-enhanced network slicing by jointly exploiting communication, storage, and computation resources in time-varying SD-SINs. Specifically, we use the time-expanded graph (TEG) to model time-varying SD-SINs with multi-dimensional heterogeneous resources. Based on TEG, we propose a joint reliability-enhanced VNF deployment and flow routing strategy, formulated as an integer nonlinear programming (INLP) problem, to maximize the number of completed services with reliability requirements. To effectively solve the INLP problem, we propose two novel algorithms: the integer linear programming reformulation (ILPR) algorithm, which achieves optimal solutions but with high complexity, and the LP relaxation-based VNF deployment and routing (LPR-VDR) algorithm, which provides near-optimal solutions with significantly lower complexity. Simulation results demonstrate that the LPR-VDR algorithm performs very closely to the ILPR algorithm.
- 9 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (5) , 7354-7372
Reliability-Enhanced Network Slicing for Time-Varying Software-Defined Space Information Network
In software-defined satellite information networks (SD-SINs), each requested service can be characterized by a predetermined sequence of virtual network functions (VNFs), referred to as a service function chain (SFC). However, VNFs shared by multiple requested services are prone to failures, causing service interruptions. Furthermore, the rapid movement of satellites results in an intermittent yet predictable network topology. Moreover, efficient use of multi-dimensional heterogeneous resources can enhance reliability and network performance. Therefore, in this paper, we investigate reliability-enhanced network slicing by jointly exploiting communication, storage, and computation resources in time-varying SD-SINs. Specifically, we use the time-expanded graph (TEG) to model time-varying SD-SINs with multi-dimensional heterogeneous resources. Based on TEG, we propose a joint reliability-enhanced VNF deployment and flow routing strategy, formulated as an integer nonlinear programming (INLP) problem, to maximize the number of completed services with reliability requirements. To effectively solve the INLP problem, we propose two novel algorithms: the integer linear programming reformulation (ILPR) algorithm, which achieves optimal solutions but with high complexity, and the LP relaxation-based VNF deployment and routing (LPR-VDR) algorithm, which provides near-optimal solutions with significantly lower complexity. Simulation results demonstrate that the LPR-VDR algorithm performs very closely to the ILPR algorithm.
- 20 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 73 (1053587X) , 4969-4985
Efficient Beamforming Refinement for Limited Feedback FDD Massive MIMO: An Online Alternating Exploration-Estimation Approach
In current 5G massive multiple-input multiple-output (MIMO) cellular networks, the performance of beamforming hinges critically on the accuracy of downlink channel state information (CSI), particularly in frequency division duplexing (FDD) systems. The absence of channel reciprocity in FDD systems introduces notable challenges, resulting in substantial communication overhead when transmitting downlink CSI directly. To tackle this obstacle, a limited feedback strategy is adopted to compress the downlink CSI into a manageable number of bits. Nevertheless, this compression complicates the accurate retrieval of downlink CSI, reducing the beamforming performance. This paper thoroughly examines the limited feedback mechanism, scrutinizing its structural design and the values it generates. Drawing upon these insights, we introduce an online algorithm that alternates between exploration and estimation to enhance beamforming for single-stream and multi-stream configurations. Our proposed method significantly elevates beamforming vector quality by adeptly decoding downlink CSI from the limited feedback. Additionally, it leverages existing information to refine the feedback process, leading to the generation of more precise CSI. As numerical results demonstrate, the complementary nature of estimation and exploration leads to outstanding performance in optimal beamforming acquisition.
- 20 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 73 (1053587X) , 4969-4985
Efficient Beamforming Refinement for Limited Feedback FDD Massive MIMO: An Online Alternating Exploration-Estimation Approach
In current 5G massive multiple-input multiple-output (MIMO) cellular networks, the performance of beamforming hinges critically on the accuracy of downlink channel state information (CSI), particularly in frequency division duplexing (FDD) systems. The absence of channel reciprocity in FDD systems introduces notable challenges, resulting in substantial communication overhead when transmitting downlink CSI directly. To tackle this obstacle, a limited feedback strategy is adopted to compress the downlink CSI into a manageable number of bits. Nevertheless, this compression complicates the accurate retrieval of downlink CSI, reducing the beamforming performance. This paper thoroughly examines the limited feedback mechanism, scrutinizing its structural design and the values it generates. Drawing upon these insights, we introduce an online algorithm that alternates between exploration and estimation to enhance beamforming for single-stream and multi-stream configurations. Our proposed method significantly elevates beamforming vector quality by adeptly decoding downlink CSI from the limited feedback. Additionally, it leverages existing information to refine the feedback process, leading to the generation of more precise CSI. As numerical results demonstrate, the complementary nature of estimation and exploration leads to outstanding performance in optimal beamforming acquisition.
- 29 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (6) , 19554-19563
Joint Transmission Resource Allocation and Path Planning Scheme for Airborne Radar Cooperation in Nonideal Detection Environments
Due to non-ideal detection factors such as noise interference and Doppler blind effect (DBE), target tracks frequently exhibit fragmentation or complete disappearance. Traditional airborne radar cooperative resource allocation schemes are designed under ideal detection conditions, which may prevent effective assessment of the evolution of tracks, potentially leading to model mismatch. To address this issue, a joint transmission resource allocation and path planning (JTRAPP) method is proposed to achieve continuous and high-precision tracking of multiple targets in non-ideal detection environments. Firstly, a target detection model is established to characterize the effects of noise interference and DBE on radar detection, and a track evolution model is developed to describe the evolution process of the complete track lifecycle. Subsequently, the Bayesian Cramer-Rao lower bound ´ based on the track-to-track fusion (BCRLB-TF) framework is derived, and a probability model is established to characterize the existence of the fused tracks. Normalized BCRLB-TF is then adopted as the criterion, while the fused track existence probability is adopted as a constraint, and then a mathematical optimization model w.r.t. the JTRAPP scheme is constructed. Finally, leveraging the unique structure of the optimization problem, a two-step solution algorithm based on binary search and the alternating direction method of multipliers (ADMM) is devised. Simulation results demonstrate that the proposed method effectively enhances radar tracking performance for multiple targets while satisfying the predetermined fused track existence probability.
- 29 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (6) , 19554-19563
Joint Transmission Resource Allocation and Path Planning Scheme for Airborne Radar Cooperation in Nonideal Detection Environments
Due to non-ideal detection factors such as noise interference and Doppler blind effect (DBE), target tracks frequently exhibit fragmentation or complete disappearance. Traditional airborne radar cooperative resource allocation schemes are designed under ideal detection conditions, which may prevent effective assessment of the evolution of tracks, potentially leading to model mismatch. To address this issue, a joint transmission resource allocation and path planning (JTRAPP) method is proposed to achieve continuous and high-precision tracking of multiple targets in non-ideal detection environments. Firstly, a target detection model is established to characterize the effects of noise interference and DBE on radar detection, and a track evolution model is developed to describe the evolution process of the complete track lifecycle. Subsequently, the Bayesian Cramer-Rao lower bound ´ based on the track-to-track fusion (BCRLB-TF) framework is derived, and a probability model is established to characterize the existence of the fused tracks. Normalized BCRLB-TF is then adopted as the criterion, while the fused track existence probability is adopted as a constraint, and then a mathematical optimization model w.r.t. the JTRAPP scheme is constructed. Finally, leveraging the unique structure of the optimization problem, a two-step solution algorithm based on binary search and the alternating direction method of multipliers (ADMM) is devised. Simulation results demonstrate that the proposed method effectively enhances radar tracking performance for multiple targets while satisfying the predetermined fused track existence probability.
- 14 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 73 (1053587X) , 3362-3377
Heterogeneous Time Resource Arrangement and Refined Tracking for Phased Array Radar Within Complex Target Environment
Complex target environments present characteristics of saturation, high speed, and high maneuverability, posing increasingly challenging demands for target tracking. In this context, traditional phased-array radar (PAR) faces the dilemma of limited tracking resources and filter model mismatch. To address these issues, this paper proposes a heterogeneous time resource arrangement (HTRA) and refined tracking (RT) method. Firstly, to mitigate the impact of maneuvering model mismatch, we modify the traditional strong tracking filter by considering the effect of different measurements on the correction of the maneuvering model, and formulate the RT method as an optimization problem according to the residual consistency criterion. Then, to properly allocate and arrange limited time resources, by defining a multidimensional time resource vector, we adopt the posterior estimate covariance from RT as a performance metric, and design a performance-driven HTRA framework to achieve time assignment under model mismatch conditions. Simulation results demonstrate that, compared to traditional approaches, the joint HTRA and RT strategy significantly enhance the tracking performance of complex targets within a given time resource budget.
- 14 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 73 (1053587X) , 3362-3377
Heterogeneous Time Resource Arrangement and Refined Tracking for Phased Array Radar Within Complex Target Environment
Complex target environments present characteristics of saturation, high speed, and high maneuverability, posing increasingly challenging demands for target tracking. In this context, traditional phased-array radar (PAR) faces the dilemma of limited tracking resources and filter model mismatch. To address these issues, this paper proposes a heterogeneous time resource arrangement (HTRA) and refined tracking (RT) method. Firstly, to mitigate the impact of maneuvering model mismatch, we modify the traditional strong tracking filter by considering the effect of different measurements on the correction of the maneuvering model, and formulate the RT method as an optimization problem according to the residual consistency criterion. Then, to properly allocate and arrange limited time resources, by defining a multidimensional time resource vector, we adopt the posterior estimate covariance from RT as a performance metric, and design a performance-driven HTRA framework to achieve time assignment under model mismatch conditions. Simulation results demonstrate that, compared to traditional approaches, the joint HTRA and RT strategy significantly enhance the tracking performance of complex targets within a given time resource budget.