Searcharxiv⌕ Search

arXiv subjects

Zeyan Zhuang

Publications and source records attributed to Zeyan Zhuang.

8 recordsLinked to original sources

Prospective Importance-based Cognitive Pilot Design for Semantic Sensing in ISAC Systems

Semantic sensing enables integrated sensing and communication (ISAC) systems to acquire environmental information relevant to downstream tasks. However, existing pilot design methods either rely on static pilot configurations or learn end-to-end pilot selection policies, without explicitly evaluating the semantic contribution of candidate pilot locations. In this work, we propose a cognitive semantic sensing framework for human activity recognition in orthogonal frequency division multiplexing (OFDM)-ISAC systems. Rather than directly learning a high-dimensional mapping from observations to pilot locations, we introduce a semantic importance weight (SIW) to measure the semantic contribution of each candidate pilot location. Leveraging the information bottleneck (IB) principle and the mutual information-minimum mean-square error (I-MMSE) relationship, SIW assigns high values to future time-frequency (TF) channel coefficients that are both difficult to infer from the preceding observations and valuable for downstream inference. To efficiently obtain the SIW, we further develop a conditional diffusion model that predicts the corresponding uncertainty through denoising covariance estimation. Experiments on a real-world Wi-Fi sensing dataset show that the proposed method consistently outperforms baselines across different signal-to-noise ratios (SNRs) and pilot budgets.

eess.SP↗

2D Coprime Pilots for Delay-Doppler Sensing in OFDM-ISAC Systems

Integrated Sensing and Communication (ISAC) is envisioned to endow future 6G systems with seamless sensing capabilities. To support efficient sensing with minimum communication overhead, sparse pilots embedded within communication frames have emerged as a promising solution. Along this line of research, existing studies have achieved engaging results in maximizing the unambiguous sensing region. However, jointly maximizing the sensing region and sensing accuracy remains challenging due to the lack of a unified performance metric and an effective pilot design framework. This paper jointly optimizes the unambiguous sensing region and sensing accuracy for estimating delay-Doppler (DD) parameters in Orthogonal Frequency Division Multiplexing (OFDM)-ISAC systems, where sensing mutual information (SMI) is adopted as a unified performance metric to characterize the overall sensing capability. Specifically, the joint optimization is formulated as an SMI maximization problem by systematically resolving sensing ambiguity and optimizing sensing accuracy. In particular, based on the generalized Bezout identity, we derive a 2D (timefrequency) coprime condition, which, as far as the authors know, is the first necessary and sufficient condition to achieve the unique estimation of DD parameters in the literature. Under this unambiguous condition, we further propose an Adam-Guided Iterative Refinement (AGIR) algorithm to optimize the sensing accuracy. Numerical results demonstrate the advantage of the proposed framework over existing designs, owing to the freedom offered by the 2D coprime condition in optimizing the sensing accuracy.

eess.SP↗

A Unified Framework for Characterizing General MIMO Channels

Modern MIMO systems are evolving toward higher-dimensional and more flexible architectures, such as distributed and holographic MIMO, offering substantial benefits while giving rise to increasingly complex channel correlation structures. This growing architectural diversity makes it difficult to characterize the fundamental limits of different MIMO systems on a case-by-case basis, motivating a unified analytical framework applicable across a broad range of architectures. This paper addresses this research gap by investigating a generally correlated Rayleigh channel whose vectorized form follows a general Gaussian distribution with an arbitrary covariance matrix. For that purpose, we first prove that the spectral norm of the channel matrix is bounded in the asymptotic regime where the numbers of transmit and receive antennas grow proportionally. We then derive a deterministic approximation for the ergodic mutual information, with an explicit convergence rate governed by the structure of the channel correlation. The approximation is characterized by a pair of matrix-valued self-consistent equations, for which we establish the existence and uniqueness of the solution and propose an iterative numerical algorithm. Furthermore, we develop a framework based on positive linear maps to analyze the stability of these equations, which can facilitate the spectral analysis of broader classes of random matrices. The proposed characterization unifies many existing results for structured MIMO channels as special cases while remaining applicable to a broad class of general MIMO architectures that are difficult to evaluate using existing analytical frameworks. To demonstrate its utility, we apply the developed theory to two representative systems, namely downlink distributed MIMO and uplink heterogeneous MIMO. Numerical results confirm the accuracy of the derived deterministic approximations.

cs.IT↗

Task-Oriented Precoding for Edge Inference over Large-Scale MIMO Systems

Future wireless networks are expected to support networked artificial intelligence (AI) services, where multiple devices transmit learned features to an edge server for distributed inference. This setting calls for task-oriented physical-layer optimization, where wireless transmission should preserve useful information for inference rather than only maximize the rate or reconstruct the transmitted signals. A key physical-layer control variable is the multiple-input multiple-output precoder, which determines how device features are shaped and combined over wireless channels. Existing task-oriented precoding methods typically adapt the precoder to instantaneous channel state information at the transmitter (CSIT). However, in multi-device MIMO systems, acquiring the aggregate channel, feeding back CSI or optimized precoders, and reoptimizing across coherence blocks introduce substantial overhead. This paper develops a random-matrix-theoretic framework based on statistical CSIT that designs a slow-timescale precoder from channel covariance statistics and training-set feature statistics, without requiring instantaneous CSIT. We adopt maximal coding rate reduction (MCR${^2}$) to measure the class separability of the received features, yielding a task-aware utility for MIMO precoder design. Since this utility still depends on random small-scale fading, we derive a deterministic approximation that converts it into a fixed-point objective depending only on long-term statistics and large-system dimension ratios via random matrix theory. A projected block-coordinate ascent and successive convex approximation algorithm is developed to optimize this deterministic objective under per-device power constraints. Experiments on ModelNet10 verify the approximation and show that the proposed statistical precoder improves task-aware mode allocation and inference performance over competitive benchmarks.

cs.IT↗

No Eigenvalues Outside the Limiting Support of Generally Correlated and Noncentral Sample Covariance Matrices

Spectral properties of random matrices play an important role in statistics, machine learning, communications, and many other areas. Engaging results regarding the convergence of the empirical spectral distribution (ESD) and the ``no-eigenvalue'' property have been obtained for random matrices with different correlation structures. However, the related spectral analysis for generally correlated and noncentral random matrices is still incomplete, and this paper aims to fill this research gap. Specifically, we consider matrices whose columns are independent but with non-zero means and non-identical correlations. Under high-dimensional asymptotics where both the number of rows and columns grow simultaneously to infinity, we first establish the almost sure convergence of the ESD for the concerned random matrices to a deterministic limit, assuming mild conditions. Furthermore, we prove that with probability 1, no eigenvalues will appear in any closed interval outside the support of the limiting distribution for matrices with sufficiently large dimensions. The above results can be applied to different areas such as statistics, wireless communications, and signal processing. In this paper, we apply the derived results to two communication scenarios: 1) We determine the limiting performance of the signal-to-interference-plus-noise ratio for multi-user multiple-input multiple-output (MIMO) systems with linear minimum mean-square error receivers; and 2) We establish the invertibility of zero-forcing precoding matrices in downlink MIMO systems, providing theoretical guarantees.

math.ST↗

Decentralized MIMO Systems with Imperfect CSI using LMMSE Receivers

Centralized baseband processing (CBP) is required to achieve the full potential of massive multiple-input multiple-output (MIMO) systems. However, due to the large number of antennas, CBP suffers from two major issues: 1) Tremendous data interconnection between radio frequency (RF) circuitry and processing fabrics; and 2) high-dimensional computation. To this end, decentralized baseband processing (DBP) has been proposed, where the antennas at the BS are partitioned into clusters connected to separate RF circuits and equipped with separate computing units. Unfortunately, due to the decentralized structure, the optimal fusion scheme and performance analysis for DBP with general spatial correlation between clusters and imperfect channel state information (CSI) are not available in the literature. In this paper, we consider a decentralized MIMO system where all clusters adopt linear minimum mean-square error (LMMSE) receivers with imperfect CSI. Specifically, we first establish the optimal linear fusion scheme which has high computational and data input/output (I/O) costs. To reduce the costs, we further propose two sub-optimal fusion schemes with reduced complexity. For all three schemes, we derive the closed-form expressions for the signal-to-interference-and-noise ratio (SINR) by leveraging random matrix theory (RMT) and demonstrate the conditions under which the sub optimal schemes are optimal. Furthermore, we determine the optimal regularization parameter for decentralized LMMSE receivers, identify the best antenna partitioning strategy, and prove that the SINR will decrease as the number of clusters increases. Numerical simulations validate the accuracy of the theoretical results.

cs.IT↗

Fundamental Limits of Two-Hop MIMO Channels: An Asymptotic Approach

Multi-antenna relays and intelligent reflecting surfaces (IRSs) have been utilized to construct favorable channels to improve the performance of wireless systems. A common feature between relay systems and IRS-aided systems is the two-hop multiple-input multiple-output (MIMO) channel. As a result, the mutual information (MI) of two-hop MIMO channels has been widely investigated with very engaging results. However, a rigorous investigation on the fundamental limits of two-hop MIMO channels, i.e., the first and second-order analysis, is not yet available in the literature, due to the difficulties caused by the two-hop (product) channel and the noise introduced by the relay (active IRS). In this paper, we employ large-scale random matrix theory (RMT), specifically Gaussian tools, to derive the closed-form deterministic approximation for the mean and variance of the MI. Additionally, we determine the convergence rate for the mean, variance and the characteristic function of the MI, and prove the asymptotic Gaussianity. Furthermore, we also investigate the analytical properties of the fundamental equations that describe the closed-form approximation and prove the existence and uniqueness of the solution. An iterative algorithm is then proposed to obtain the solution for the fundamental equations. Numerical results validate the accuracy of the theoretical analysis.

cs.IT↗

Active IRS-Aided MIMO Systems: How Much Gain Can We Get?

Intelligent reflecting surfaces (IRSs) have emerged as a promising technology to improve the efficiency of wireless communication systems. However, passive IRSs suffer from the ``multiplicative fading" effect, because the transmit signal will go through two fading hops. With the ability to amplify and reflect signals, active IRSs offer a potential way to tackle this issue, where the amplification energy only experiences the second hop. However, the fundamental limit and system design for active IRSs have not been fully understood, especially for multiple-input multiple-output (MIMO) systems. In this work, we consider the analysis and design for the large-scale active IRS-aided MIMO system assuming only statistical channel state information (CSI) at the transmitter and the IRS. The evaluation of the fundamental limit, i.e., ergodic rate, turns out to be a very difficult problem. To this end, we leverage random matrix theory (RMT) to derive the deterministic approximation (DA) for the ergodic rate, and then design an algorithm to jointly optimize the transmit covariance matrix at the transmitter and the reflection matrix at the active IRS. Numerical results demonstrate the accuracy of the derived DA and the effectiveness of the proposed optimization algorithm. The results in this work reveal interesting physical insights with respect to the advantage of active IRSs over their passive counterparts.

cs.IT↗