SearcharxivSearch

arXiv subjects

Jingxuan Huang

Publications and source records attributed to Jingxuan Huang.

7 recordsLinked to original sources

Towards Intelligent Low-Altitude Wireless Network Deployment: Differentiable Channel Knowledge Map Construction and Trajectory Design

Channel knowledge map (CKM) has emerged as a promising technique to leverage prior propagation knowledge in low-altitude wireless networks (LAWNs), yet state-of-the-art grid-based CKM construction methods struggle to support efficient LAWN deployment due to their lack of differentiability with respect to continuous locations of unmanned aerial vehicles (UAVs). To overcome this limitation, we propose a differentiable CKM-triggered trajectory optimization framework for LAWNs. Firstly, we propose a location-oriented CKM construction method that directly maps continuous spatial coordinates to channel gain. In particular, a shared convolutional neural network (CNN) is employed to encode high-level environmental features from conditional inputs. These features are then sampled based on location information to form a fused regressor-conditional multilayer perceptron (c-MLP) or conditional Kolmogorov-Arnold network (cKAN)-for channel gain prediction. We further propose a joint power, bandwidth, and trajectory optimization (JPBTO) method for multi-UAV systems, with the constructed differentiable CKM employed to evaluate the communication performance. The formulated non-convex problem is solved via alternating optimization and successive convex approximation. Numerical results show that the proposed framework enables location-aware differentiability of the CKM, while achieving higher accuracy than the methods without environmental features. Furthermore, the proposed CKM-JPBTO achieves a significantly higher minimum throughput than the conventional statistical channel model-based JPBTO.

eess.SP

Rateless DeepJSCC for Broadcast Channels: a Rate-Distortion-Complexity Tradeoff

In recent years, numerous data-intensive broadcasting applications have emerged at the wireless edge, calling for a flexible tradeoff between distortion, transmission rate, and processing complexity. While deep learning-based joint source-channel coding (DeepJSCC) has been identified as a potential solution to data-intensive communications, most of these schemes are confined to worst-case solutions, lack adaptive complexity, and are inefficient in broadcast settings. To overcome these limitations, this paper introduces nonlinear transform rateless source-channel coding (NTRSCC), a variable-length JSCC framework for broadcast channels based on rateless codes. In particular, we integrate learned source transformations with physical-layer LT codes, develop unequal protection schemes that exploit decoder side information, and devise approximations to enable end-to-end optimization of rateless parameters. Our framework enables heterogeneous receivers to adaptively adjust their received number of rateless symbols and decoding iterations in belief propagation, thereby achieving a controllable tradeoff between distortion, rate, and decoding complexity. Simulation results demonstrate that the proposed method enhances image broadcast quality under stringent communication and processing budgets over heterogeneous edge devices.

cs.IT

IMNet: Interference-Aware Channel Knowledge Map Construction and Localization

This paper presents a novel two-stage method for constructing channel knowledge maps (CKMs) specifically for A2G (Aerial-to-Ground) channels in the presence of non-cooperative interfering nodes (INs). We first estimate the interfering signal strength (ISS) at sampling locations based on total received signal strength measurements and the desired communication signal strength (DSS) map constructed with environmental topology. Next, an ISS map construction network (IMNet) is proposed, where a negative value correction module is included to enable precise reconstruction. Subsequently, we further execute signal-to-interference-plus-noise ratio map construction and IN localization. Simulation results demonstrate lower construction error of the proposed IMNet compared to baselines in the presence of interference.

eess.SP

Joint Offloading and Beamforming Design in Integrating Sensing, Communication, and Computing Systems: A Distributed Approach

When applying integrated sensing and communications (ISAC) in future mobile networks, many sensing tasks have low latency requirements, preferably being implemented at terminals. However, terminals often have limited computing capabilities and energy supply. In this paper, we investigate the effectiveness of leveraging the advanced computing capabilities of mobile edge computing (MEC) servers and the cloud server to address the sensing tasks of ISAC terminals. Specifically, we propose a novel three-tier integrated sensing, communication, and computing (ISCC) framework composed of one cloud server, multiple MEC servers, and multiple terminals, where the terminals can optionally offload sensing data to the MEC server or the cloud server. The offload message is sent via the ISAC waveform, whose echo is used for sensing. We jointly optimize the computation offloading and beamforming strategies to minimize the average execution latency while satisfying sensing requirements. In particular, we propose a low-complexity distributed algorithm to solve the problem. Firstly, we use the alternating direction method of multipliers (ADMM) and derive the closed-form solution for offloading decision variables. Subsequently, we convert the beamforming optimization sub-problem into a weighted minimum mean-square error (WMMSE) problem and propose a fractional programming based algorithm. Numerical results demonstrate that the proposed ISCC framework and distributed algorithm significantly reduce the execution latency and the energy consumption of sensing tasks at a lower computational complexity compared to existing schemes.

eess.SP

Mutual Information Analysis for Factor Graph-based MIMO Iterative Detections through Error Functions

The factor graph (FG) based iterative detection is considered an effective and practical method for multiple-input and multiple-out (MIMO), particularly massive MIMO (m-MIMO) systems. However, the convergence analysis for the FG-based iterative MIMO detection is insufficient, which is of great significance to the performance evaluation and algorithm design of detection methods. This paper investigates the mutual information update flow for the FG-based iterative MIMO detection and proposes a precise mutual information computation mechanism with the aid of Gaussian approximation and error functions, i.e., the error functions-aided analysis (EF-AA) mechanism. Numerical results indicate that the theoretical result calculated by the EF-AA mechanism is completely consistent with the bit error rate performance of the FG-based iterative MIMO detection. Furthermore, the proposed EF-AA mechanism can reveal the exact convergent iteration number and convergent signal-to-ratio value of the FG-based iterative MIMO detection, representing the performance bound of the MIMO detection.

cs.IT

Air-Ground Integrated Sensing and Communications: Opportunities and Challenges

The air-ground integrated sensing and communications (AG-ISAC) network, which consists of unmanned aerial vehicles (UAVs) and ground terrestrial networks, offers unique capabilities and demands special design techniques. In this article, we provide a review on AG-ISAC, by introducing UAVs as ``relay'' nodes for both communications and sensing to resolve the power and computation constraints on UAVs. We first introduce an AG-ISAC framework, including the system architecture and protocol. Four potential use cases are then discussed, with the analysis on the characteristics and merits of AG-ISAC networks. The research on several critical techniques for AG-ISAC is then discussed. Finally, we present our vision of the challenges and future research directions for AG-ISAC, to facilitate the advancement of the technology.

eess.SP

Design and Analysis of Online Fountain Codes for Intermediate Performance

For the benefit of improved intermediate performance, recently online fountain codes attract much research attention. However, there is a trade-off between the intermediate performance and the full recovery overhead for online fountain codes, which prevents them to be improved simultaneously. We analyze this trade-off, and propose to improve both of these two performance. We first propose a method called Online Fountain Codes without Build-up phase (OFCNB) where the degree-1 coded symbols are transmitted at first and the build-up phase is removed to improve the intermediate performance. Then we analyze the performance of OFCNB theoretically. Motivated by the analysis results, we propose Systematic Online Fountain Codes (SOFC) to further reduce the full recovery overhead. Theoretical analysis shows that SOFC has better intermediate performance, and it also requires lower full recovery overhead when the channel erasure rate is lower than a constant. Simulation results verify the analyses and demonstrate the superior performance of OFCNB and SOFC in comparison to other online fountain codes.

cs.IT