Searcharxiv⌕ Search

arXiv subjects

Xiaoqi Qin

Publications and source records attributed to Xiaoqi Qin.

At least 37 records · Page 2Linked to original sources

Tuning Quantum Computing Privacy through Quantum Error Correction

Quantum computing is a promising paradigm for efficiently solving large and high-complexity problems. To protect quantum computing privacy, pioneering research efforts proposed to redefine differential privacy (DP) in quantum computing, i.e., quantum differential privacy (QDP), and harvest inherent noises generated by quantum computing to implement QDP. However, such an implementation approach is limited by the amount of inherent noises, which makes the privacy budget of the QDP mechanism fixed and uncontrollable. To address this issue, in this paper, we propose to leverage quantum error correction (QEC) techniques to reduce quantum computing errors, while tuning the privacy protection levels in QDP. In short, we gradually decrease the quantum noise error rate by deciding whether to apply QEC operations on the gate in a multiple single qubit gates circuit. We have derived a new calculation formula for the general error rate and corresponding privacy budgets after QEC operation. Then, we expand to achieve further noise reduction using multi-level concatenated QEC operation. Through extensive numerical simulations, we demonstrate that QEC is a feasible way to regulate the degree of privacy protection in quantum computing.

quant-ph↗

Performance Analysis of MDMA-Based Cooperative MRC Networks with Relays in Dissimilar Rayleigh Fading Channels

Multiple access technology is a key technology in various generations of wireless communication systems. As a potential multiple access technology for the next generation wireless communication systems, model division multiple access (MDMA) technology improves spectrum efficiency and feasibility regions. This implies that the MDMA scheme can achieve greater performance gains compared to traditional schemes. Relayassisted cooperative networks, as a infrastructure of wireless communication, can effectively utilize resources and improve performance when MDMA is applied. In this paper, a communication relay cooperative network based on MDMA in dissimilar rayleigh fading channels is proposed, which consists of two source nodes, any number of decode-and-forward (DF) relay nodes, and one destination node, as well as using the maximal ratio combining (MRC) at the destination to combine the signals received from the source and relays. By applying the state transition matrix (STM) and moment generating function (MGF), closed-form analytical solutions for outage probability and resource utilization efficiency are derived. Theoretical and simulation results are conducted to verify the validity of the theoretical analysis.

cs.IT↗

The Communication GSC System with Energy Harvesting Nodes aided by Opportunistic Routing

In this paper, a cooperative communication network based on energy-harvesting (EH) decode-and-forward (DF) relays is proposed. For relay nodes, there is harvest-storage-use (HSU) structure in this system. And energy can be obtained from the surrounding environment through energy buffering. In order to improve the performance of the communication system, the opportunistic routing algorithm and the generalized selection combining (GSC) algorithm are adopted in this communication system. In addition, from discrete-time continuous-state space Markov chain model (DCSMC), a theoretical expression of the energy limiting distribution stored in infinite buffers is derived. Through using the probability distribution and state transition matrix, the theoretical expressions of system outage probability, throughput and time cost of per packet are obtained. Through the simulation verification, the theoretical results are in good agreement with the simulation results.

cs.CY↗

Fully-Passive versus Semi-Passive IRS-Enabled Sensing: SNR and CRB Comparison

This paper investigates the sensing performance of two intelligent reflecting surface (IRS)-enabled non-line-of-sight (NLoS) sensing systems with fully-passive and semi-passive IRSs, respectively. In particular, we consider a fundamental setup with one base station (BS), one uniform linear array (ULA) IRS, and one point target in the NLoS region of the BS. Accordingly, we analyze the sensing signal-to-noise ratio (SNR) performance for a target detection scenario and the estimation Cramér-Rao bound (CRB) performance for a target's direction-of-arrival (DoA) estimation scenario, in cases where the transmit beamforming at the BS and the reflective beamforming at the IRS are jointly optimized. First, for the target detection scenario, we characterize the maximum sensing SNR when the BS-IRS channels are line-of-sight (LoS) and Rayleigh fading, respectively. It is revealed that when the number of reflecting elements $N$ equipped at the IRS becomes sufficiently large, the maximum sensing SNR increases proportionally to $N^2$ for the semi-passive-IRS sensing system, but proportionally to $N^4$ for the fully-passive-IRS counterpart. Then, for the target's DoA estimation scenario, we analyze the minimum CRB performance when the BS-IRS channel follows Rayleigh fading. Specifically, when $N$ grows, the minimum CRB decreases inversely proportionally to $N^4$ and $N^6$ for the semi-passive and fully-passive-IRS sensing systems, respectively. Finally, numerical results are presented to corroborate our analysis across various transmit and reflective beamforming design schemes under general channel setups. It is shown that the fully-passive-IRS sensing system outperforms the semi-passive counterpart when $N$ exceeds a certain threshold. This advantage is attributed to the additional reflective beamforming gain in the IRS-BS path, which efficiently compensates for the path loss for a large $N$.

eess.SP↗

Multicast Scheduling over Multiple Channels: A Distribution-Embedding Deep Reinforcement Learning Method

Multicasting is an efficient technique for simultaneously transmitting common messages from the base station (BS) to multiple mobile users (MUs). Multicast scheduling over multiple channels, which aims to jointly minimize the energy consumption of the BS and the latency of serving asynchronized requests from the MUs, is formulated as an infinite-horizon Markov decision process (MDP) problem with a large discrete action space, multiple time-varying constraints, and multiple time-invariant constraints. To address these challenges, this paper proposes a novel distribution-embedding multi-agent proximal policy optimization (DE-MAPPO) algorithm, which consists of one modified MAPPO and one distribution-embedding module: The former one handles the large discrete action space and time-varying constraints by modifying the structure of the actor networks and the training kernel of the conventional MAPPO; and the latter one iteratively adjusts the action distribution to satisfy the time-invariant constraints. Moreover, a performance upper bound of the considered MDP is derived by solving a two-step optimization problem. Finally, numerical results demonstrate that our proposed algorithm outperforms the existing ones and achieves comparable performance to the derived benchmark.

cs.IT↗

AoI-Delay Tradeoff in Mobile Edge Caching: A Mixed-Order Drift-Plus-Penalty Algorithm

Mobile edge caching (MEC) is a promising technique to improve the quality of service (QoS) for mobile users (MU) by bringing data to the network edge. However, optimizing the crucial QoS aspects of message freshness and service promptness, measured by age of information (AoI) and service delay, respectively, entails a tradeoff due to their competition for shared edge resources. This paper investigates this tradeoff by formulating their weighted sum minimization as a sequential decision-making problem, incorporating high-dimensional, discrete-valued, and linearly constrained design variables. First, to assess the feasibility of the considered problem, we characterize the corresponding achievable region by deriving its superset with the rate stability theorem and its subset with a novel stochastic policy, and develop a sufficient condition for the existence of solutions. Next, to efficiently solve this problem, we propose a mixed-order drift-plus-penalty algorithm by jointly considering the linear and quadratic Lyapunov drifts and then optimizing them with dynamic programming (DP). Finally, by leveraging the Lyapunov optimization technique, we demonstrate that the proposed algorithm achieves an $O(1/V)$ versus $O(V)$ tradeoff for the average AoI and average service delay.

eess.SY↗

Improved Nonlinear Transform Source-Channel Coding to Catalyze Semantic Communications

Recent deep learning methods have led to increased interest in solving high-efficiency end-to-end transmission problems. These methods, we call nonlinear transform source-channel coding (NTSCC), extract the semantic latent features of source signal, and learn entropy model to guide the joint source-channel coding with variable rate to transmit latent features over wireless channels. In this paper, we propose a comprehensive framework for improving NTSCC, thereby higher system coding gain, better model versatility, and more flexible adaptation strategy aligned with semantic guidance are all achieved. This new sophisticated NTSCC model is now ready to support large-size data interaction in emerging XR, which catalyzes the application of semantic communications. Specifically, we propose three useful improvement approaches. First, we introduce a contextual entropy model to better capture the spatial correlations among the semantic latent features, thereby more accurate rate allocation and contextual joint source-channel coding are developed accordingly to enable higher coding gain. On that basis, we further propose response network architectures to formulate versatile NTSCC, i.e., once-trained model supports various rates and channel states that benefits the practical deployment. Following this, we propose an online latent feature editing method to enable more flexible coding rate control aligned with some specific semantic guidance. By comprehensively applying the above three improvement methods for NTSCC, a deployment-friendly semantic coded transmission system stands out finally. Our improved NTSCC system has been experimentally verified to achieve considerable bandwidth saving versus the state-of-the-art engineered VTM + 5G LDPC coded transmission system with lower processing latency.

eess.SP↗

Joint Task and Data Oriented Semantic Communications: A Deep Separate Source-channel Coding Scheme

Semantic communications are expected to accomplish various semantic tasks with relatively less spectrum resource by exploiting the semantic feature of source data. To simultaneously serve both the data transmission and semantic tasks, joint data compression and semantic analysis has become pivotal issue in semantic communications. This paper proposes a deep separate source-channel coding (DSSCC) framework for the joint task and data oriented semantic communications (JTD-SC) and utilizes the variational autoencoder approach to solve the rate-distortion problem with semantic distortion. First, by analyzing the Bayesian model of the DSSCC framework, we derive a novel rate-distortion optimization problem via the Bayesian inference approach for general data distributions and semantic tasks. Next, for a typical application of joint image transmission and classification, we combine the variational autoencoder approach with a forward adaption scheme to effectively extract image features and adaptively learn the density information of the obtained features. Finally, an iterative training algorithm is proposed to tackle the overfitting issue of deep learning models. Simulation results reveal that the proposed scheme achieves better coding gain as well as data recovery and classification performance in most scenarios, compared to the classical compression schemes and the emerging deep joint source-channel schemes.

cs.IT↗

Fully-Passive versus Semi-Passive IRS-Enabled Sensing: SNR Analysis

This paper compares the signal-to-noise ratio (SNR) performance between the fully-passive intelligent reflecting surface (IRS)-enabled non-line-of-sight (NLoS) sensing versus its semi-passive counterpart. In particular, we consider a basic setup with one base station (BS), one uniform linear array (ULA) IRS, and one point target at the BS's NLoS region, in which the BS and the IRS jointly design the transmit and reflective beamforming for performance optimization. By considering two special cases with the BS-IRS channels being line-of-sight (LoS) and Rayleigh fading, respectively, we derive the corresponding asymptotic sensing SNR when the number of reflecting elements $N$ at the IRS becomes sufficiently large. It is revealed that in the two special cases, the sensing SNR increases proportional to $N^2$ for the semi-passive IRS sensing system, but proportional to $N^4$ for the fully-passive IRS sensing system. As such, the fully-passive IRS sensing system is shown to outperform the semi-passive counterpart when $N$ becomes large, which is due to the fact that the fully-passive IRS sensing enjoys additional reflective beamforming gain from the IRS to the BS that outweighs the resultant path loss in this case. Finally, numerical results are presented to validate our analysis under different transmit and reflective beamforming design schemes.

eess.SP↗

Cramér-Rao Bound Minimization for IRS-Enabled Multiuser Integrated Sensing and Communications

This paper investigates an intelligent reflecting surface (IRS) enabled multiuser integrated sensing and communications (ISAC) system, which consists of one multi-antenna base station (BS), one IRS, multiple single-antenna communication users (CUs), and one target at the non-line-of-sight (NLoS) region of the BS. The IRS is deployed to not only assist the communication from the BS to the CUs, but also enable the BS's NLoS target sensing based on the echo signals from the BS-IRS-target-IRS-BS link. We consider two types of targets, namely the extended and point targets, for which the BS aims to estimate the complete target response matrix and the target direction-of-arrival (DoA) with respect to the IRS, respectively. To provide full degrees of freedom for sensing, we consider that the BS sends dedicated sensing signals in addition to the communication signals. Accordingly, we model two types of CU receivers, namely Type-I and Type-II CU receivers, which do not have and have the capability of canceling the interference from the sensing signals, respectively. Under each setup, we jointly optimize the transmit beamforming at the BS and the reflective beamforming at the IRS to minimize the Cramér-Rao bound (CRB) for target estimation, subject to the minimum signal-to-interference-plus-noise ratio (SINR) constraints at the CUs and the maximum transmit power constraint at the BS. We present efficient algorithms to solve the highly non-convex SINR-constrained CRB minimization problems, by using the techniques of alternating optimization, semi-definite relaxation, and successive convex approximation. Numerical results show that the proposed design achieves lower estimation CRB than other benchmark schemes, and the sensing signal interference cancellation at Type-II CU receivers is beneficial when the number of CUs is greater than one.

eess.SP↗

Toward Intelligent and Efficient 6G Networks: JCSC Enabled On-Purpose Machine Communications

Driven by the vision of "intelligent connection of everything" toward 6G, the collective intelligence of networked machines can be fully exploited to improve system efficiency by shifting the paradigm of wireless communication design from naive maximalist approaches to intelligent value-based approaches. In this article, we propose an on-purpose machine communication framework enabled by joint communication, sensing, and computation (JCSC) technology, which employs machine semantics as the interactive information flow. Naturally, there are potential technical barriers to be solved before the widespread adoption of on-purpose communications, including the conception of machine purpose, fast and concise networking strategy, and semantics-aware information exchange mechanism during the process of task-oriented cooperation. Hence, we discuss enabling technologies complemented by a range of open challenges. The simulation result shows that the proposed framework can significantly reduce networking overhead and improve communication efficiency.

eess.SP↗

NeurJSCC Enabled Semantic Communications: Paradigms, Applications, and Potentials

Recent advances in deep learning have led to increased interest in solving high-efficiency end-to-end transmission problems using methods that employ the nonlinear property of neural networks. These techniques, we call neural joint source-channel coding (NeurJSCC), extract latent semantic features of the source signal across space and time, and design corresponding variable-length NeurJSCC approaches to transmit latent features over wireless communication channels. Rapid progress has led to numerous research papers, but a consolidation of the discovered knowledge has not yet emerged. In this article, we gather diverse ideas to categorize the expansive aspects on NeurJSCC as two paradigms, i.e., explicit and implicit NeurJSCC. We first focus on those two paradigms of NeurJSCC by identifying their common and different components in building end-to-end communication systems. We then focus on typical applications of NeurJSCC to various communication tasks. Our article highlights the improved quality, flexibility, and capability brought by NeurJSCC, and we also point out future directions.

eess.SP↗

Toward Adaptive Semantic Communications: Efficient Data Transmission via Online Learned Nonlinear Transform Source-Channel Coding

The emerging field semantic communication is driving the research of end-to-end data transmission. By utilizing the powerful representation ability of deep learning models, learned data transmission schemes have exhibited superior performance than the established source and channel coding methods. While, so far, research efforts mainly concentrated on architecture and model improvements toward a static target domain. Despite their successes, such learned models are still suboptimal due to the limitations in model capacity and imperfect optimization and generalization, particularly when the testing data distribution or channel response is different from that adopted for model training, as is likely to be the case in real-world. To tackle this, we propose a novel online learned joint source and channel coding approach that leverages the deep learning model's overfitting property. Specifically, we update the off-the-shelf pre-trained models after deployment in a lightweight online fashion to adapt to the distribution shifts in source data and environment domain. We take the overfitting concept to the extreme, proposing a series of implementation-friendly methods to adapt the codec model or representations to an individual data or channel state instance, which can further lead to substantial gains in terms of the bandwidth ratio-distortion performance. The proposed methods enable the communication-efficient adaptation for all parameters in the network without sacrificing decoding speed. Our experiments, including user study, on continually changing target source data and wireless channel environments, demonstrate the effectiveness and efficiency of our approach, on which we outperform existing state-of-the-art engineered transmission scheme (VVC combined with 5G LDPC coded transmission).

cs.IT↗

Efficient Sensor Scheduling Strategy Based on Spatio-temporal Scope Information Model

In this paper, based on the spatio-temporal correlation of sensor nodes in the Internet of Things (IoT), a Spatio-temporal Scope information model (SSIM) is proposed to quantify the scope valuable information of sensor data, which decays with space and time, to guide the system for efficient decision making in the sensed region. A simple sensor monitoring system containing three sensor nodes is considered, and two optimal scheduling decision mechanisms, single-step optimal and long-term optimal decision mechanisms, are proposed for the optimization problem. For the single-step mechanism, the scheduling results are analyzed theoretically, and approximate numerical bounds on the node layout between some of the scheduling results are obtained, consistent with the simulation results. For the long-term mechanism, the scheduling results with different node layouts are obtained using the Q-learning algorithm. The performance of the two mechanisms is verified by conducting experiments using the relative humidity dataset, and the differences in performance of the two mechanisms are discussed; in addition, the limitations of the model are summarized.

cs.IT↗

Nonlinear Transform Source-Channel Coding for Semantic Communications

In this paper, we propose a class of high-efficiency deep joint source-channel coding methods that can closely adapt to the source distribution under the nonlinear transform, it can be collected under the name nonlinear transform source-channel coding (NTSCC). In the considered model, the transmitter first learns a nonlinear analysis transform to map the source data into latent space, then transmits the latent representation to the receiver via deep joint source-channel coding. Our model incorporates the nonlinear transform as a strong prior to effectively extract the source semantic features and provide side information for source-channel coding. Unlike existing conventional deep joint source-channel coding methods, the proposed NTSCC essentially learns both the source latent representation and an entropy model as the prior on the latent representation. Accordingly, novel adaptive rate transmission and hyperprior-aided codec refinement mechanisms are developed to upgrade deep joint source-channel coding. The whole system design is formulated as an optimization problem whose goal is to minimize the end-to-end transmission rate-distortion performance under established perceptual quality metrics. Across test image sources with various resolutions, we find that the proposed NTSCC transmission method generally outperforms both the analog transmission using the standard deep joint source-channel coding and the classical separation-based digital transmission. Notably, the proposed NTSCC method can potentially support future semantic communications due to its content-aware ability and perceptual optimization goal.

cs.IT↗

Wireless Deep Video Semantic Transmission

In this paper, we design a new class of high-efficiency deep joint source-channel coding methods to achieve end-to-end video transmission over wireless channels. The proposed methods exploit nonlinear transform and conditional coding architecture to adaptively extract semantic features across video frames, and transmit semantic feature domain representations over wireless channels via deep joint source-channel coding. Our framework is collected under the name deep video semantic transmission (DVST). In particular, benefiting from the strong temporal prior provided by the feature domain context, the learned nonlinear transform function becomes temporally adaptive, resulting in a richer and more accurate entropy model guiding the transmission of current frame. Accordingly, a novel rate adaptive transmission mechanism is developed to customize deep joint source-channel coding for video sources. It learns to allocate the limited channel bandwidth within and among video frames to maximize the overall transmission performance. The whole DVST design is formulated as an optimization problem whose goal is to minimize the end-to-end transmission rate-distortion performance under perceptual quality metrics or machine vision task performance metrics. Across standard video source test sequences and various communication scenarios, experiments show that our DVST can generally surpass traditional wireless video coded transmission schemes. The proposed DVST framework can well support future semantic communications due to its video content-aware and machine vision task integration abilities.

cs.CV↗

Timeliness of Information for Computation-intensive Status Updates in Task-oriented Communications

Moving beyond just interconnected devices, the increasing interplay between communication and computation has fed the vision of real-time networked control systems. To obtain timely situational awareness, IoT devices continuously sample computation-intensive status updates, generate perception tasks and offload them to edge servers for processing. In this sense, the timeliness of information is considered as one major contextual attribute of status updates. In this paper, we derive the closed-form expressions of timeliness of information for computation offloading at both edge tier and fog tier, where two stage tandem queues are exploited to abstract the transmission and computation process. Moreover, we exploit the statistical structure of Gauss-Markov process, which is widely adopted to model temporal dynamics of system states, and derive the closed-form expression for process-related timeliness of information. The obtained analytical formulas explicitly characterize the dependency among task generation, transmission and execution, which can serve as objective functions for system optimization. Based on the theoretical results, we formulate a computation offloading optimization problem at edge tier, where the timeliness of status updates is minimized among multiple devices by joint optimization of task generation, bandwidth allocation, and computation resource allocation. An iterative solution procedure is proposed to solve the formulated problem. Numerical results reveal the intertwined relationship among transmission and computation stages, and verify the necessity of factoring in the task generation process for computation offloading strategy design.

cs.DC↗

Communication Beyond Transmitting Bits: Semantics-Guided Source and Channel Coding

Classical communication paradigms focus on accurately transmitting bits over a noisy channel, and Shannon theory provides a fundamental theoretical limit on the rate of reliable communications. In this approach, bits are treated equally, and the communication system is oblivious to what meaning these bits convey or how they would be used. Future communications towards intelligence and conciseness will predictably play a dominant role, and the proliferation of connected intelligent agents requires a radical rethinking of coded transmission paradigm to support the new communication morphology on the horizon. The recent concept of "semantic communications" offers a promising research direction. Injecting semantic guidance into the coded transmission design to achieve semantics-aware communications shows great potential for further breakthrough in effectiveness and reliability. This article sheds light on semantics-guided source and channel coding as a transmission paradigm of semantic communications, which exploits both data semantics diversity and wireless channel diversity together to boost the whole system performance. We present the general system architecture and key techniques, and indicate some open issues on this topic.

cs.IT↗