arXiv subjects

Wenjun Jiang

Publications and source records attributed to Wenjun Jiang.

At least 19 recordsLinked to original sources

arXiv2026

Dynamic Channel Knowledge Map: Fundamentals, Construction, and Applications

Wireless communication networks are evolving toward extremely large antenna arrays, millimeter-wave and terahertz bands, and dense heterogeneous deployments, all of which increase channel dimensionality and make channel acquisition increasingly costly. Channel knowledge map (CKM) establishes a mapping from geographical locations to channel characteristics, providing location-specific prior information to reduce the overhead of channel acquisition. Most existing CKM research, however, has focused on quasi-static propagation features shaped by quasi-static environmental structures such as buildings and terrain, leaving unaddressed the time-varying channel component introduced by dynamic scatterers, terminal attitude changes, and radio-frequency (RF) impairments. This article presents a new concept of dynamic CKM as a middle layer that links quasi-static environmental priors to physical-layer signal processing by providing time-evolving channel representations. We first introduce the fundamentals of dynamic CKM, clarifying its relationship with the quasi-static CKM and the physical layer. We then survey representative construction methods and discuss how dynamic CKM can support pilot design, interference suppression, and integrated sensing and communications. Finally, we outline key open research directions in the co-design of dynamic CKM construction and physical-layer signal processing. These discussions offer an architectural perspective on the role of dynamic CKM in emerging 6G systems.

cs.IT↗

arXiv2026

Distributionally Robust Insurance under Bregman-Wasserstein Divergence

This paper investigates two optimal insurance contracting problems under distributional uncertainty from the perspective of a potential policyholder, utilizing a Bregman-Wasserstein (BW) ball to characterize the ambiguity set of loss distributions. Unlike the $p$-Wasserstein distance, BW divergence enables asymmetric penalization of deviations from the benchmark distribution. The first problem examines an insurance demand model where the policyholder adopts an $\alpha$-maxmin preference with Value-at-Risk (VaR). We derive the optimal indemnity function in closed form and study, both analytically and numerically, how the asymmetry inherent in BW divergence influences the optimal indemnity structure. The second problem employs a robust optimization framework, where the policyholder aims to secure robust insurance indemnity by minimizing the worst-case convex distortion risk measure while adhering to a guaranteed VaR constraint. In this context, we provide explicit characterizations of both the optimal indemnity and the worst-case distribution in closed form through a combined approach using the Lagrangian method and modification arguments. To illustrate the practical implications of our theoretical findings, we include a concrete example based on Tail Value-at-Risk (TVaR).

q-fin.RM↗

arXiv2025

Dynamic Channel Knowledge Map Construction in MIMO-OFDM Systems

Channel knowledge map (CKM) is a promising paradigm for environment-aware communications by establishing a deterministic mapping between physical locations and channel parameters. Existing CKM construction methods focus on quasi-static propagation environment. This paper develops a dynamic CKM construction method for multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems. We establish a dynamic channel model that captures the coexistence of quasi-static and dynamic scatterers, as well as the impacts of antenna rotation and synchronization errors. Based on this model, we formulate the problem of dynamic CKM construction within a Bayesian inference framework and design a two-stage approximate Bayesian inference algorithm. In stage I, a high-performance algorithm is developed to jointly infer quasi-static channel parameters and calibrate synchronization errors from historical measurements. In stage II, by leveraging the quasi-static parameters as informative priors, a low-complexity algorithm is designed to estimate dynamic parameters from limited real-time measurements. Simulation results validate the superiority of the proposed method and demonstrate its effectiveness in enabling low-overhead, high-performance channel estimation in dynamic environments.

cs.IT↗

arXiv2025

Joint Activity Detection and Channel Estimation for Massive Connectivity: Where Message Passing Meets Score-Based Generative Priors

Massive connectivity supports the sporadic access of a vast number of devices without requiring prior permission from the base station (BS). In such scenarios, the BS must perform joint activity detection and channel estimation (JADCE) prior to data reception. Message-passing algorithms have emerged as a prominent solution for JADCE under a Bayesian inference framework. The existing message-passing algorithms, however, typically rely on some hand-crafted and overly simplistic priors of the wireless channel, leading to significant channel estimation errors and reduced activity detection accuracy. In this paper, we focus on the problem of JADCE in a multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) grant-free random access network. We propose to incorporate a more accurate channel prior learned by score-based generative models into message passing, so as to push towards the performance limit of JADCE. Specifically, we develop a novel turbo message passing (TMP) framework that models the entire channel matrix as a super node, rather than factorizing it element-wise. This design enables the seamless integration of score-based generative models as a minimum mean-squared error (MMSE) denoiser. The variance of the denoiser, which is essential in message passing, can also be learned through score-based generative models. Our approach, termed score-based TMP for JADCE (STMP-JADCE), takes full advantages of the powerful generative prior and, meanwhile, benefits from the fast convergence speed of message passing. Numerical simulations show that STMP-JADCE drastically enhances the activity detection and channel estimation performance compared to the state-of-the-art baseline algorithms.

eess.SP↗

arXiv2025

MobiVital: Self-supervised Time-series Quality Estimation for Contactless Respiration Monitoring Using UWB Radar

Respiration waveforms are increasingly recognized as important biomarkers, offering insights beyond simple respiration rates, such as detecting breathing irregularities for disease diagnosis or monitoring breath patterns to guide rehabilitation training. Previous works in wireless respiration monitoring have primarily focused on estimating respiration rate, where the breath waveforms are often generated as a by-product. As a result, issues such as waveform deformation and inversion have largely been overlooked, reducing the signal's utility for applications requiring breathing waveforms. To address this problem, we present a novel approach, MobiVital, that improves the quality of respiration waveforms obtained from ultra-wideband (UWB) radar data. MobiVital combines a self-supervised autoregressive model for breathing waveform extraction with a biology-informed algorithm to detect and correct waveform inversions. To encourage reproducible research efforts for developing wireless vital signal monitoring systems, we also release a 12-person, 24-hour UWB radar vital signal dataset, with time-synchronized ground truth obtained from wearable sensors. Our results show that the respiration waveforms produced by our system exhibit a 7-34% increase in fidelity to the ground truth compared to the baselines and can benefit downstream tasks such as respiration rate estimation.

eess.SP↗

arXiv2024

Interference-Cancellation-Based Channel Knowledge Map Construction and Its Applications to Channel Estimation

Channel knowledge map (CKM) is viewed as a digital twin of wireless channels, providing location-specific channel knowledge for environment-aware communications. A fundamental problem in CKM-assisted communications is how to construct the CKM efficiently. Current research focuses on interpolating or predicting channel knowledge based on error-free channel knowledge from measured regions, ignoring the extraction of channel knowledge. This paper addresses this gap by unifying the extraction and representation of channel knowledge. We propose a novel CKM construction framework that leverages the received signals of the base station (BS) as online and low-cost data. Specifically, we partition the BS coverage area into spatial grids. The channel knowledge per grid is represented by a set of multi-path powers, delays, and angles, based on the principle of spatial consistency. In the extraction of these channel parameters, the challenges lie in strong inter-cell interferences and non-linear relationship between received signals and channel parameters. To address these issues, we formulate the problem of CKM construction into a problem of Bayesian inference, employing a block-sparsity prior model to characterize the path-loss differences of interferers. Under the Bayesian inference framework, we develop a hybrid message-passing algorithm for the interference-cancellation-based CKM construction. Based on the CKM, we obtain the joint frequency-space covariance of user channel and design a CKM-assisted Bayesian channel estimator. The computational complexity of the channel estimator is substantially reduced by exploiting the CKM-derived covariance structure. Numerical results show that the proposed CKM provides accurate channel parameters at low signal-to-interference-plus-noise ratio (SINR) and that the CKM-assisted channel estimator significantly outperforms state-of-the-art counterparts.

cs.IT↗

arXiv2024

Learning-based Block-wise Planar Channel Estimation for Time-Varying MIMO OFDM

In this paper, we propose a learning-based block-wise planar channel estimator (LBPCE) with high accuracy and low complexity to estimate the time-varying frequency-selective channel of a multiple-input multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) system. First, we establish a block-wise planar channel model (BPCM) to characterize the correlation of the channel across subcarriers and OFDM symbols. Specifically, adjacent subcarriers and OFDM symbols are divided into several sub-blocks, and an affine function (i.e., a plane) with only three variables (namely, mean, time-domain slope, and frequency-domain slope) is used to approximate the channel in each sub-block, which significantly reduces the number of variables to be determined in channel estimation. Second, we design a 3D dilated residual convolutional network (3D-DRCN) that leverages the time-frequency-space-domain correlations of the channel to further improve the channel estimates of each user. Numerical results demonstrate that the proposed significantly outperforms the state-of-the-art estimators and maintains a relatively low computational complexity.

eess.SP↗

arXiv2024

Scalable Near-Field Localization Based on Partitioned Large-Scale Antenna Array

This paper studies a passive localization system, where an extremely large-scale antenna array (ELAA) is deployed at the base station (BS) to locate a user equipment (UE) residing in its near-field (Fresnel) region. We propose a novel algorithm, named array partitioning-based location estimation (APLE), for scalable near-field localization. The APLE algorithm is developed based on the basic assumption that, by partitioning the ELAA into multiple subarrays, the UE can be approximated as in the far-field region of each subarray. We establish a Bayeian inference framework based on the geometric constraints between the UE location and the angles of arrivals (AoAs) at different subarrays. Then, the APLE algorithm is designed based on the message-passing principle for the localization of the UE. APLE exhibits linear computational complexity with the number of BS antennas, leading to a significant reduction in complexity compared to existing methods. We further propose an enhanced APLE (E-APLE) algorithm that refines the location estimate obtained from APLE by following the maximum likelihood principle. The E-APLE algorithm achieves superior localization accuracy compared to APLE while maintaining a linear complexity with the number of BS antennas. Numerical results demonstrate that the proposed APLE and E-APLE algorithms outperform the existing baselines in terms of localization accuracy.

eess.SP↗

arXiv2024

A Fast Maximum Clique Algorithm Based on Network Decomposition for Large Sparse Networks

Finding maximum cliques in large networks is a challenging combinatorial problem with many real-world applications. We present a fast algorithm to achieve the exact solution for the maximum clique problem in large sparse networks based on efficient graph decomposition. A bunch of effective techniques is being used to greatly prune the graph and a novel concept called Complete-Upper-Bound-Induced Subgraph (CUBIS) is proposed to ensure that the structures with the potential to form the maximum clique are retained in the process of graph decomposition. Our algorithm first pre-prunes peripheral nodes, subsequently, one or two small-scale CUBISs are constructed guided by the core number and current maximum clique size. Bron-Kerbosch search is performed on each CUBIS to find the maximum clique. Experiments on 50 empirical networks with a scale of up to 20 million show the CUBIS scales are largely independent of the original network scale. This enables an approximately linear runtime, making our algorithm amenable for large networks. Our work provides a new framework for effectively solving maximum clique problems on massive sparse graphs, which not only makes the graph scale no longer the bottleneck but also shows some light on solving other clique-related problems.

cs.SI↗

arXiv2024

A Quick Framework for Evaluating Worst Robustness of Complex Networks

Robustness is pivotal for comprehending, designing, optimizing, and rehabilitating networks, with simulation attacks being the prevailing evaluation method. Simulation attacks are often time-consuming or even impractical, however, a more crucial yet persistently overlooked drawback is that any attack strategy merely provides a potential paradigm of disintegration. The key concern is: in the worst-case scenario or facing the most severe attacks, what is the limit of robustness, referred to as ``Worst Robustness'', for a given system? Understanding a system's worst robustness is imperative for grasping its reliability limits, accurately evaluating protective capabilities, and determining associated design and security maintenance costs. To address these challenges, we introduce the concept of Most Destruction Attack (MDA) based on the idea of knowledge stacking. MDA is employed to assess the worst robustness of networks, followed by the application of an adapted CNN algorithm for rapid worst robustness prediction. We establish the logical validity of MDA and highlight the exceptional performance of the adapted CNN algorithm in predicting the worst robustness across diverse network topologies, encompassing both model and empirical networks.

cs.SI↗

arXiv2023

Scalable Near-Field Localization Based on Partitioned Large-Scale Antenna Array

eess.SP↗

arXiv2023

Comprehensive Analysis of Network Robustness Evaluation Based on Convolutional Neural Networks with Spatial Pyramid Pooling

Connectivity robustness, a crucial aspect for understanding, optimizing, and repairing complex networks, has traditionally been evaluated through time-consuming and often impractical simulations. Fortunately, machine learning provides a new avenue for addressing this challenge. However, several key issues remain unresolved, including the performance in more general edge removal scenarios, capturing robustness through attack curves instead of directly training for robustness, scalability of predictive tasks, and transferability of predictive capabilities. In this paper, we address these challenges by designing a convolutional neural networks (CNN) model with spatial pyramid pooling networks (SPP-net), adapting existing evaluation metrics, redesigning the attack modes, introducing appropriate filtering rules, and incorporating the value of robustness as training data. The results demonstrate the thoroughness of the proposed CNN framework in addressing the challenges of high computational time across various network types, failure component types and failure scenarios. However, the performance of the proposed CNN model varies: for evaluation tasks that are consistent with the trained network type, the proposed CNN model consistently achieves accurate evaluations of both attack curves and robustness values across all removal scenarios. When the predicted network type differs from the trained network, the CNN model still demonstrates favorable performance in the scenario of random node failure, showcasing its scalability and performance transferability. Nevertheless, the performance falls short of expectations in other removal scenarios. This observed scenario-sensitivity in the evaluation of network features has been overlooked in previous studies and necessitates further attention and optimization. Lastly, we discuss important unresolved questions and further investigation.

cs.CV↗

arXiv2023

LibCity: A Unified Library Towards Efficient and Comprehensive Urban Spatial-Temporal Prediction

As deep learning technology advances and more urban spatial-temporal data accumulates, an increasing number of deep learning models are being proposed to solve urban spatial-temporal prediction problems. However, there are limitations in the existing field, including open-source data being in various formats and difficult to use, few papers making their code and data openly available, and open-source models often using different frameworks and platforms, making comparisons challenging. A standardized framework is urgently needed to implement and evaluate these methods. To address these issues, we propose LibCity, an open-source library that offers researchers a credible experimental tool and a convenient development framework. In this library, we have reproduced 65 spatial-temporal prediction models and collected 55 spatial-temporal datasets, allowing researchers to conduct comprehensive experiments conveniently. By enabling fair model comparisons, designing a unified data storage format, and simplifying the process of developing new models, LibCity is poised to make significant contributions to the spatial-temporal prediction field.

cs.LG↗

arXiv2023

Continuous Trajectory Generation Based on Two-Stage GAN

Simulating the human mobility and generating large-scale trajectories are of great use in many real-world applications, such as urban planning, epidemic spreading analysis, and geographic privacy protect. Although many previous works have studied the problem of trajectory generation, the continuity of the generated trajectories has been neglected, which makes these methods useless for practical urban simulation scenarios. To solve this problem, we propose a novel two-stage generative adversarial framework to generate the continuous trajectory on the road network, namely TS-TrajGen, which efficiently integrates prior domain knowledge of human mobility with model-free learning paradigm. Specifically, we build the generator under the human mobility hypothesis of the A* algorithm to learn the human mobility behavior. For the discriminator, we combine the sequential reward with the mobility yaw reward to enhance the effectiveness of the generator. Finally, we propose a novel two-stage generation process to overcome the weak point of the existing stochastic generation process. Extensive experiments on two real-world datasets and two case studies demonstrate that our framework yields significant improvements over the state-of-the-art methods.

cs.LG↗

arXiv2022

Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams

A great variety of complex systems, from user interactions in communication networks to transactions in financial markets, can be modeled as temporal graphs consisting of a set of vertices and a series of timestamped and directed edges. Temporal motifs are generalized from subgraph patterns in static graphs which consider edge orderings and durations in addition to topologies. Counting the number of occurrences of temporal motifs is a fundamental problem for temporal network analysis. However, existing methods either cannot support temporal motifs or suffer from performance issues. Moreover, they cannot work in the streaming model where edges are observed incrementally over time. In this paper, we focus on approximate temporal motif counting via random sampling. We first propose two sampling algorithms for temporal motif counting in the offline setting. The first is an edge sampling (ES) algorithm for estimating the number of instances of any temporal motif. The second is an improved edge-wedge sampling (EWS) algorithm that hybridizes edge sampling with wedge sampling for counting temporal motifs with $3$ vertices and $3$ edges. Furthermore, we propose two algorithms to count temporal motifs incrementally in temporal graph streams by extending the ES and EWS algorithms referred to as SES and SEWS. We provide comprehensive analyses of the theoretical bounds and complexities of our proposed algorithms. Finally, we perform extensive experimental evaluations of our proposed algorithms on several real-world temporal graphs. The results show that ES and EWS have higher efficiency, better accuracy, and greater scalability than state-of-the-art sampling methods for temporal motif counting in the offline setting. Moreover, SES and SEWS achieve up to three orders of magnitude speedups over ES and EWS while having comparable estimation errors for temporal motif counting in the streaming setting.

cs.SI↗

arXiv2022

Simultaneous Active and Passive Information Transfer for RIS-Aided MIMO Systems: Iterative Decoding and Evolution Analysis

This paper investigates the potential of reconfigurable intelligent surface (RIS) for passive information transfer in a RIS-aided multiple-input multiple-output (MIMO) system. We propose a novel simultaneous active and passive information transfer (SAPIT) scheme. In SAPIT, the transmitter (Tx) and the RIS deliver information simultaneously, where the RIS information is carried through the RIS phase shifts embedded in reflected signals. We introduce the coded modulation technique at the Tx and the RIS. The main challenge of the SAPIT scheme is to simultaneously detect the Tx signals and the RIS phase coefficients at the receiver. To address this challenge, we introduce appropriate auxiliary variables to convert the original signal model into two linear models with respect to the Tx signals and one entry-by-entry bilinear model with respect to the RIS phase coefficients. With this auxiliary signal model, we develop a message-passing-based receiver algorithm. Furthermore, we analyze the fundamental performance limit of the proposed SAPIT-MIMO transceiver. Notably, we establish the state evolution to predict the receiver performance in a large-size system. We further analyze the achievable rates of the Tx and the RIS, which provides insight into the code design for sum-rate maximization. Numerical results validate our analysis and show that the SAPIT scheme outperforms the passive beamforming counterpart in achievable sum rate of the Tx and the RIS.

cs.IT↗

arXiv2021

MIMO-OFDM-Based Massive Connectivity With Frequency Selectivity Compensation

In this paper, we study how to efficiently and reliably detect active devices and estimate their channels in a multiple-input multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) based grant-free non-orthogonal multiple access (NOMA) system to enable massive machine-type communications (mMTC). First, by exploiting the correlation of the channel frequency responses in narrow-band mMTC, we propose a block-wise linear channel model. Specifically, the continuous OFDM subcarriers in the narrow-band are divided into several sub-blocks and a linear function with only two variables (mean and slope) is used to approximate the frequency-selective channel in each sub-block. This significantly reduces the number of variables to be determined in channel estimation and the sub-block number can be adjusted to reliably compensate the channel frequency-selectivity. Second, we formulate the joint active device detection and channel estimation in the block-wise linear system as a Bayesian inference problem. By exploiting the block-sparsity of the channel matrix, we develop an efficient turbo message passing (Turbo-MP) algorithm to resolve the Bayesian inference problem with near-linear complexity. We further incorporate machine learning approaches into Turbo-MP to learn unknown prior parameters. Numerical results demonstrate the superior performance of the proposed algorithm over state-of-the-art algorithms.

cs.IT↗

arXiv2020

Semi-Disentangled Representation Learning in Recommendation System

Disentangled representation has been widely explored in many fields due to its maximal compactness, interpretability and versatility. Recommendation system also needs disentanglement to make representation more explainable and general for downstream tasks. However, some challenges slow its broader application -- the lack of fine-grained labels and the complexity of user-item interactions. To alleviate these problems, we propose a Semi-Disentangled Representation Learning method (SDRL) based on autoencoders. SDRL divides each user/item embedding into two parts: the explainable and the unexplainable, so as to improve proper disentanglement while preserving complex information in representation. The explainable part consists of $internal\ block$ for individual-based features and $external\ block$ for interaction-based features. The unexplainable part is composed by $other\ block$ for other remaining information. Experimental results on three real-world datasets demonstrate that the proposed SDRL could not only effectively express user and item features but also improve the explainability and generality compared with existing representation methods.

cs.SI↗