Search arXiv⌕ Search

arXiv subjects

Li Qiao

Publications and source records attributed to Li Qiao.

At least 37 records · Page 2Linked to original sources

Generative Semantic Communication via Textual Prompts: Latency Performance Tradeoffs

This paper develops an edge-device collaborative Generative Semantic Communications (Gen SemCom) framework leveraging pre-trained Multi-modal/Vision Language Models (M/VLMs) for ultra-low-rate semantic communication via textual prompts. The proposed framework optimizes the use of M/VLMs on the wireless edge/device to generate high-fidelity textual prompts through visual captioning/question answering, which are then transmitted over a wireless channel for SemCom. Specifically, we develop a multi-user Gen SemCom framework using pre-trained M/VLMs, and formulate a joint optimization problem of prompt generation offloading, communication and computation resource allocation to minimize the latency and maximize the resulting semantic quality. Due to the nonconvex nature of the problem with highly coupled discrete and continuous variables, we decompose it as a two-level problem and propose a low-complexity swap/leaving/joining (SLJ)-based matching algorithm. Simulation results demonstrate significant performance improvements over the conventional semanticunaware/non-collaborative offloading benchmarks.

cs.IT↗

Private Collaborative Edge Inference via Over-the-Air Computation

We consider collaborative inference at the wireless edge, where each client's model is trained independently on its local dataset. Clients are queried in parallel to make an accurate decision collaboratively. In addition to maximizing the inference accuracy, we also want to ensure the privacy of local models. To this end, we leverage the superposition property of the multiple access channel to implement bandwidth-efficient multi-user inference methods. We propose different methods for ensemble and multi-view classification that exploit over-the-air computation (OAC). We show that these schemes perform better than their orthogonal counterparts with statistically significant differences while using fewer resources and providing privacy guarantees. We also provide experimental results verifying the benefits of the proposed OAC approach to multi-user inference, and perform an ablation study to demonstrate the effectiveness of our design choices. We share the source code of the framework publicly on Github to facilitate further research and reproducibility.

cs.LG↗

CSI-GPT: Integrating Generative Pre-Trained Transformer with Federated-Tuning to Acquire Downlink Massive MIMO Channels

In massive multiple-input multiple-output (MIMO) systems, how to reliably acquire downlink channel state information (CSI) with low overhead is challenging. In this work, by integrating the generative pre-trained Transformer (GPT) with federated-tuning, we propose a CSI-GPT approach to realize efficient downlink CSI acquisition. Specifically, we first propose a Swin Transformer-based channel acquisition network (SWTCAN) to acquire downlink CSI, where pilot signals, downlink channel estimation, and uplink CSI feedback are jointly designed. Furthermore, to solve the problem of insufficient training data, we propose a variational auto-encoder-based channel sample generator (VAE-CSG), which can generate sufficient CSI samples based on a limited number of high-quality CSI data obtained from the current cell. The CSI dataset generated from VAE-CSG will be used for pre-training SWTCAN. To fine-tune the pre-trained SWTCAN for improved performance, we propose an online federated-tuning method, where only a small amount of SWTCAN parameters are unfrozen and updated using over-the-air computation, avoiding the high communication overhead caused by aggregating the complete CSI samples from user equipment (UEs) to the BS for centralized fine-tuning. Simulation results verify the advantages of the proposed SWTCAN and the communication efficiency of the proposed federated-tuning method. Our code is publicly available at https://github.com/BIT-ZY/CSI-GPT

cs.IT↗

Massive Digital Over-the-Air Computation for Communication-Efficient Federated Edge Learning

Over-the-air computation (AirComp) is a promising technology converging communication and computation over wireless networks, which can be particularly effective in model training, inference, and more emerging edge intelligence applications. AirComp relies on uncoded transmission of individual signals, which are added naturally over the multiple access channel thanks to the superposition property of the wireless medium. Despite significantly improved communication efficiency, how to accommodate AirComp in the existing and future digital communication networks, that are based on discrete modulation schemes, remains a challenge. This paper proposes a massive digital AirComp (MD-AirComp) scheme, that leverages an unsourced massive access protocol, to enhance compatibility with both current and next-generation wireless networks. MD-AirComp utilizes vector quantization to reduce the uplink communication overhead, and employs shared quantization and modulation codebooks. At the receiver, we propose a near-optimal approximate message passing-based algorithm to compute the model aggregation results from the superposed sequences, which relies on estimating the number of devices transmitting each code sequence, rather than trying to decode the messages of individual transmitters. We apply MD-AirComp to the federated edge learning (FEEL), and show that it significantly accelerates FEEL convergence compared to state-of-the-art while using the same amount of communication resources. To support further research and ensure reproducibility, we have made our code available at https://github.com/liqiao19/MD-AirComp.

cs.IT↗

Latency-Aware Generative Semantic Communications with Pre-Trained Diffusion Models

Generative foundation AI models have recently shown great success in synthesizing natural signals with high perceptual quality using only textual prompts and conditioning signals to guide the generation process. This enables semantic communications at extremely low data rates in future wireless networks. In this paper, we develop a latency-aware semantic communications framework with pre-trained generative models. The transmitter performs multi-modal semantic decomposition on the input signal and transmits each semantic stream with the appropriate coding and communication schemes based on the intent. For the prompt, we adopt a re-transmission-based scheme to ensure reliable transmission, and for the other semantic modalities we use an adaptive modulation/coding scheme to achieve robustness to the changing wireless channel. Furthermore, we design a semantic and latency-aware scheme to allocate transmission power to different semantic modalities based on their importance subjected to semantic quality constraints. At the receiver, a pre-trained generative model synthesizes a high fidelity signal using the received multi-stream semantics. Simulation results demonstrate ultra-low-rate, low-latency, and channel-adaptive semantic communications.

cs.IT↗

Near-Space Communications: the Last Piece of 6G Space-Air-Ground-Sea Integrated Network Puzzle

This article presents a comprehensive study on the emerging near-space communications (NS-COM) within the context of space-air-ground-sea integrated network (SAGSIN). Specifically, we firstly explore the recent technical developments of NS-COM, followed by the discussions about motivations behind integrating NS-COM into SAGSIN. To further demonstrate the necessity of NS-COM, a comparative analysis between the NS-COM network and other counterparts in SAGSIN is conducted, covering aspects of deployment, coverage, channel characteristics and unique problems of NS-COM network. Afterwards, the technical aspects of NS-COM, including channel modeling, random access, channel estimation, array-based beam management and joint network optimization, are examined in detail. Furthermore, we explore the potential applications of NS-COM, such as structural expansion in SAGSIN communication, civil aviation communication, remote and urgent communication, weather monitoring and carbon neutrality. Finally, some promising research avenues are identified, including stratospheric satellite (StratoSat) -to-ground direct links for mobile terminals, reconfigurable multiple-input multiple-output (MIMO) and holographic MIMO, federated learning in NS-COM networks, maritime communication, electromagnetic spectrum sensing and adversarial game, integrated sensing and communications, StratoSat-based radar detection and imaging, NS-COM assisted enhanced global navigation system, NS-COM assisted intelligent unmanned system and free space optical (FSO) communication. Overall, this paper highlights that the NS-COM plays an indispensable role in the SAGSIN puzzle, providing substantial performance and coverage enhancement to the traditional SAGSIN architecture.

cs.IT↗

Compressive Sensing-Based Grant-Free Massive Access for 6G Massive Communication

The advent of the sixth-generation (6G) of wireless communications has given rise to the necessity to connect vast quantities of heterogeneous wireless devices, which requires advanced system capabilities far beyond existing network architectures. In particular, such massive communication has been recognized as a prime driver that can empower the 6G vision of future ubiquitous connectivity, supporting Internet of Human-Machine-Things for which massive access is critical. This paper surveys the most recent advances toward massive access in both academic and industry communities, focusing primarily on the promising compressive sensing-based grant-free massive access paradigm. We first specify the limitations of existing random access schemes and reveal that the practical implementation of massive communication relies on a dramatically different random access paradigm from the current ones mainly designed for human-centric communications. Then, a compressive sensing-based grant-free massive access roadmap is presented, where the evolutions from single-antenna to large-scale antenna array-based base stations, from single-station to cooperative massive multiple-input multiple-output systems, and from unsourced to sourced random access scenarios are detailed. Finally, we discuss the key challenges and open issues to shed light on the potential future research directions of grant-free massive access.

cs.IT↗

Sensing User's Activity, Channel, and Location with Near-Field Extra-Large-Scale MIMO

This paper proposes a grant-free massive access scheme based on the millimeter wave (mmWave) extra-large-scale multiple-input multiple-output (XL-MIMO) to support massive Internet-of-Things (IoT) devices with low latency, high data rate, and high localization accuracy in the upcoming sixth-generation (6G) networks. The XL-MIMO consists of multiple antenna subarrays that are widely spaced over the service area to ensure line-of-sight (LoS) transmissions. First, we establish the XL-MIMO-based massive access model considering the near-field spatial non-stationary (SNS) property. Then, by exploiting the block sparsity of subarrays and the SNS property, we propose a structured block orthogonal matching pursuit algorithm for efficient active user detection (AUD) and channel estimation (CE). Furthermore, different sensing matrices are applied in different pilot subcarriers for exploiting the diversity gains. Additionally, a multi-subarray collaborative localization algorithm is designed for localization. In particular, the angle of arrival (AoA) and time difference of arrival (TDoA) of the LoS links between active users and related subarrays are extracted from the estimated XL-MIMO channels, and then the coordinates of active users are acquired by jointly utilizing the AoAs and TDoAs. Simulation results show that the proposed algorithms outperform existing algorithms in terms of AUD and CE performance and can achieve centimeter-level localization accuracy.

cs.IT↗

Assessing the drag implications of hydrogen fuel utilization in small aircraft: a preliminary numerical analysis

The urgent need for cleaner, sustainable aviation fuels has driven interest in the use of hydrogen as a potential replacement for traditional hydrocarbon fuels in aviation. However, transitioning to hydrogen presents significant challenges due to its lower volumetric energy density which requires a larger fuel volume for equivalent energy. This study uses Computational Fluid Dynamics (CFD) simulations, utilizing the ANSYS Fluent 2022 R1 solver, to conduct a preliminary investigation on the aerodynamic implications of adopting hydrogen fuel in small aircraft, specifically the Bonanza G36. Three different types of hydrogen fuel - gaseous hydrogen at 350 bar, gaseous hydrogen at 700 bar, and liquid hydrogen - were considered. Despite a promising 64% reduction in fuel weight in comparison to gasoline, the volume required for hydrogen fuel was found to increase significantly, with values ranging from 263% to 896% compared to the base case. The aerodynamic impact was quantified in terms of drag, with the study revealing increases of 67.32%, 48.42%, and 27.05% for gaseous hydrogen at 350 bar, gaseous hydrogen at 700 bar, and liquid hydrogen respectively. While the findings present a challenge, they also set a platform for exploring innovative fuel tank designs and drag reduction technologies to mitigate these effects. This study underscores the complexities involved in transitioning to hydrogen fuel in aviation, contributing valuable insights to guide further research towards sustainable aviation.

physics.flu-dyn↗

Unsourced Massive Access-Based Digital Over-the-Air Computation for Efficient Federated Edge Learning

Over-the-air computation (OAC) is a promising technique to achieve fast model aggregation across multiple devices in federated edge learning (FEEL). In addition to the analog schemes, one-bit digital aggregation (OBDA) scheme was proposed to adapt OAC to modern digital wireless systems. However, one-bit quantization in OBDA can result in a serious information loss and slower convergence of FEEL. To overcome this limitation, this paper proposes an unsourced massive access (UMA)-based generalized digital OAC (GD-OAC) scheme. Specifically, at the transmitter, all the devices share the same non-orthogonal UMA codebook for uplink transmission. The local model update of each device is quantized based on the same quantization codebook. Then, each device transmits a sequence selected from the UMA codebook based on the quantized elements of its model update. At the receiver, we propose an approximate message passing-based algorithm for efficient UMA detection and model aggregation. Simulation results show that the proposed GD-OAC scheme significantly accelerates the FEEL convergences compared with the state-of-the-art OBDA scheme while using the same uplink communication resources.

cs.IT↗

Joint Activity and Blind Information Detection for UAV-Assisted Massive IoT Access

Grant-free non-coherent index-modulation (NC-IM) has been recently considered as an efficient massive access scheme for enabling cost- and energy-limited Internet-of-Things (IoT) devices that transmit small data packets. This paper investigates the grant-free NC-IM scheme combined with orthogonal frequency division multiplexing for applicant to unmanned aerial vehicle (UAV)-based massive IoT access. Specifically, each device is assigned a unique non-orthogonal signature sequence codebook. Each active device transmits one of its signature sequences in the given time-frequency resources, by modulating the information in the index of the transmitted signature sequence. For small-scale multiple-input multiple-output (MIMO) deployed at the UAV-based aerial base station (BS), by jointly exploiting the space-time-frequency domain device activity, we propose a computationally efficient space-time-frequency joint activity and blind information detection (JABID) algorithm with significantly improved detection performance. Furthermore, for large-scale MIMO deployed at the aerial BS, by leveraging the sparsity of the virtual angular-domain channels, we propose an angular-domain based JABID algorithm for improving the system performance with reduced access latency. In addition, for the case of high mobility IoT devices and/or UAVs, we introduce a time-frequency spread transmission (TFST) strategy for the proposed JABID algorithms to combat doubly-selective fading channels. Finally, extensive simulation results are illustrated to verify the superiority of the proposed algorithms and the TFST strategy over known state-of-the-art algorithms.

cs.IT↗

Massive Access in Media Modulation Based Massive Machine-Type Communications

The massive machine-type communications (mMTC) paradigm based on media modulation in conjunction with massive MIMO base stations (BSs) is emerging as a viable solution to support the massive connectivity for the future Internet-of-Things, in which the inherent massive access at the BSs poses significant challenges for device activity and data detection (DADD). This paper considers the DADD problem for both uncoded and coded media modulation based mMTC with a slotted access frame structure, where the device activity remains unchanged within one frame. Specifically, due to the slotted access frame structure and the adopted media modulated symbols, the access signals exhibit a doubly structured sparsity in both the time domain and the modulation domain. Inspired by this, a doubly structured approximate message passing (DS-AMP) algorithm is proposed for reliable DADD in the uncoded case. Also, we derive the state evolution of the DS-AMP algorithm to theoretically characterize its performance. As for the coded case, we develop a bit-interleaved coded media modulation scheme and propose an iterative DS-AMP (IDS-AMP) algorithm based on successive inference cancellation (SIC), where the signal components associated with the detected active devices are successively subtracted to improve the data decoding performance. In addition, the channel estimation problem for media modulation based mMTC is discussed and an efficient data-aided channel state information (CSI) update strategy is developed to reduce the training overhead in block fading channels. Finally, simulation results and computational complexity analysis verify the superiority of the proposed algorithms in both uncoded and coded cases. Also, our results verify the validity of the proposed data-aided CSI update strategy.

cs.IT↗

Vapor-liquid equilibrium predictions of n-alkane/nitrogen mixtures using neural networks

Understanding fluid phase behavior in high pressure and high temperature conditions is crucial for developing high-fidelity simulations of chemically reacting flows in liquid-fueled combustion systems. The study of vapor-liquid equilibrium (VLE) curves also forms an integral part of the design and modeling of the control processes in chemical and oil-gas industries. The main objective of this study was to develop data-driven models to predict VLE of Type III binary mixtures involving long-chained n-alkanes and nitrogen. Two data-driven models have been proposed in this study, each of which was competent in estimating VLE for the binary systems of C10/N2 and C12/N2, at pressures ranging up to 50-60 MPa. Both the models showed better performance (less average absolute percentage error) in predicting equilibrium pressure of the binary mixtures as compared to the VLE modeled using Peng-Robinson equation of state (PR-EOS). The data-driven models were also able to correctly trace the change in curvature of the vapor phase composition, close to the mixture critical point, at high pressures and temperatures-a feature of the n-alkane/nitrogen system VLE which the PR-EOS model fails to capture.

physics.flu-dyn↗

Compressive Sensing Based Massive Access for IoT Relying on Media Modulation Aided Machine Type Communications

A fundamental challenge of the large-scale Internet-of-Things lies in how to support massive machine-type communications (mMTC). This letter proposes a media modulation based mMTC solution for increasing the throughput, where a massive multi-input multi-output based base station (BS) is used for enhancing the detection performance. For such a mMTC scenario, the reliable active device detection and data decoding pose a serious challenge. By leveraging the sparsity of the uplink access signals of mMTC received at the BS, a compressive sensing based massive access solution is proposed for tackling this challenge. Specifically, we propose a block sparsity adaptive matching pursuit algorithm for detecting the active devices, whereby the block-sparsity of the uplink access signals exhibited across the successive time slots and the structured sparsity of media modulated symbols are exploited for enhancing the detection performance. Moreover, a successive interference cancellation based structured subspace pursuit algorithm is conceived for data demodulation of the active devices, whereby the structured sparsity of media modulation based symbols found in each time slot is exploited for improving the detection performance. Finally, our simulation results verify the superiority of the proposed scheme over state-of-the-art solutions.

cs.IT↗

Rota-Baxter modules toward derived functors

In this paper we study Rota-Baxter modules with emphasis on the role played by the Rota-Baxter operators and resulting difference between Rota-Baxter modules and the usual modules over an algebra. We introduce the concepts of free, projective, injective and flat Rota-Baxter modules. We give the construction of free modules and show that there are enough projective, injective and flat Rota-Baxter modules to provide the corresponding resolutions for derived functor.

math.RA↗

Representations of Polynomial Rota-Baxter Algebras

A Rota--Baxter operator is an algebraic abstraction of integration, which is the typical example of a weight zero Rota-Baxter operator. We show that studying the modules over the polynomial Rota--Baxter algebra $(k[x],P)$ is equivalent to studying the modules over the Jordan plane, and we generalize the direct decomposability results for the $(k[x],P)$-modules in [Iy] from algebraically closed fields of characteristic zero to fields of characteristic zero. Furthermore, we provide a classification of Rota--Baxter modules up to isomorphism based on indecomposable $k[x]$-modules.

math.RT↗

Three-term recurrence relations of minimal affinizations of type $G_2$

Minimal affinizations form a class of modules of quantum affine algebras introduced by Chari. We introduce a system of equations satisfied by the $q$-characters of minimal affinizations of type $G_2$ which we call the M-system of type $G_2$. The M-system of type $G_2$ contains all minimal affinizations of type $G_2$ and only contains minimal affinizations. The equations in the M-system of type $G_2$ are three-term recurrence relations. The M-system of type $G_2$ is much simpler than the extended T-system of type $G_2$ obtained by Mukhin and the second author. We also interpret the three-term recurrence relations in the M-system of type $G_2$ as exchange relations in a cluster algebra constructed by Hernandez and Leclerc.

math.QA↗

Computationally Efficient Unscented Kalman Filtering Techniques for Launch Vehicle Navigation using a Space-borne GPS Receiver

The Extended Kalman Filter (EKF) is a well established technique for position and velocity estimation. However, the performance of the EKF degrades considerably in highly non-linear system applications as it requires local linearisation in its prediction stage. The Unscented Kalman Filter (UKF) was developed to address the non-linearity in the system by deterministic sampling. The UKF provides better estimation accuracy than the EKF for highly non-linear systems. However, the UKF requires multiple propagations of sampled state vectors in the measurement interval, which results in higher processing time than for the EKF. This paper proposes an application of two newly developed UKF variants in launch vehicle navigation. These two algorithms called the Single Propagation Unscented Kalman Filter (SPUKF) and the Extrapolated Single Propagation Unscented Kalman Filter (ESPUKF), reduce the processing time of the original UKF significantly and provide estimation accuracies comparable to the UKF. The estimation performance of the SPUKF and the ESPUKF is demonstrated using Falcon 9 V1.1 launch vehicle in CRS-5 mission scenario. The launch vehicle trajectory for the mission is generated using publicly available mission parameters. A SPIRENT GNSS simulator is used to generate the received GPS signal on the trajectory. Pseudo-range observations are used in the EKF, UKF, SPUKF and the ESPUKF separately and the estimation accuracies are compared. The results show that the estimation errors of the SPUKF and the ESPUKF are 15.44% and 10.52% higher than the UKF respectively. The processing time reduces by 83% for the SPUKF and 69.14% for the ESPUKF compared to the UKF.

eess.SY↗