SearcharxivSearch

arXiv subjects

Dazhuan Xu

Publications and source records attributed to Dazhuan Xu.

11 recordsLinked to original sources

Fundamental Limits of Joint Target Detection and Parameter Estimation - Characterizing Mixed-State Sensing Limits via Posterior Entropy Volume

The development of integrated sensing and communication calls for a unified theoretical foundation for sensing. This paper models target-presence patterns and continuous physical parameters as a mixed discrete-continuous state $Ξ$ on a branched reference measure, and treats posterior entropy volume and joint mutual information as two complementary representations of the same limit. Entropy volume carries physical units, can be compared with engineering scales such as resolution cells, and remains meaningful when the number of active targets varies; mutual information is dimensionless, invariant to coordinates and units, and additive through the chain rule. We define entropy number, entropy volume, and mixed entropy volume for discrete, continuous, and mixed states, respectively. The maximum-entropy principle for the uniform distribution on a support of fixed measure explains the measure-theoretic meaning of the exponential entropy scale, while the main limit follows from a mixed asymptotic equipartition property and a posterior probability-volume inequality through conditional typical sets. For asymptotically reliable high-probability sensing regions, the minimum achievable first-order posterior mixed entropy volume equals the prior mixed entropy volume multiplied by $2^{-I(Ξ;Y)}$, where $I(Ξ;Y)=I(V;Y)+I(X_V;Y\mid V)$. Thus, detection and estimation contributions multiply in the volume domain and add in the bit domain, and one sensing bit halves the posterior effective measure. We further prove that posterior-preserving cascades attain the direct-inference limit, while arbitrary intermediate compression incurs the exact information loss $I(Ξ;Y\mid Z)$. Numerical results for a single-target presence-range model illustrate the information composition, posterior entropy-volume contraction, and cascade-interface loss.

cs.IT

Characterization and Mitigation of Polyphase-Code Artifacts in 5G NR ISAC

Target sensing utilizing 5G NR reference signals has emerged as a prominent research direction in both academia and industry. However, non-ideal factors in practical deployments exert a significant detrimental impact on target sensing performance, manifesting as artifacts in the RV spectrum. These artifacts mask weak targets and cause severe false alarms. To address these challenges, this paper establishes a theoretical model of artifacts and constructs a data-physics-driven deep learning paradigm for artifact mitigation. First, the origin of artifacts and their characteristics are theoretically derived. These analyses demonstrate that the artifacts are associated with polyphase codes, e.g., Zadoff-Chu sequences, and reveal their characteristics, including periodic extensions in the range domain and spectral spreading in the velocity domain. Then, the physical priors of artifacts are formalized as temporal continuity and spatial consistency, informing the design of the training mechanism for the proposed network. Guided by these insights, we propose a PIAENet. At its core is a multi-frame selective-masked encoder-decoder module, explicitly designed to incorporate the above priors. Specifically, temporal continuity is implemented via a multi-frame mechanism to capture features across consecutive RV spectra. Meanwhile, spatial consistency is realized through a selective masking mechanism to enhance reconstruction of artifact-affected regions. Extensive validation is conducted using real-world measured data collected with commercial mmWave equipment. The polyphase-code-related characteristics of the artifacts are experimentally validated. Meanwhile, the experimental results demonstrate that the proposed PIAENet not only effectively reduces the false target count but also improves the detection probability from 79.58% to 98.88%.

eess.SP

Bayesian Probability Fusion for Multi-AP Collaborative Sensing in Mobile Networks

Integrated sensing and communication is widely acknowledged as a foundational technology for next-generation mobile networks. Compared with monostatic sensing, multi-access point (AP) collaborative sensing endows mobile networks with broader, more accurate, and resilient sensing capabilities, which are critical for diverse location-based sectors. This paper focuses on collaborative sensing in multi-AP networks and proposes a Bayesian probability fusion framework for target parameter estimation using orthogonal frequency-division multiplexing waveform. The framework models multi-AP received signals as probability distributions to capture stochastic observations from channel noise and scattering coefficients. Prior information is then incorporated into the joint probability density function to cast the problem as a constrained maximum a posteriori estimation. To address the high-dimensional optimization, we develop a prior-constrained gradient ascent (PCGA) algorithm that decouples correlated parameters and performs efficient gradient updates guided by the target prior. Theoretical analysis covers optimal fusion weights for global signal-to-noise ratio maximization, PCGA convergence, and the Cramer-Rao lower bound of the estimator, with insights applicable to broader fusion schemes. Extensive numerical simulations and real-world experiments with commercial devices show the framework reduces transmission overhead by 90% versus signal fusion and lowers estimation error by 41% relative to parameter fusion. Notably, field tests achieve submeter accuracy with 50% probability in typical coverage of mmWave APs. These improvements highlight a favorable balance between communication efficiency and estimation accuracy for practical multi-AP sensing deployment. The dataset is released for research purposes and is publicly available at: http://pmldatanet.com.cn/dataapp/multimodal

eess.SP

Theoretical Performance Limit for Radar Parameter Estimation

In this paper, we employ the thoughts and methodologies of Shannon's information theory to solve the problem of the optimal radar parameter estimation. Based on a general radar system model, the \textit{a posteriori} probability density function of targets' parameters is derived. Range information (RI) and entropy error (EE) are defined to evaluate the performance. It is proved that acquiring 1 bit of the range information is equivalent to reducing estimation deviation by half. The closed-form approximation for the EE is deduced in all signal-to-noise ratio (SNR) regions, which demonstrates that the EE degenerates to the mean square error (MSE) when the SNR is tending to infinity. Parameter estimation theorem is then proved, which claims that the theoretical RI is achievable. The converse claims that there exists no unbiased estimator whose empirical RI is larger than the theoretical RI. Simulation result demonstrates that the theoretical EE is tighter than the commonly used Cramér-Rao bound and the ZivZakai bound.

cs.IT

Access Point Deployment for Localizing Accuracy and User Rate in Cell-Free Systems

Evolving next-generation mobile networks is designed to provide ubiquitous coverage and networked sensing. With utility of multi-view sensing and multi-node joint transmission, cell-free is a promising technique to realize this prospect. This paper aims to tackle the problem of access point (AP) deployment in cell-free systems to balance the sensing accuracy and user rate. By merging the D-optimality with Euclidean criterion, a novel integrated metric is proposed to be the objective function for both max-sum and max-min problems, which respectively guarantee the overall and lowest performance in multi-user communication and target tracking scenario. To solve the corresponding high dimensional non-convex multi-objective problem, the Soft actor-critic (SAC) is utilized to avoid risk of local optimal result. Numerical results demonstrate that proposed SAC-based APs deployment method achieves $20\%$ of overall performance and $120\%$ of lowest performance.

cs.NI

The Theoretical Limit of Radar Target Detection

In this paper, we solve the optimal target detection problem employing the thoughts and methodologies of Shannon's information theory. Introducing a target state variable into a general radar system model, an equivalent detection channel is derived, and the a posteriori probability distribution is given accordingly. Detection information (DI) is proposed for measuring system performance, which holds for any specific detection method. Moreover, we provide an analytic expression for the false alarm probability concerning the a priori probability. In particular, for a sufficiently large observation interval, the false alarm probability equals the a priori probability of the existing state. A stochastic detection method, the sampling a posteriori probability, is also proposed. The target detection theorem is proved mathematically, which indicates that DI is an achievable theoretical limit of target detection. Specifically, when empirical DI is gained from the sampling a posteriori detection method approaches the DI, the probability of failed decisions tends to be zero. Conversely, there is no detector whose empirical DI is more than DI. Numerical simulations are performed to verify the correctness of the theorems. The results demonstrate that the maximum a posteriori and the Neyman-Pearson detection methods are upper bounded by the theoretical limit.

cs.IT

Optimal Hypothesis Testing Based on Information Theory

There has a major problem in the current theory of hypothesis testing in which no unified indicator to evaluate the goodness of various test methods since the cost function or utility function usually relies on the specific application scenario, resulting in no optimal hypothesis testing method. In this paper, the problem of optimal hypothesis testing is investigated based on information theory. We propose an information-theoretic framework of hypothesis testing consisting of five parts: test information (TI) is proposed to evaluate the hypothesis testing, which depends on the a posteriori probability distribution function of hypotheses and independent of specific test methods; accuracy with the unit of bit is proposed to evaluate the degree of validity of specific test methods; the sampling a posteriori (SAP) probability test method is presented, which makes stochastic selections on the hypotheses according to the a posteriori probability distribution of the hypotheses; the probability of test failure is defined to reflect the probability of the failed decision is made; test theorem is proved that all accuracy lower than the TI is achievable. Specifically, for every accuracy lower than TI, there exists a test method with the probability of test failure tending to zero. Conversely, there is no test method whose accuracy is more than TI. Numerical simulations are performed to demonstrate that the SAP test is asymptotically optimal. In addition, the results show that the accuracy of the SAP test and the existing test methods, such as the maximum a posteriori probability, expected a posteriori probability, and median a posteriori probability tests, are not more than TI.

math.ST

Theoretical Limits of Joint Detection and Estimation for Radar Target

This paper proposes a joint detection and estimation (JDE) scheme based on mutual information for the radar work, whose goal is to choose the true one between target existent and target absence, and to estimate the unknown distance parameter when the target is existent. Inspired by the thoughts of Shannon information theory, the JDE system model is established in the presence of complex white Gaussian noise. We make several main contributions: (1) the equivalent JDE channel and the posterior probability density function are derived based on the priori statistical characteristic of the noise, target scattering and joint target parameter; (2) the performance of the JDE system is measured by the joint entropy deviation and the joint information that is defined as the mutual information between received signal and the joint target parameter; (3) the sampling a posterior probability and cascaded JDEers are proposed, and their performance is measured by the empirical joint entropy deviation the empirical joint information; (4) the joint theorem is proved that the joint information is the available limit of the overall performance, that is, the joint information is available, and the empirical joint information of any JDEer is no greater than the joint information; (5) the cascaded theorem is proved that the sum of empirical detection information and empirical estimation information can approximate the joint information, i.e., the performance limit of cascaded JDEer is available. Simulation results verify the correctness of the joint and the cascaded theorems, and show that the performance of the sampling a posterior probability JDEer is asymptotically optimal. Moreover, the performance of cascaded JDEer can approximate the system performance of JDE system.

cs.IT

Range-Doppler Information and Doppler Scattering Information in Multipulse Radar

In this paper, the general radar measurement probfilems of determining range, Doppler frequency and scatteringproperties parameters are investigated from the viewpoint of Shannons information theory. We adopt the mutual information to evaluate the accuracy of the classification and estimation. The range-Doppler information is examined under the condition that the target is of radial velocity. Its asymptotic upper bound and the corresponding entropy error (EE) are further formulated theoretically. Additionally, the Doppler scattering information induced by targets random motion characteristics is discussed. From the derivation, it is concluded that the Doppler scattering information depends on the eigenvalues of the target scattering correlation matrix. Especially in the case where the pulse interval is larger than targets coherence time, we can find that the formula of the Doppler scattering information is similar to Shannons channel capacity equation, indicating the inherent consistency between the communication theory and radar field. Numerical simulations of these information contents are presented to confirm our theoretical observations. The relationship between the information content and signal-to-noise ratio (SNR) reflects the changes in information acquisition efficiency of a radar system, providing guidance for system designers.

eess.SP

A Practical Non-Stationary Channel Model for Vehicle-to-Vehicle MIMO Communications

In this paper, a practical model for non-stationary Vehicle-to-Vehicle (V2V) multiple-input multiple-output (MIMO) channels is proposed. The new model considers more accurate output phase of Doppler frequency and is simplified by the Taylor series expansions. It is also suitable for generating the V2V channel coefficient with arbitrary velocities and trajectories of the mobile transmitter (MT) and mobile receiver (MR). Meanwhile, the channel parameters of path delay and power are investigated and analyzed. The closed-form expressions of statistical properties, i.e., temporal autocorrelation function (TACF) and spatial cross-correlation function (SCCF) are also derived with the angle of arrival (AoA) and angle of departure (AoD) obeying the Von Mises (VM) distribution. In addition, the good agreements between the theoretical, simulated and measured results validate the correctness and usefulness of the proposed model.

eess.SP

Optimization Design and Analysis of Systematic LT codes over AWGN Channel

In this paper, we study systematic Luby Transform (SLT) codes over additive white Gaussian noise (AWGN) channel. We introduce the encoding scheme of SLT codes and give the bipartite graph for iterative belief propagation (BP) decoding algorithm. Similar to low-density parity-check codes, Gaussian approximation (GA) is applied to yield asymptotic performance of SLT codes. Recent work about SLT codes has been focused on providing better encoding and decoding algorithms and design of degree distributions. In our work, we propose a novel linear programming method to optimize the degree distribution. Simulation results show that the proposed distributions can provide better bit-error-ratio (BER) performance. Moreover, we analyze the lower bound of SLT codes and offer closed form expressions.

cs.IT