arXiv subjects

Shiwen He

Publications and source records attributed to Shiwen He.

At least 19 recordsLinked to original sources

arXiv2025

Generation of Four-Component Schr\"odinger Cat States via Floquet Engineering in a Hybrid Ferromagnet-Superconductor System

Four-component Schr\"odinger cat (4C) states are important physical resources for fault-tolerant quantum computing. However, the generation of 4C states in solid-state platforms remains challenging due to stringent nonlinearity requirements. In this paper, a Floquet-engineering scheme is proposed for generating 4C states in a hybrid ferromagnet-superconductor system. Numerical simulations show that the high-fidelity 4C states can be generated even if the decoherence of the system is considered. These results provide a scalable route to multi-component cat-state engineering in solid-state platforms and open new avenues for quantum computation.

quant-ph↗

arXiv2024

Learning for Cross-Layer Resource Allocation in MEC-Aided Cell-Free Networks

Cross-layer resource allocation over mobile edge computing (MEC)-aided cell-free networks can sufficiently exploit the transmitting and computing resources to promote the data rate. However, the technical bottlenecks of traditional methods pose significant challenges to cross-layer optimization. In this paper, joint subcarrier allocation and beamforming optimization are investigated for the MEC-aided cell-free network from the perspective of deep learning to maximize the weighted sum rate. Specifically, we convert the underlying problem into a joint multi-task optimization problem and then propose a centralized multi-task self-supervised learning algorithm to solve the problem so as to avoid costly manual labeling. Therein, two novel and general loss functions, i.e., negative fraction linear loss and exponential linear loss whose advantages in robustness and target domain have been proved and discussed, are designed to enable self-supervised learning. Moreover, we further design a MEC-enabled distributed multi-task self-supervised learning (DMTSSL) algorithm, with low complexity and high scalability to address the challenge of dimensional disaster. Finally, we develop the distance-aware transfer learning algorithm based on the DMTSSL algorithm to handle the dynamic scenario with negligible computation cost. Simulation results under $3$rd generation partnership project 38.901 urban-macrocell scenario demonstrate the superiority of the proposed algorithms over the baseline algorithms.

cs.LG↗

arXiv2024

An Agile Adaptation Method for Multi-mode Vehicle Communication Networks

This paper focuses on discovering the impact of communication mode allocation on communication efficiency in the vehicle communication networks. To be specific, Markov decision process and reinforcement learning are applied to establish an agile adaptation mechanism for multi-mode communication devices according to the driving scenarios and business requirements. Then, Q-learning is used to train the agile adaptation reinforcement learning model and output the trained model. By learning the best actions to take in different states to maximize the cumulative reward, and avoiding the problem of poor adaptation effect caused by inaccurate delay measurement in unstable communication scenarios. The experiments show that the proposed scheme can quickly adapt to dynamic vehicle networking environment, while achieving high concurrency and communication efficiency.

cs.NI↗

arXiv2024

Learning Wireless Data Knowledge Graph for Green Intelligent Communications: Methodology and Experiments

Intelligent communications have played a pivotal role in shaping the evolution of 6G networks. Native artificial intelligence (AI) within green communication systems must meet stringent real-time requirements. To achieve this, deploying lightweight and resource-efficient AI models is necessary. However, as wireless networks generate a multitude of data fields and indicators during operation, only a fraction of them imposes significant impact on the network AI models. Therefore, real-time intelligence of communication systems heavily relies on a small but critical set of the data that profoundly influences the performance of network AI models. These challenges underscore the need for innovative architectures and solutions. In this paper, we propose a solution, termed the pervasive multi-level (PML) native AI architecture, which integrates the concept of knowledge graph (KG) into the intelligent operational manipulations of mobile networks, resulting in the establishment of a wireless data KG. Leveraging the wireless data KG, we characterize the massive and complex data collected from wireless communication networks and analyze the relationships among various data fields. The obtained graph of data field relations enables the on-demand generation of minimal and effective datasets, referred to as feature datasets, tailored to specific application requirements. Consequently, this architecture not only enhances AI training, inference, and validation processes but also significantly reduces resource wastage and overhead for communication networks. To implement this architecture, we have developed a specific solution comprising a spatio-temporal heterogeneous graph attention neural network model (STREAM) as well as a feature dataset generation algorithm. Experiments are conducted to validate the effectiveness of the proposed architecture.

cs.NI↗

arXiv2023

Nontraditional Deterministic Remote State Preparation Using a Non-Maximally Entangled Channel without Additional Quantum Resources

In this paper, we have reinvestigated probabilistic quantum communication protocols and developed a nontraditional remote state preparation protocol that allows for deterministically transferring information encoded in quantum states using a non-maximally entangled channel. With an auxiliary particle and a simple measurement method, the success probability of preparing a d-dimensional quantum state is increased to 1 without spending additional quantum resources in advance to improve quantum channels, such as entanglement purification. Furthermore, we have designed a feasible experimental scheme to demonstrate the deterministic paradigm of transporting a polarization-encoded photon from one location to another using a generalized entangled state. This approach provides a practical method to address decoherence and environmental noises in actual quantum communication.

quant-ph↗

arXiv2023

Deterministic joint remote state preparation with a non-maximally entangled channel

Ideal deterministic quantum communication tasks require maximally entangled channels. The reality is that the maximally entangled channel is inevitably degraded to a non-maximally entangled one because of various decoherence mechanisms, seriously deteriorating the performance of quantum communication. Instead of adopting traditional entanglement purification or distillation to rebuild maximally entangled channels, we have designed a novel deterministic joint remote state preparation scheme using the degenerated non-maximally entangled state directly. A protocol for deterministic joint remote preparation of a two-dimensional quantum state via a non-maximally hyperentangled quantum channel has been devised with the help of auxiliary qudits. Then we generalize it to prepare a high-dimensional quantum state faithfully. No matter how weak the shared entanglement is, the success probability of communication is maintained at 100% as soon as it exists. This investigation provides an ideology for the construction of practical quantum communication networks.

quant-ph↗

arXiv2022

Toward 6G TK$μ$ Extreme Connectivity: Architecture, Key Technologies and Experiments

Sixth-generation (6G) networks are evolving towards new features and order-of-magnitude enhancement of systematic performance metrics compared to the current 5G. In particular, the 6G networks are expected to achieve extreme connectivity performance with Tbps-scale data rate, Kbps/Hz-scale spectral efficiency, and $μ$s-scale latency. To this end, an original three-layer 6G network architecture is designed to realise uniform full-spectrum cell-free radio access and provide task-centric agile proximate support for diverse applications. The designed architecture is featured by super edge node (SEN) which integrates connectivity, computing, AI, data, etc. On this basis, a technological framework of pervasive multi-level (PML) AI is established in the centralised unit to enable task-centric near-real-time resource allocation and network automation. We then introduce a radio access network (RAN) architecture of full spectrum uniform cell-free networks, which is among the most attractive RAN candidates for 6G TK$μ$ extreme connectivity. A few most promising key technologies, i.e., cell-free massive MIMO, photonics-assisted Terahertz wireless access and spatiotemporal two-dimensional channel coding are further discussed. A testbed is implemented and extensive trials are conducted to evaluate innovative technologies and methodologies. The proposed 6G network architecture and technological framework demonstrate exciting potentials for full-service and full-scenario applications.

cs.NI↗

arXiv2022

An NLoS-based Enhanced Sensing Method for MmWave Communication System

The millimeter-wave (mmWave)-based Wi-Fi sensing technology has recently attracted extensive attention since it provides a possibility to realize higher sensing accuracy. However, current works mainly concentrate on sensing scenarios where the line-of-sight (LoS) path exists, which significantly limits their applications. To address the problem, we propose an enhanced mmWave sensing algorithm in the 3D non-line-of-sight environment (mm3NLoS), aiming to sense the direction and distance of the target when the LoS path is weak or blocked. Specifically, we first adopt the directional beam to estimate the azimuth/elevation angle of arrival (AoA) and angle of departure (AoD) of the reflection path. Then, the distance of the related path is measured by the fine timing measurement protocol. Finally, we transform the AoA and AoD of the multiple non-line-of-sight (NLoS) paths into the direction vector and then obtain the information of targets based on the geometric relationship. The simulation results demonstrate that mm3NLoS can achieve a centimeter-level error with a 2m spacing. Compared to the prior work, it can significantly reduce the performance degradation under the NLoS condition.

cs.IT↗

arXiv2022

Representation Learning of Knowledge Graph for Wireless Communication Networks

With the application of the fifth-generation wireless communication technologies, more smart terminals are being used and generating huge amounts of data, which has prompted extensive research on how to handle and utilize these wireless data. Researchers currently focus on the research on the upper-layer application data or studying the intelligent transmission methods concerning a specific problem based on a large amount of data generated by the Monte Carlo simulations. This article aims to understand the endogenous relationship of wireless data by constructing a knowledge graph according to the wireless communication protocols, and domain expert knowledge and further investigating the wireless endogenous intelligence. We firstly construct a knowledge graph of the endogenous factors of wireless core network data collected via a 5G/B5G testing network. Then, a novel model based on graph convolutional neural networks is designed to learn the representation of the graph, which is used to classify graph nodes and simulate the relation prediction. The proposed model realizes the automatic nodes classification and network anomaly cause tracing. It is also applied to the public datasets in an unsupervised manner. Finally, the results show that the classification accuracy of the proposed model is better than the existing unsupervised graph neural network models, such as VGAE and ARVGE.

cs.LG↗

arXiv2022

Optimal deterministic remote state preparation via a non-maximally entangled channel without additional quantum resources

In this paper, we reinvestigate remote state preparation by using the prepared non-maximally entangled channel. An innovative remote state preparation protocol is developed for deterministically preparing information encoded in quantum states without additional consumption of quantum resources. We have increased the success probability of preparing a d-dimensional quantum state to 1 via a non-maximally entangled quantum channel. A feasibly experimental scheme is also designed to realize the above-mentioned deterministic scheme. This work provides a valuable method to address decoherence and environmental noises in the practicalization of quantum communication tasks.

quant-ph↗

arXiv2022

Cross-Layer Optimization: Joint User Scheduling and Beamforming Design With QoS Support in Joint Transmission Networks

User scheduling and beamforming design are two crucial yet coupled topics for wireless communication systems. They are usually optimized separately with conventional optimization methods. In this paper, a novel cross-layer optimization problem is considered, namely, the user scheduling and beamforming are jointly discussed subjecting to the requirement of per-user quality of service (QoS) and the maximum allowable transmit power for multicell multiuser joint transmission networks. To achieve the goal, a mixed discrete-continue variables combinational optimization problem is investigated with aiming at maximizing the sum rate of the communication system. To circumvent the original non-convex problem with dynamic solution space, we first transform it into a 0-1 integer and continue variables optimization problem, and then obtain a tractable form with continuous variables by exploiting the characteristics of 0-1 constraint. Finally, the scheduled users and the optimized beamforming vectors are simultaneously calculated by an alternating optimization algorithm. We also theoretically prove that the base stations allocate zero power to the unscheduled users. Furthermore, two heuristic optimization algorithms are proposed respectively based on brute-force search and greedy search. Numerical results validate the effectiveness of our proposed methods, and the optimization approach gets relatively balanced results compared with the other two approaches.

cs.IT↗

arXiv2022

An Unsupervised Deep Unrolling Framework for Constrained Optimization Problems in Wireless Networks

In wireless network, the optimization problems generally have complex constraints, and are usually solved via utilizing the traditional optimization methods that have high computational complexity and need to be executed repeatedly with the change of network environments. In this paper, to overcome these shortcomings, an unsupervised deep unrolling framework based on projection gradient descent, i.e., unrolled PGD network (UPGDNet), is designed to solve a family of constrained optimization problems. The set of constraints is divided into two categories according to the coupling relations among optimization variables and the convexity of constraints. One category of constraints includes convex constraints with decoupling among optimization variables, and the other category of constraints includes non-convex or convex constraints with coupling among optimization variables. Then, the first category of constraints is directly projected onto the feasible region, while the second category of constraints is projected onto the feasible region using neural network. Finally, an unrolled sum rate maximization network (USRMNet) is designed based on UPGDNet to solve the weighted SR maximization problem for the multiuser ultra-reliable low latency communication system. Numerical results show that USRMNet has a comparable performance with low computational complexity and an acceptable generalization ability in terms of the user distribution.

cs.IT↗

arXiv2021

Maximizing the Set Cardinality of Users Scheduled for Ultra-dense uRLLC Networks

Ultra-reliability and low latency communication has long been an important but challenging task in the fifth and sixth generation wireless communication systems. Scheduling as many users as possible to serve on the limited time-frequency resource is one of a crucial topic, subjecting to the maximum allowable transmission power and the minimum rate requirement of each user. We address it by proposing a mixed integer programming model, with the goal of maximizing the set cardinality of users instead of maximizing the system sum rate or energy efficiency. Mathematical transformations and successive convex approximation are combined to solve the complex optimization problem. Numerical results show that the proposed method achieves a considerable performance compared with exhaustive search method, but with lower computational complexity.

cs.IT↗

arXiv2020

Beamforming Design for Multiuser uRLLC with Finite Blocklength Transmission

Driven by the explosive growth of Internet of Things (IoT) devices with stringent requirements on latency and reliability, ultra-reliability and low latency communication (uRLLC) has become one of the three key communication scenarios for the fifth generation (5G) and beyond 5G communication systems. In this paper, we focus on the beamforming design problem for the downlink multiuser uRLLC systems. Since the strict demand on the reliability and latency, in general, short packet transmission is a favorable form for uRLLC systems, which indicates the literature Shannon's capacity formula is no longer applicable. With the finite blocklength transmission, the achievable delivery rate is greatly influenced by the reliability and latency. Using the developed achievable delivery rate formula for finite blocklength transmission, we respectively formulate the problems of interest as the weighted sum rate maximization, energy efficiency maximization, and user fairness optimization by considering the maximum allowable transmission power and minimum rate requirement. It's worthy pointing out that this is the first work to design the beamforming vectors for the downlink multiuser uRLLC systems. To address these non-convex problems, some important insights have been discovered by analyzing the function of achievable delivery rate. For example, the minimum rate requirement can be realized by low bounded the signal-to-interference-plus-noise ratio. Based on the discovered results, we provide algorithms to optimize the beamforming vectors and power allocation, which are guaranteed to converge to a local optimum solution of the formulated problems with low computational complexity. Our simulation results reveal that our proposed beamforming algorithms outperform the zero-forcing beamforming algorithm with equal power allocation widely used in the existing literatures.

cs.IT↗

arXiv2019

Cache-Enabled Coordinated Mobile Edge Network: Opportunities and Challenges

Cache-enabled coordinated mobile edge network is an emerging network architecture, wherein serving nodes located at the network edge have the capabilities of baseband signal processing and caching files at their local cache. The main goals of such an emerging network architecture are to alleviate the burden on fronthaul links, while achieving low-latency high rate content delivery, say on the order of the millisecond level end-to-end content delivery latency. Consequently, the application of delaysensitive and content-aware has been executed in close proximity to end users. In this article, an outlook of research directions, challenges, and opportunities is provided and discussed in depth. We first introduce the cache-enabled coordinated mobile edge network architecture, and then discuss the key technical challenges and opening research issues that need to be addressed for this architecture. Then, to reduce the delivery latency and the burden on fronthaul links, new cache-enabled physical layer transmission schemes are discussed. Finally, artificial intelligence based cache-enabled communications are discussed as future research directions. Numerical studies show that several gains are achieved by caching popular content at the network edge with proper coordinated transmission schemes.

eess.SP↗

arXiv2019

Cloud-Edge Coordinated Processing: Low-Latency Multicasting Transmission

Recently, edge caching and multicasting arise as two promising technologies to support high-data-rate and low-latency delivery in wireless communication networks. In this paper, we design three transmission schemes aiming to minimize the delivery latency for cache-enabled multigroup multicasting networks. In particular, full caching bulk transmission scheme is first designed as a performance benchmark for the ideal situation where the caching capability of each enhanced remote radio head (eRRH) is sufficient large to cache all files. For the practical situation where the caching capability of each eRRH is limited, we further design two transmission schemes, namely partial caching bulk transmission (PCBT) and partial caching pipelined transmission (PCPT) schemes. In the PCBT scheme, eRRHs first fetch the uncached requested files from the baseband unit (BBU) and then all requested files are simultaneously transmitted to the users. In the PCPT scheme, eRRHs first transmit the cached requested files while fetching the uncached requested files from the BBU. Then, the remaining cached requested files and fetched uncached requested files are simultaneously transmitted to the users. The design goal of the three transmission schemes is to minimize the delivery latency, subject to some practical constraints. Efficient algorithms are developed for the low-latency cloud-edge coordinated transmission strategies. Numerical results are provided to evaluate the performance of the proposed transmission schemes and show that the PCPT scheme outperforms the PCBT scheme in terms of the delivery latency criterion.

cs.IT↗

arXiv2019

Hybrid Precoder Design for Cache-enabled Millimeter Wave Radio Access Networks

In this paper, we study the design of a hybrid precoder, consisting of an analog and a digital precoder, for the delivery phase of downlink cache-enabled millimeter wave (mmWave) radio access networks (CeMm-RANs). In CeMm-RANs, enhanced remote radio heads (eRRHs), which are equipped with local cache and baseband signal processing capabilities in addition to the basic functionalities of conventional RRHs, are connected to the baseband processing unit via fronthaul links. Two different fronthaul information transfer strategies are considered, namely, hard fronthaul information transfer, where hard information of uncached requested files is transmitted via the fronthaul links to a subset of eRRHs, and soft fronthaul information transfer, where the fronthaul links are used to transmit quantized baseband signals of uncached requested files. The hybrid precoder is optimized for maximization of the minimum user rate under a fronthaul capacity constraint, an eRRH transmit power constraint, and a constant-modulus constraint on the analog precoder. The resulting optimization problem is non-convex, and hence the global optimal solution is difficult to obtain. Therefore, convex approximation methods are employed to tackle the non-convexity of the achievable user rate, the fronthaul capacity constraint, and the constant modulus constraint on the analog precoder. Then, an effective algorithm with provable convergence is developed to solve the approximated optimization problem. Simulation results are provided to evaluate the performance of the proposed algorithms, where fully digital precoding is used as benchmark. The results reveal that except for the case of a large fronthaul link capacity, soft fronthaul information transfer is preferable for CeMm-RANs.

cs.IT↗

arXiv2018

Two-level Transmission Scheme for Cache-enabled Fog Radio Access Networks

In this paper, we investigate the downlink transmission for cache-enabled fog radio access networks aiming at maximizing the delivery rate under the constraints of fronthaul capacity, maximum transmit power, and size of files. To reduce the delivery latency and the burden on fronthaul links and make full use of the local cache and baseband signal processing capabilities of enhanced remote radio heads (eRRHs), a two-level transmission scheme including cache-level and network-level transmission is proposed. In cache-level transmission, only requested files cached at the local cache are transmitted to the corresponding users. The duration of cache-level transmission is the delay caused by the transfer between the baseband unit (BBU) and eRRHs as well as the signal processing at the BBU. The remaining requested files are jointly transmitted to the corresponding users at network-level transmission. For cache-level transmission, a centralized optimization algorithm is firstly presented and then a decentralized optimization algorithm is provided to avoid the exchange of signaling among eRRHs. Meanwhile, another centralized optimization algorithm is presented to tackle the optimization problem for network-level transmission. All presented algorithms are proved to converge to the Karush-Kuhn-Tucker (KKT) solutions of the problems. Numerical results are provided to validate the effectiveness of the proposed transmission scheme as well as evaluating the system performance.

cs.IT↗