SearcharxivSearch

arXiv subjects

Mengfan Zheng

Publications and source records attributed to Mengfan Zheng.

16 recordsLinked to original sources

Lightweight Adaptive Feature Composition for Heterogeneous Downstream Adaptation of Wireless Foundation Models

Mobile systems increasingly rely on heterogeneous learning-enabled wireless functions, for which separate taskspecific models incur redundant training and model-management overhead. Wireless foundation models (WFMs) enable these functions to share a pretrained backbone, but existing adaptation either updates the backbone per task or relies on an inflexible final-layer representation. We observe that intermediate WFM layers exhibit distinct depth-dependent correlation structures. Based on this observation, we propose a Routing Adapter for Feature Composition (RAFC), which summarizes selected hidden states into compact descriptors, generates task- and sampledependent routing weights, and combines the original fullresolution features without updating the pretrained backbone. Its gains arise from giving each task adaptive access to complementary representations across multiple depths rather than restricting it to the final layer. Experiments across four task categories and three WFM backbones show improvements in every evaluated backbone-task pair, with mean relative gains across the four task categories ranging from 2.9% to 35.9%, while RAFC adds only 0.003M-0.049M trainable parameters across the evaluated backbones. Experiments on a portable softwaredefined radio testbed further demonstrate improved end-to-end receiver robustness, particularly under partial-band co-channel interference. These results establish RAFC as a lightweight, model-agnostic, and interpretable adaptation interface for WFMs in mobile systems.

cs.LG

SpikeWFM: Spiking-Aided Wireless Foundation Model for Robust Channel Prediction

This paper proposes SpikeWFM, a novel hybrid architecture that integrates spiking neural networks (SNNs) with conventional artificial neural network (ANN)-based transformers for wireless foundation models (WFMs). Inspired by the noise-robust and energy-efficient information processing in the human brain, SpikeWFM aims to enhance the resilience of WFMs against noise and interference while maintaining strong generalization capabilities across diverse wireless scenarios. Drawing from the success of large language models, WFMs leverage self-supervised pre-training on large-scale datasets spanning various wireless environments to learn a unified embedding that supports a wide range of downstream tasks, including channel prediction, channel estimation, beam predition, positioning and etc. Such models typically outperform task-specific designs and exhibit superior adaptability to unseen conditions. However, existing WFMs remain vulnerable to realistic noise and interference in practical wireless systems. To address this limitation, we incorporate spiking neurons into the transformer-based WFM architecture. We provide a brief theoretical analysis demonstrating how the SNN-ANN hybrid effectively mitigates noise and interference through temporal sparsity and event-driven processing. Experimental results show that SpikeWFM consistently outperforms conventional ANN-based WFMs in both pre-training convergence and channel prediction accuracy. Additional results on communication and sensing tasks will be presented in the full journal version of this work.

eess.SP

WirelessGPT: A Generative Pre-trained Multi-task Learning Framework for Wireless Communication

This paper introduces WirelessGPT, a pioneering foundation model specifically designed for multi-task learning in wireless communication and sensing. Specifically, WirelessGPT leverages large-scale wireless channel datasets for unsupervised pretraining and extracting universal channel representations, which captures complex spatiotemporal dependencies. In fact,this task-agnostic design adapts WirelessGPT seamlessly to a wide range of downstream tasks, using a unified representation with minimal fine-tuning. By unifying communication and sensing functionalities, WirelessGPT addresses the limitations of task-specific models, offering a scalable and efficient solution for integrated sensing and communication (ISAC). With an initial parameter size of around 80 million, WirelessGPT demonstrates significant improvements over conventional methods and smaller AI models, reducing reliance on large-scale labeled data. As the first foundation model capable of supporting diverse tasks across different domains, WirelessGPT establishes a new benchmark, paving the way for future advancements in multi-task wireless systems.

cs.LG

Hybrid Polar Encoding with Applications in Non-Coherent Channels

In coding theory, an error-correcting code can be encoded either systematically or non-systematically. In a systematic encode, the input data is embedded in the encoded output. Conversely, in a non-systematic code, the output does not contain the input symbols. In this paper, we propose a hybrid encoding scheme for polar codes, in which some data bits are systematically encoded while the rest are non-systematically encoded. Based on the proposed scheme, we design a joint channel estimation and data decoding scheme. We use the systematic bits in the hybrid encoding scheme as pilots for channel estimation. To mitigate the code rate loss caused by the pilots and to provide additional error detecting capability, we propose a dynamic pilot design by building connections between the systematic bits and non-systematic bits. Simulation results show that the performance of the proposed scheme approaches that of the traditional non-systematic polar coding scheme with perfect channel state information (CSI) with the increase of SNR.

cs.IT

PAC Codes for Source and Joint Source-Channel Coding

Polarization-adjusted convolutional (PAC) codes, as a concatenated coding scheme based on polar codes, is able to approach the finite-length bound of binary-input AWGN channel at short blocklengths. In this paper, we extend PAC codes to the fields of source coding and joint source-channel coding and show that they can also approach the corresponding finite-length bounds at short blocklengths.

cs.IT

SPARC-LDPC Coding for MIMO Massive Unsourced Random Access

A joint sparse-regression-code (SPARC) and low-density-parity-check (LDPC) coding scheme for multiple-input multiple-output (MIMO) massive unsourced random access (URA) is proposed in this paper. Different from the state-of-the-art covariance-based maximum likelihood (CB-ML) detection scheme, we first split users' messages into two parts. The former part is encoded by SPARCs and tasked to recover part of the messages, the corresponding channel coefficients as well as the interleaving patterns by compressed sensing. The latter part is coded by LDPC codes and then interleaved by the interleave-division multiple access (IDMA) scheme. The decoding of the latter part is based on belief propagation (BP) joint with successive interference cancellation (SIC). Numerical results show our scheme outperforms the CB-ML scheme when the number of antennas at the base station is smaller than that of active users. The complexity of our scheme is with the order $\mathcal{O}\left(2^{B_p}ML+\widehat{K}ML\right)$ and lower than the CB-ML scheme. Moreover, our scheme has higher spectral efficiency (nearly $15$ times larger) than CB-ML as we only split messages into two parts.

cs.IT

Joint Device Detection, Channel Estimation, and Data Decoding with Collision Resolution for MIMO Massive Unsourced Random Access

In this paper, we investigate a joint device activity detection (DAD), channel estimation (CE), and data decoding (DD) algorithm for multiple-input multiple-output (MIMO) massive unsourced random access (URA). Different from the state-of-the-art slotted transmission scheme, the data in the proposed framework is split into only two parts. A portion of the data is coded by compressed sensing (CS) and the rest is low-density-parity-check (LDPC) coded. In addition to being part of the data, information bits in the CS phase also undertake the task of interleaving pattern design and channel estimation (CE). The principle of interleave-division multiple access (IDMA) is exploited to reduce the interference among devices in the LDPC phase. Based on the belief propagation (BP) algorithm, a low-complexity iterative message passing (MP) algorithm is utilized to decode the data embedded in these two phases separately. Moreover, combined with successive interference cancellation (SIC), the proposed joint DAD-CE-DD algorithm is performed to further improve performance by utilizing the belief of each other. Additionally, based on the energy detection (ED) and sliding window protocol (SWP), we develop a collision resolution protocol to handle the codeword collision, a common issue in the URA system. In addition to the complexity reduction, the proposed algorithm exhibits a substantial performance enhancement compared to the state-of-the-art in terms of efficiency and accuracy.

cs.IT

Large Intelligent Surface Aided Physical Layer Security Transmission

In this paper, we investigate a large intelligent surface-enhanced (LIS-enhanced) system, where a LIS is deployed to assist secure transmission. Our design aims to maximize the achievable secrecy rates in different channel models, i.e., Rician fading and (or) independent and identically distributed Gaussian fading for the legitimate and eavesdropper channels. In addition, we take into consideration an artificial noise-aided transmission structure for further improving system performance. The difficulties of tackling the aforementioned problems are the structure of the expected secrecy rate expressions and the non-convex phase shift constraint. To facilitate the design, we propose two frameworks, namely the sample average approximation based (SAA-based) algorithm and the hybrid stochastic projected gradient-convergent policy (hybrid SPG-CP) algorithm, to calculate the expectation terms in the secrecy rate expressions. Meanwhile, majorization minimization (MM) is adopted to address the non-convexity of the phase shift constraint. In addition, we give some analyses on two special scenarios by making full use of the expectation terms. Simulation results show that the proposed algorithms effectively optimize the secrecy communication rate for the considered setup, and the LIS-enhanced system greatly improves secrecy performance compared to conventional architectures without LIS.

cs.IT

Polar Coding and Sparse Spreading for Massive Unsourced Random Access

In this paper, we propose a new polar coding scheme for the unsourced, uncoordinated Gaussian random access channel. Our scheme is based on sparse spreading, treat interference as noise and successive interference cancellation (SIC). On the transmitters side, each user randomly picks a code-length and a transmit power from multiple choices according to some probability distribution to encode its message, and an interleaver to spread its encoded codeword bits across the entire transmission block. The encoding configuration of each user is transmitted by compressive sensing, similar to some previous works. On the receiver side, after recovering the encoding configurations of all users, it applies single-user polar decoding and SIC to recover the message list. Numerical results show that our scheme outperforms all previous schemes for active user number $K_a\geq 250$, and provides competitive performance for $K_a\leq 225$. Moreover, our scheme has much lower complexity compared to other schemes as we only use single-user polar coding.

cs.IT

Secure Transmission Strategy for Intelligent Reflecting Surface Enhanced Wireless System

In this paper, we investigate the design of secure transmission frameworks with an intelligent reflecting surface (IRS). Our design aims to minimize the system energy consumption in cases of rank-one and full-rank access point (AP)-IRS links. To facilitate the design, the problem is divided into two parts: design of beamforming vector at AP and phase shift at IRS. In the rank-one channel model, the beamforming vector design and phase shift design are independent. A closed-form expression of beamforming vector is derived. Meanwhile, some algorithms, including the semidefinite relaxation algorithm and projected gradient algorithm, are taken to solve the phase shift problem in the case of instantaneous channel, and in the statistical channel model, the impact of phase shift on the overall system is analyzed. However, since beamforming and phase shift depend on each other in the full-rank model, we refer to conventional wiretap model and utilize an eigenvalue-based algorithm to obtain beamforming vector, while the aforementioned two phase optimization schemes are also applied. Simulation results show that the IRS-enhanced system is envisioned to improve physical layer security.

cs.IT

On the Polarization of Rényi Entropy

Existing polarization theories have mostly been concerned with Shannon's information measures, such as Shannon entropy and mutual information, and some related measures such as the Bhattacharyya parameter. In this work, we extend polarization theories to a more general information measure, namely, the Rényi entropy. Our study shows that under conditional Rényi entropies of different orders, the same synthetic sub-channel may exhibit opposite extremal states. This result reveals more insights into the polarization phenomenon on the micro scale (probability pairs) rather than on the average scale.

cs.IT

Polar Coding Strategies for the Interference Channel with Partially-Joint Decoding

Existing polar coding schemes for the two-user interference channel follow the original idea of Han and Kobayashi, in which component messages are encoded independently and then mapped by some deterministic functions (i.e., homogeneous superposition coding). In this paper, we propose a new polar coding scheme for the interference channel based on the heterogeneous superposition coding approach of Chong, Motani and Garg. We prove that fully-joint decoding (the receivers simultaneously decode both senders' common messages and the intended sender's private message) in the Han-Kobayashi strategy can be simplified to two types of partially-joint decoding, which are friendly to polar coding with practical decoding algorithms. The proposed coding scheme requires less auxiliary random variables and no deterministic functions, and can be efficiently constructed. Further, we extend this result to interference networks and show that the proposed partially-joint decoding scheme is a general method for designing heterogeneous superposition polar coding schemes in interference networks.

cs.IT

Polar Coding for the Cognitive Interference Channel with Confidential Messages

In this paper, we propose a low-complexity, secrecy capacity achieving polar coding scheme for the cognitive interference channel with confidential messages (CICC) under the strong secrecy criterion. Existing polar coding schemes for interference channels rely on the use of polar codes for the multiple access channel, the code construction problem of which can be complicated. We show that the whole secrecy capacity region of the CICC can be achieved by simple point-to-point polar codes due to the cognitivity, and our proposed scheme requires the minimum rate of randomness at the encoder.

cs.IT

Secure Polar Coding for the Two-Way Wiretap Channel

We consider the problem of polar coding for secure communications over the two-way wiretap channel, where two legitimate users communicate with each other simultaneously while a passive eavesdropper overhears a combination of their exchanged signals. The legitimate users wish to design a cooperative jamming code such that the interference between their codewords can jam the eavesdropper. In this paper, we design a polar coded cooperative jamming scheme that achieves the whole secrecy rate region of the general two-way wiretap channel under the strong secrecy criterion. The chaining method is used to make proper alignment of polar indices. The randomness required to be shared between two legitimate users is treated as a limited resource and we show that its rate can be made negligible by increasing the blocklength and the number of chained blocks. For the special case when the eavesdropper channel is degraded with respect to the legitimate ones, a simplified scheme is proposed which can simultaneously ensure reliability and weak secrecy within a single transmission block. An example of the binary erasure channel case is given to demonstrate the performance of our scheme.

cs.IT

Polar Coding for Block Fading Channels

In this paper, we consider the problem of polar coding for block fading channels, with emphasis on those with instantaneous channel state information (CSI) at neither the transmitter nor the receiver. Our approach is to decompose a block fading channel of $T_c$ symbols per coherent interval into $T_c$ binary-input sub-channels in a capacity-preserving way, and design a polar code for each of them. For the case when instantaneous CSI is available at the receiver, a random interleaver can be used to enable joint encoding and decoding of all sub-channels so as to enhance the finite length performance. It is shown that our proposed schemes achieve the ergodic capacity of binary-input block fading channels under various CSI assumptions.

cs.IT

Polar Coding for Secure Transmission in MISO Fading Wiretap Channels

In this paper, we propose a polar coding scheme for secure communication over the multiple-input, single-output, single-antenna eavesdropper (MISOSE) fading channel. We consider the case of block fading channels with known eavesdropper channel state information (CSI) and the case of fading channels with known eavesdropper channel distribution information (CDI). We use the artificial noise assisted secure precoding method to maximize the secrecy capacity in the first case, and to overcome the unawareness of the eavesdropper CSI in the second case. We show that our proposed scheme can provide both reliable and secure communication over the MISOSE channel with low encoding and decoding complexity.

cs.IT