SearcharxivSearch

arXiv subjects

Xiaohu You

Publications and source records attributed to Xiaohu You.

At least 19 recordsLinked to original sources

A general performance analysis framework for bitwise neural polar decoding

This paper investigates when the population mean-squared error (MSE) of a bitwise neural predictor is sufficient to guarantee a bit-error rate (BER) close to the successive-cancellation (SC) reference performance. Each synthesized message channel is formulated as a soft maximum a posteriori (MAP) regression problem. Architecture-independent direct and posterior-margin MSE-to-BER bounds then convert certified population MSE into an SC-referenced reliability requirement, while an independent held-out certificate makes the population condition verifiable from data. A three-layer over-parameterized neural network (ONN) decoder, comprising an input layer, one over-parameterized rectified linear unit (ReLU) hidden layer, and a fixed-sign output layer, provides a constructive instance with provable empirical MSE convergence under explicit full-batch gradient-descent conditions. A (128,64) shared-message-update polar factor-graph neural decoder is further evaluated over additive white Gaussian noise (AWGN) and block-Rayleigh channels to examine architecture-independent certification and engineering performance. The resulting reliability-certification framework connects trainability, population regression accuracy, and communication reliability. It provides verifiable sufficient conditions for an SC-referenced BER guarantee and its associated block-error rate (BLER) characterization.

eess.SP

Intelligent Base Station Deployment in Urban Wireless Networks: A Geographic Data-Informed Digital Twin Approach

The placement of base station (BS) is a fundamental determinant of coverage and capacity of urban wireless networks. Yet large-scale BS deployment optimization remains challenging due to its dependency on site-specific radio propagation and user spatial distributions, both of which are unfortunately difficult to obtain prior to deployment. To overcome this barrier, we propose an intelligent BS deployment framework that integrates a geographic data-informed wireless network digital twin (DT) with deep reinforcement learning (DRL), enabling sample-free macro BS deployment optimization from solely open geographic data, without on-site measurements, real user trajectories, or exhaustive ray tracing. The proposed DT incorporates a sample-free radio map prediction model with hybrid input representation to achieve kilometer-scale signal strength estimation in milliseconds, complemented by a diffusion-based generative model for trajectory synthesis to collectively characterize channel and user distributions. Leveraging the DT as a virtual training environment, we formulate BS deployment as a multi-step Markov decision process (MDP) and solve it via a spatially structured DRL algorithm. A local search process and a Wasserstein distance-based deployment buffer are further incorporated to efficiently explore the large combinatorial solution space. Experimental results in real-world urban scenarios demonstrate that the geographic data-informed DT attains accuracy comparable to 100-sample-based prediction, and the intelligent BS deployment framework achieves up to 98.9% of the idealized benchmark performance while reducing optimization overhead by over 99%.

cs.NI

Pinching Antennas for Next-Generation Wireless Communications: A Network Perspective

Pinching antennas enable radiation points to be created and reconfigured along extended waveguides, making the physical locations of wireless transmission and reception controllable after infrastructure deployment. This capability introduces a spatial degree of freedom beyond conventional beamforming and resource allocation, with implications that extend from individual links to network-wide operation. This tutorial develops a network-oriented perspective on pinching-antenna systems. We first review their system architecture, channel characteristics, and fundamental design opportunities. We then examine how radiation-location reconfigurability can support environment-division multiple access by strengthening desired links and suppressing cross-links, and discuss its roles in multi-cell transmission, traffic offloading, and inter-cell cooperation. Moving from instantaneous users to entire service regions, we introduce traffic-aware and geometry-aware designs under a cell-free-inspired multi-waveguide architecture. Representative system models, optimization problems, analytical illustrations, and numerical results are provided to explain the main design tradeoffs and network-level insights. We further discuss generalized physical realizations and representative deployment modes, including standalone, conventional base-station-integrated, and distributed deployments, together with their main implementation considerations. Finally, we identify future research directions involving mobility management, programmable and virtualized radio access, environment knowledge acquisition, AI-native control, low-altitude networks, space-air-ground integration, and integrated sensing and communication. Overall, this tutorial presents radiation locations as configurable network resources and provides a framework for understanding how pinching antennas may reshape future wireless network.

eess.SP

Should I Use This Synthetic Dataset for Training? How to Test with Minimal Real Data

Digital twins (DTs) and learned world models are increasingly used to generate synthetic data that augment the scarce real datasets available for training artificial intelligence (AI) models in engineering systems. Owing to the inevitable simulation-to-reality (sim-to-real) gap, however, augmentation may fail to improve the performance of the trained model on the real data distribution. This paper addresses the resulting decision problem: Given a real dataset, a candidate synthetic dataset, and a fixed learning algorithm, decide whether training on the augmented dataset improves the true, population-level performance, while consuming as few real test data points as possible. Two formulations are considered: a direct test on the mean loss difference between the two trained models, and a symmetry-based test on the paired loss difference, which trades a stronger null assumption for faster evidence accumulation. For the latter, we introduce the {adaptive e-process sign-flip test} (aeSFT), a doubly adaptive procedure that adapts both the number of Monte Carlo sign-flip rounds, and hence the computational cost, and the amount of real test data consumed. aeSFT yields anytime-valid Type-I error control, with no need to pre-specify the test-set size. Experiments on a synthetic-data classification task, a DT-aided wireless packet-scheduling task, and a radio-map prediction task show that aeSFT identifies useful synthetic data using substantially fewer real test samples than mean-based sequential testing, matches the power of fixed-sample sign-flip testing and the paired $t$-test, while keeping the false-positive rate below the target level.

cs.AI

Transfer Learning-Enabled Distortion Compensation for Amplitude-Phase-Time Block Modulation-Based Nonlinear Single-Carrier Wireless Communications

Power amplifier (PA) nonlinearity and memory effects significantly limit the spectral compliance, reliability, and energy efficiency of communication systems. To address this, we propose a transfer-learning-enabled, fully digital transceiver-cooperative method for amplitude-phase-time block modulation (APTBM)-based nonlinear single-carrier transmission under adjacent channel leakage ratio (ACLR) constraints. At the transmitter, iterative clipping and filtering (ICAF) and static digital pre-distortion (SDPD) act jointly to reduce signal peaks and suppress spectral regrowth without requiring wideband feedback. At the receiver, the inherent amplitude-phase constraints of APTBM provide weakly supervised prior knowledge for offline inverse-model pretraining, which is followed by the online few-shot adaptation of a lightweight digital post-distortion (DPoD) network. Subsequently, a cascaded DPoD and clipping-noise cancellation scheme systematically compensates for residual distortions induced by both the PA and ICAF. Simulation and measurement results demonstrate reliable transmission at an input back-off of approximately 2 dB under a 30-dBc ACLR constraint. Furthermore, the proposed DPoD approach significantly reduces online training time and computational overhead, delivering a performance gain of over 2 dB compared to conventional learning-based DPoD schemes.

eess.SP

Semi-Blind Fluid Antenna System: Port Selection via Statistical Analysis

The fluid antenna system (FAS) enables position reconfigurability. A potential drawback of real-time FAS, however, is that it requires complete channel state information (CSI) for each FAS port at every communication time slot, an approach referred to as ideal-FAS. Recognizing the difficulties of achieving ideal-FAS, we propose a FAS scheme based on incomplete CSI, referred to as semi-blind FAS. This paper first introduces the spatial-temporal framework of FAS, upon which the proposed semi-blind FAS is developed. The proposed semi-blind FAS is lightweight and computationally efficient, scalable to an arbitrary number of ports and time slots, and operates without pre-training or deep learning structures. The scheme effectively exploits incomplete historical CSI to estimate the conditional distribution across all FAS ports at the desired time slot, thereby identifying the statistical optimal port for signal reception. Generally, the key idea of semi-blind FAS is to select the optimal port through conditional distribution analysis, from a statistical perspective, with optimality defined according to the scenario of interest. Inspired by information-theoretic entropy, we further develop the residual entropy power ratio to characterize how physical parameters influence the performance gap between semi-blind FAS and ideal-FAS. Our analysis reveals that estimation performance depends not only on the number of sampled ports and time slots, but also on the specific indices of ports with given CSI at each time slot, i.e., the port sampling strategy. This critical factor has been largely overlooked in existing port estimation studies. Numerical results demonstrate that the proposed semi-blind FAS achieves performance comparable to, and in some cases indistinguishable from, that of ideal-FAS, while requiring significantly fewer port CSI measurements and lower port switching speeds.

eess.SP

Channel Knowledge Map Reconstruction From Sparse Measurements via Pilot-Anchored Layout-Conditioned Fourier Refinement

Channel knowledge maps (CKMs) enable environment-aware wireless systems by providing location-specific channel knowledge, but long-term environmental variations, such as construction, traffic redistribution, and foliage changes, require periodic map refresh. In practice, channel measurements are often sparse and irregular, while environmental knowledge may be limited to coarse layout or topology descriptors. This paper studies CKM reconstruction from sparse measurements. We show that reconstruction pipelines that apply local aggregation or spectral operators directly to a zero-filled pilot grid can entangle the sampling mask with the channel field, allowing structural priors to act on mask-induced distortions before the measurements define a supported radio field. To address this issue, we propose Anchor-CKM, a measurement-first, knowledge-aided reconstruction framework. Anchor-CKM first uses support-aware partial convolutions to construct a pilot-supported representation, and then performs layout-conditioned dual-path Fourier refinement followed by coordinate-based heteroscedastic prediction of the CKM mean and per-location predictive variance. Experiments on transmitter-disjoint DeepMIMO scenarios cover missing ratios from 0.3 to 0.95, including stringent 5% to 10% pilot-coverage settings. In explicit-layout outdoor scenarios, Anchor-CKM reduces received-power root-mean-square error (RMSE) by 0.79 to 1.33 dB relative to the strongest reproduced baseline, while ablations identify pilot-support stabilization as the largest contributor and layout conditioning as beneficial for line-of-sight/non-line-of-sight (LOS/NLOS) boundary fidelity.

eess.SP

Towards World Model-Empowered Integrated Sensing, Communication, and Decision for Complex Unmanned Systems

Complex unmanned systems comprising satellites, unmanned aerial vehicles (UAVs), unmanned ground vehicles (UGVs), and quadruped robots are increasingly deployed to perform large-scale sensing and autonomous operations. We propose a world model-empowered sensing, communication, decision (SCD) integration framework for complex unmanned communication networks. The proposed architecture establishes a closed-loop system where a unified world model jointly optimizes time-sensitive sensing, wireless communication, and intelligent decision-making. To regulate sensing freshness and reduce redundant data generation, we propose a time-sensitive age of information (AoI)-driven sensing mechanism that dynamically schedules sensing updates based on task urgency and predictive uncertainty. Furthermore, a predictive world model is developed to jointly represent environmental dynamics, wireless channel evolution, and agent mobility within a hybrid deterministic-stochastic latent space. This enables proactive communication scheduling and decision evaluation via latent rollout. To support large-scale heterogeneous coordination, a multi-granularity knowledge graph is further designed to organize cross-population relationships among satellites, UAVs, UGVs, and ground agents. Numerical results demonstrate that the proposed SCD framework outperforms conventional systems, highlighting the significant potential of world models for supporting unmanned systems.

cs.IT

Toward Trustworthy Digital Twins in AI Agent-based Wireless Network Optimization: Challenges, Solutions, and Opportunities

Optimizing modern wireless networks is exceptionally challenging due to their high dynamism and complexity. While the AI agent powered by reinforcement learning (RL) offers a promising solution, its practical application is limited by prohibitive exploration costs and potential risks in the real world. The emerging digital twin (DT) technology provides a safe and controlled virtual environment for agent training, but its effectiveness critically depends on the DT's reliability. Policies trained in an unreliable DT that does not accurately represent the physical network may experience severe performance degradation upon real-world deployment. In this article, we introduce a new DT evaluation framework to ensure trustworthy DTs in AI agent-based network optimization. This framework shifts from model-level accuracy, such as wireless channel and user trajectory similarities, to a more holistic, task-centric DT assessment, which relies on the Markov decision process that the agent actually perceives. We demonstrate it as an effective guideline for design, selection, and lifecycle management of wireless network DTs. A comprehensive case study on a real-world wireless network testbed shows how this evaluation framework is used to pre-filter candidate DTs, leading to a significant reduction in training and testing costs without sacrificing deployment performance. Finally, potential research opportunities are discussed.

eess.SY

Node-Based Soft-Output Fast Successive Cancellation List Decoding of Polar Codes

The soft-output successive cancellation list (SO-SCL) decoder provides a methodology for estimating the a-posteriori probability log-likelihood ratios by only leveraging the conventional SCL decoder of polar codes. However, the sequential decoding nature of SCL introduces high decoding latency to SO-SCL. In this paper, we incorporate node-based fast decoding into the SO-SCL framework. After addressing the challenge of soft output extraction in special node decoding, we proposed the soft-output fast SCL (SO-FSCL) decoding algorithm, along with its log-domain implementation and hardware-friendly version. The proposed SO-FSCL decoder can be regarded as an add-on extension to FSCL decoder, enabling us to autonomously choose whether to output only hard decisions like FSCL or to provide additional soft outputs. Latency and complexity analyses demonstrate that SO-FSCL can significantly reduce, for example, decoding time steps by 81.8\% (with unlimited resources), the number of additions by 41.3\%, and the number of comparisons by 46.4\%. Meanwhile, simulation results indicate that SO-FSCL delivers almost the same soft-output performance as SO-SCL, outperforming other soft-output polar decoders, especially in scenarios involving iterative decoding.

cs.IT

Two-Stage Signal Reconstruction for Amplitude-Phase-Time Block Modulation-based Communications

Operating power amplifiers (PAs) at lower input back-off (IBO) levels is an effective way to improve PA efficiency, but often introduces severe nonlinear distortion that degrades transmission performance. Amplitude-phase-time block modulation (APTBM) has recently emerged as an effective solution to this problem. The intrinsic amplitude and phase constraints of each APTBM block can be leveraged to mitigate PA-induced nonlinear distortion via constraint-guided signal reconstruction. However, existing reconstruction methods apply these constraints only heuristically and statistically, limiting the achievable IBO reduction and PA efficiency improvement. This paper addresses this limitation by decomposing the nonlinear distortion into dominant and residual components, and accordingly develops a novel two-stage signal reconstruction algorithm consisting of coarse and fine reconstruction stages. The coarse reconstruction stage eliminates the dominant distortion by jointly exploiting the APTBM block structure and PA nonlinear characteristics. Subsequently, the fine reconstruction stage minimizes the residual distortion by casting it as a nonconvex optimization problem subject to explicit APTBM constraints, for which a closed-form solution is derived. The proposed algorithm is validated through comprehensive numerical simulations and testbed experiments. Results show that, without compromising transmission quality, the proposed algorithm enables an additional IBO reduction of approximately 5 dB in simulations and 2 dB in experiments over baseline methods, yielding relative PA efficiency improvements of 77.8\% and 30.9\%, respectively.

eess.SP

Spatiotemporal 2-D Polar Codes over Non-Uniform MIMO Channels: A Reliability-Aware Construction Approach

With the increasing demand for ultra-reliable and low-latency communication (URLLC), spatiotemporal two-dimensional (2-D) channel coding has received growing interest. By leveraging the spatial degrees of freedom in massive multiple-input multiple-output (MIMO) systems, it shortens the time-domain blocklength, thereby reducing latency and enhancing reliability. However, existing spatiotemporal coding schemes typically assume uniform reliability across spatial streams. This assumption does not hold in practical MIMO channels, where the underlying propagation environment generally leads to unequal spatial-eigenmode gains and reliabilities, making the conventional Gaussian-approximation-based construction for 2-D polar codes less effective. This paper investigates spatiotemporal 2-D polar coding over non-uniform MIMO channels, where the spatial domain exhibits inherently heterogeneous signal-to-noise ratios (SNRs). We propose a reciprocal channel approximation (RCA)-based reliability-aware 2-D polar coding framework that accurately characterizes such heterogeneous SNRs without relying on log-likelihood-ratio distribution assumptions. Simulation results demonstrate that the proposed RCA-based spatiotemporal 2-D polar coding scheme achieves clear performance gains and strong robustness, confirming its effectiveness in jointly exploiting temporal and spatial polarization for URLLC in practical MIMO systems.

cs.IT

RieIF: Knowledge-Driven Riemannian Information Flow for Robust Spatio-Temporal Graph Signal Prediction in 6G Wireless Networks

With 6G evolving towards intelligent network autonomy, artificial intelligence (AI)-native operations are becoming pivotal. Wireless networks continuously generate rich and heterogeneous data, which inherently exhibits spatio-temporal graph structure. However, limited radio resources result in incomplete and noisy network measurements. This challenge is further intensified when a target variable and its strongest correlates are missing over contiguous intervals, forming systemic blind spots. To tackle this issue, we propose RieIF (Knowledge-driven Riemannian Information Flow), a geometry-consistent framework that incorporates knowledge graphs (KGs) for robust spatio-temporal graph signal prediction. For analytical tractability within the Fisher-Rao geometry, we project the input from a Riemannian manifold onto a positive unit hypersphere, where angular similarity is computationally efficient. This projection is implemented via a graph transformer, using the KG as a structural prior to constrain attention and generate a micro stream. Simultaneously, a Long Short-Term Memory (LSTM) model captures temporal dynamics to produce a macro stream. Finally, the micro stream (highlighting geometric shape) and the macro stream (emphasizing signal strength) are adaptively fused through a geometric gating mechanism for signal recovery. Experiments on three wireless datasets show consistent improvements under systemic blind spots, including up to 31% reduction in root mean squared error and up to 3.2 dB gain in recovery signal-to-noise ratio, while maintaining robustness to graph sparsity and measurement noise.

eess.SP

Generalized Pinching-Antenna Systems: A Tutorial on Principles, Design Strategies, and Future Directions

Pinching-antenna systems have emerged as a novel and transformative flexible-antenna architecture for next-generation wireless networks. They offer unprecedented flexibility and spatial reconfigurability by enabling dynamic positioning and activation of radiating elements along a signal-guiding medium (e.g., dielectric waveguides), which is not possible with conventional fixed antenna systems. In this paper, we introduce the concept of generalized pinching antenna systems, which retain the core principle of creating localized radiation points on demand, but can be physically realized in a variety of settings. These include implementations based on dielectric waveguides, leaky coaxial cables, surface-wave guiding structures, and other types of media, employing different feeding methods and activation mechanisms (e.g., mechanical, electronic, or hybrid). Despite differences in their physical realizations, they all share the same inherent ability to form, reposition, or deactivate radiation sites as needed, enabling user-centric and dynamic coverage. We first describe the underlying physical mechanisms of representative generalized pinching-antenna realizations and their associated wireless channel models, highlighting their unique propagation and reconfigurability characteristics compared with conventional antennas. Then, we review several representative pinching-antenna system architectures, ranging from single- to multiple-waveguide configurations, and discuss advanced design strategies tailored to these flexible deployments. Furthermore, we examine their integration with emerging wireless technologies to enable synergistic, user-centric solutions. Finally, we identify key open research challenges and outline future directions, charting a pathway toward the practical deployment of generalized pinching antennas in next-generation wireless networks.

eess.SP

Large Language Model Empowered CSI Feedback in Massive MIMO Systems

Despite the success of large language models (LLMs) across domains, their potential for efficient channel state information (CSI) compression and feedback in frequency division duplex (FDD) massive multiple-input multiple-output (mMIMO) systems remains largely unexplored yet increasingly important. In this paper, we propose a novel LLM-based framework for CSI feedback to exploit the potential of LLMs. We first reformulate the CSI compression feedback task as a masked token prediction task that aligns more closely with the functionality of LLMs. Subsequently, we design an information-theoretic mask selection strategy based on self-information, identifying and selecting CSI elements with the highest self-information at the user equipment (UE) for feedback. This ensures that masked tokens correspond to elements with lower self-information, while visible tokens correspond to elements with higher self-information, thus maximizing the accuracy of LLM predictions.

cs.IT

Experimental Performance of Bidirectional Phase Coherent Transmission and Sensing for mmWave Cell-free Massive MIMO Systems with Reciprocity Calibration

Phase synchronization among distributed transmission reception points (TRPs) is a prerequisite for enabling coherent joint transmission and high-precision sensing in millimeter wave (mmWave) cell-free massive multiple-input and multiple-output (MIMO) systems. This paper proposes a bidirectional calibration scheme and a calibration coefficient estimation method for phase synchronization, and presents a calibration coefficient phase tracking method using unilateral uplink/downlink channel state information (CSI). Furthermore, this paper introduces the use of reciprocity calibration to eliminate non-ideal factors in sensing and leverages sensing results to achieve calibration coefficient phase tracking in dynamic scenarios, thus enabling bidirectional empowerment of both communication and sensing. Simulation results demonstrate that the proposed method can effectively implement reciprocal calibration with lower overhead, enabling coherent collaborative transmission, and resolving non-ideal factors to acquire lower sensing error in sensing applications. Experimental results show that, in the mmWave band, over-the-air (OTA) bidirectional calibration enables coherent collaborative transmission for both collaborative TRPs and collaborative user equipments (UEs), achieving beamforming gain and long-time coherent sensing capabilities.

eess.SP

A Tutorial on MIMO-OFDM ISAC: From Far-Field to Near-Field

Integrated sensing and communication (ISAC) is one of the key usage scenarios for future sixth-generation (6G) mobile communication networks, where communication and sensing (C&S) services are simultaneously provided through shared wireless spectrum, signal processing modules, hardware, and network infrastructure. Such an integration is strengthened by the technology trends in 6G, such as denser network nodes, larger antenna arrays, wider bandwidths, higher frequency bands, and more efficient utilization of spectrum and hardware resources, which incentivize and empower enhanced sensing capabilities. As the dominant waveform used in contemporary communication systems, orthogonal frequency division multiplexing (OFDM) is still expected to be a very competitive technology for 6G, rendering it necessary to thoroughly investigate the potential and challenges of OFDM ISAC. Thus, this paper aims to provide a comprehensive tutorial overview of ISAC systems enabled by large-scale multi-input multi-output (MIMO) and OFDM technologies and to discuss their fundamental principles, advantages, and enabling signal processing methods. To this end, a unified MIMO-OFDM ISAC system model is first introduced, followed by four frameworks for estimating parameters across the spatial, delay, and Doppler domains, including parallel one-domain, sequential one-domain, joint two-domain, and joint three-domain parameter estimation. Next, sensing algorithms and performance analyses are presented in detail for far-field scenarios where uniform plane wave (UPW) propagation is valid, followed by their extensions to near-field scenarios where uniform spherical wave (USW) characteristics need to be considered. Finally, this paper points out open challenges and outlines promising avenues for future research on MIMO-OFDM ISAC.

eess.SP

A Theoretical Analysis of State Similarity Between Markov Decision Processes

The bisimulation metric (BSM) is a powerful tool for analyzing state similarities within a Markov decision process (MDP), revealing that states closer in BSM have more similar optimal value functions. While BSM has been successfully utilized in reinforcement learning (RL) for tasks like state representation learning and policy exploration, its application to state similarity between multiple MDPs remains challenging. Prior work has attempted to extend BSM to pairs of MDPs, but a lack of well-established mathematical properties has limited further theoretical analysis between MDPs. In this work, we formally establish a generalized bisimulation metric (GBSM) for measuring state similarity between arbitrary pairs of MDPs, which is rigorously proven with three fundamental metric properties, i.e., GBSM symmetry, inter-MDP triangle inequality, and a distance bound on identical spaces. Leveraging these properties, we theoretically analyze policy transfer, state aggregation, and sampling-based estimation across MDPs, obtaining explicit bounds that are strictly tighter than existing ones derived from the standard BSM. Additionally, GBSM provides a closed-form sample complexity for estimation, improving upon existing asymptotic results based on BSM. Numerical results validate our theoretical findings and demonstrate the effectiveness of GBSM in multi-MDP scenarios.

cs.LG