arXiv subjects

Shi Jin

Publications and source records attributed to Shi Jin.

At least 415 records · Page 23Linked to original sources

arXiv2022

Rate-Region Characterization and Channel Estimation for Cell-Free Symbiotic Radio Communications

Cell-free massive MIMO and symbiotic radio communication have been recently proposed as the promising beyond fifth-generation (B5G) networking architecture and transmission technology, respectively. To reap the benefits of both, this paper studies cell-free symbiotic radio communication systems, where a number of cell-free access points (APs) cooperatively send primary information to a receiver, and simultaneously support the passive backscattering communication of the secondary backscatter device (BD). We first derive the achievable communication rates of the active primary user and passive secondary user under the assumption of perfect channel state information (CSI), based on which the transmit beamforming of the cellfree APs is optimized to characterize the achievable rate-region of cell-free symbiotic communication systems. Furthermore, to practically acquire the CSI of the active and passive channels, we propose an efficient channel estimation method based on two-phase uplink-training, and the achievable rate-region taking into account CSI estimation errors are further characterized. Simulation results are provided to show the effectiveness of our proposed beamforming and channel estimation methods.

eess.SY↗

arXiv2022

On multilevel Monte Carlo methods for deterministic and uncertain hyperbolic systems

In this paper, we evaluate the performance of the multilevel Monte Carlo method (MLMC) for deterministic and uncertain hyperbolic systems, where randomness is introduced either in the modeling parameters or in the approximation algorithms. MLMC is a well known variance reduction method widely used to accelerate Monte Carlo (MC) sampling. However, we demonstrate in this paper that for hyperbolic systems, whether MLMC can achieve a real boost turns out to be delicate. The computational costs of MLMC and MC depend on the interplay among the accuracy (bias) and the computational cost of the numerical method for a single sample, as well as the variances of the sampled MLMC corrections or MC solutions. We characterize three regimes for the MLMC and MC performances using those parameters, and show that MLMC may not accelerate MC and can even have a higher cost when the variances of MC solutions and MLMC corrections are of the same order. Our studies are carried out by a few prototype hyperbolic systems: a linear scalar equation, the Euler and shallow water equations, and a linear relaxation model, the above statements are proved analytically in some cases, and demonstrated numerically for the cases of the stochastic hyperbolic equations driven by white noise parameters and Glimm's random choice method for deterministic hyperbolic equations.

math.NA↗

arXiv2022

Ergodicity and long-time behavior of the Random Batch Method for interacting particle systems

We study the geometric ergodicity and the long time behavior of the Random Batch Method for interacting particle systems, which exhibits superior numerical performance in recent large-scale scientific computing experiments. We show that for both the interacting particle system (IPS) and the random batch interacting particle system (RB-IPS), the distribution laws converge to their respective invariant distributions exponentially, and the convergence rate does not depend on the number of particles $N$, the time step $τ$ for batch divisions or the batch size $p$. Moreover, the Wasserstein distance between the invariant distributions of the IPS and the RB-IPS is bounded by $O(\sqrtτ)$, showing that the RB-IPS can be used to sample the invariant distribution of the IPS accurately with greatly reduced computational cost.

math.PR↗

arXiv2022

Reinforcement Learning-Empowered Mobile Edge Computing for 6G Edge Intelligence

Mobile edge computing (MEC) is considered a novel paradigm for computation-intensive and delay-sensitive tasks in fifth generation (5G) networks and beyond. However, its uncertainty, referred to as dynamic and randomness, from the mobile device, wireless channel, and edge network sides, results in high-dimensional, nonconvex, nonlinear, and NP-hard optimization problems. Thanks to the evolved reinforcement learning (RL), upon iteratively interacting with the dynamic and random environment, its trained agent can intelligently obtain the optimal policy in MEC. Furthermore, its evolved versions, such as deep RL (DRL), can achieve higher convergence speed efficiency and learning accuracy based on the parametric approximation for the large-scale state-action space. This paper provides a comprehensive research review on RL-enabled MEC and offers insight for development in this area. More importantly, associated with free mobility, dynamic channels, and distributed services, the MEC challenges that can be solved by different kinds of RL algorithms are identified, followed by how they can be solved by RL solutions in diverse mobile applications. Finally, the open challenges are discussed to provide helpful guidance for future research in RL training and learning MEC.

cs.IT↗

arXiv2022

Energy estimates and hypocoercivity analysis for a multi-phase Navier-Stokes-Vlasov-Fokker-Planck system with uncertainty

This paper is concerned with a kineitc-fluid model with random initial inputs in the fine particle regime, which is a system coupling the incompressible Navier-Stokes equations and the Vlasov-Fokker-Planck equations that model dispersed particles of different sizes. A uniform regularity for random initial data near the global equilibrium is established in some suitable Sobolev spaces by using energy estimates, and we also prove the energy decays exponentially in time by hypocoercivity arguments, which means that the long time behavior of the solution is insensitive to the random perturbation in the initial data. For the generalized polynomial chaos stochastic Galerkin method (gPC-sG) for the model, with initial data near the global equilibrium and smooth enough in the physical and random spaces, we prove that the gPC-sG method has spectral accuracy, uniformly in time and the Knudsen number, and the error decays exponentially in time.

math.AP↗

arXiv2022

Wireless Semantic Communications for Video Conferencing

Video conferencing has become a popular mode of meeting even if it consumes considerable communication resources. Conventional video compression causes resolution reduction under limited bandwidth. Semantic video conferencing maintains high resolution by transmitting some keypoints to represent motions because the background is almost static, and the speakers do not change often. However, the study on the impact of the transmission errors on keypoints is limited. In this paper, we initially establish a basal semantic video conferencing (SVC) network, which dramatically reduces transmission resources while only losing detailed expressions. The transmission errors in SVC only lead to a changed expression, whereas those in the conventional methods destroy pixels directly. However, the conventional error detector, such as the cyclic redundancy check, cannot reflect the degree of expression changes. To overcome this issue, we develop an incremental redundancy hybrid automatic repeat-request (IR-HARQ) framework for the varying channels (SVC-HARQ) incorporating a novel semantic error detector. The SVC-HARQ has flexibility in bit consumption and achieves good performance. In addition, SVC-CSI is designed for channel state information (CSI) feedback to allocate the keypoint transmission and enhance the performance dramatically. Simulation shows that the proposed wireless semantic communication system can significantly improve the transmission efficiency.This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible

eess.IV↗

arXiv2022

Collaborative Intelligent Reflecting Surface Networks with Multi-Agent Reinforcement Learning

Intelligent reflecting surface (IRS) is envisioned to be widely applied in future wireless networks. In this paper, we investigate a multi-user communication system assisted by cooperative IRS devices with the capability of energy harvesting. Aiming to maximize the long-term average achievable system rate, an optimization problem is formulated by jointly designing the transmit beamforming at the base station (BS) and discrete phase shift beamforming at the IRSs, with the constraints on transmit power, user data rate requirement and IRS energy buffer size. Considering time-varying channels and stochastic arrivals of energy harvested by the IRSs, we first formulate the problem as a Markov decision process (MDP) and then develop a novel multi-agent Q-mix (MAQ) framework with two layers to decouple the optimization parameters. The higher layer is for optimizing phase shift resolutions, and the lower one is for phase shift beamforming and power allocation. Since the phase shift optimization is an integer programming problem with a large-scale action space, we improve MAQ by incorporating the Wolpertinger method, namely, MAQ-WP algorithm to achieve a sub-optimality with reduced dimensions of action space. In addition, as MAQ-WP is still of high complexity to achieve good performance, we propose a policy gradient-based MAQ algorithm, namely, MAQ-PG, by mapping the discrete phase shift actions into a continuous space at the cost of a slight performance loss. Simulation results demonstrate that the proposed MAQ-WP and MAQ-PG algorithms can converge faster and achieve data rate improvements of 10.7% and 8.8% over the conventional multi-agent DDPG, respectively.

cs.MA↗

arXiv2022

Hybrid Active and Passive Sensing for SLAM in Wireless Communication Systems

Integrating sensing functions into future mobile equipment has become an important trend. Realizing different types of sensing and achieving mutual enhancement under the existing communication hardware architecture is a crucial challenge in realizing the deep integration of sensing and communication. In the 5G New Radio context, active sensing can be performed through uplink beam sweeping on the user equipment (UE) side to observe the surrounding environment. In addition, the UE can perform passive sensing through downlink channel estimation to measure the multipath component (MPC) information. This study is the first to develop a hybrid simultaneous localization and mapping (SLAM) mechanism that combines active and passive sensing, in which mutual enhancement between the two sensing modes is realized in communication systems. Specifically, we first establish a common feature associated with the reflective surface to bridge active and passive sensing, thus enabling information fusion. Based on the common feature, we can attain physical anchor initialization through MPC with the assistance of active sensing. Then, we extend the classic probabilistic data association SLAM mechanism to achieve UE localization and continuously refine the physical anchor and target reflections through the subsequent passive sensing. Numerical results show that the proposed hybrid active and passive sensing-based SLAM mechanism can work successfully in tricky scenarios without any prior information on the floor plan, anchors, or agents. Moreover, the proposed algorithm demonstrates significant performance gains compared with active or passive sensing only mechanisms.

cs.IT↗

arXiv2022

Analysis and Optimization of Hybrid Caching in mmWave Networks with BS Cooperation

In this paper, we investigate a hybrid caching strategy maximizing the success transmission probability (STP) in a millimeter wave (mmWave) cache-enabled network. First, we derive theoretical expressions of the STP and the average system transmission delay by utilizing stochastic geometry, then we consider the maximization of the STP and the minimization of the average system transmission delay by optimizing the design parameters. Considering the optimality structure of the NP-hard problem, the original problem is transferred into a multi-choice knapsack problem (MCKP). Finally, we investigate the impact of key network parameters on the STP and the average system transmission delay. Numerical results demonstrate the superiority of the proposed caching strategy over the conventional caching strategies in the mmWave cache-enabled networks.

cs.IT↗

arXiv2022

Fast Sinkhorn I: An O(N) algorithm for the Wasserstein-1 metric

The Wasserstein metric is broadly used in optimal transport for comparing two probabilistic distributions, with successful applications in various fields such as machine learning, signal processing, seismic inversion, etc. Nevertheless, the high computational complexity is an obstacle for its practical applications. The Sinkhorn algorithm, one of the main methods in computing the Wasserstein metric, solves an entropy regularized minimizing problem, which allows arbitrary approximations to the Wasserstein metric with O(N^2) computational cost. However, higher accuracy of its numerical approximation requires more Sinkhorn iterations with repeated matrix-vector multiplications, which is still unaffordable. In this work, we propose an efficient implementation of the Sinkhorn algorithm to calculate the Wasserstein-1 metric with O(N) computational cost, which achieves the optimal theoretical complexity. By utilizing the special structure of Sinkhorn's kernel, the repeated matrix-vector multiplications can be implemented with O(N) times multiplications and additions, using the Qin Jiushao or Horner's method for efficient polynomial evaluation, leading to an efficient algorithm without losing accuracy. In addition, the log-domain stabilization technique, used to stabilize the iterative procedure, can also be applied in this algorithm. Our numerical experiments show that the newly developed algorithm is one to three orders of magnitude faster than the original Sinkhorn algorithm.

math.OC↗

arXiv2022

Quantum algorithms for computing observables of nonlinear partial differential equations

We construct quantum algorithms to compute physical observables of nonlinear PDEs with M initial data. Based on an exact mapping between nonlinear and linear PDEs using the level set method, these new quantum algorithms for nonlinear Hamilton-Jacobi and scalar hyperbolic PDEs can be performed with a computational cost that is independent of M, for arbitrary nonlinearity. Depending on the details of the initial data, it can also display up to exponential advantage in both the dimension of the PDE and the error in computing its observables. For general nonlinear PDEs, quantum advantage with respect to M is possible in the large M limit.

quant-ph↗

arXiv2022

Computer Vision and Normalizing Flow-Based Defect Detection

Visual defect detection is critical to ensure the quality of most products. However, the majority of small and medium-sized manufacturing enterprises still rely on tedious and error-prone human manual inspection. The main reasons include: 1) the existing automated visual defect detection systems require altering production assembly lines, which is time consuming and expensive 2) the existing systems require manually collecting defective samples and labeling them for a comparison-based algorithm or training a machine learning model. This introduces a heavy burden for small and medium-sized manufacturing enterprises as defects do not happen often and are difficult and time-consuming to collect. Furthermore, we cannot exhaustively collect or define all defect types as any new deviation from acceptable products are defects. In this paper, we overcome these challenges and design a three-stage plug-and-play fully automated unsupervised 360-degree defect detection system. In our system, products are freely placed on an unaltered assembly line and receive 360 degree visual inspection with multiple cameras from different angles. As such, the images collected from real-world product assembly lines contain lots of background noise. The products face different angles. The product sizes vary due to the distance to cameras. All these make defect detection much more difficult. Our system use object detection, background subtraction and unsupervised normalizing flow-based defect detection techniques to tackle these difficulties. Experiments show our system can achieve 0.90 AUROC in a real-world non-altered drinkware production assembly line.

cs.CV↗

arXiv2022

Active IRS Aided Multiple Access for Energy-Constrained IoT Systems

We investigate the fundamental multiple access (MA) scheme in an active intelligent reflecting surface (IRS) aided energy-constrained Internet-of-Things (IoT) system, where an active IRS is deployed to assist the uplink transmission from multiple IoT devices to an access point (AP). Our goal is to maximize the sum throughput by optimizing the IRS beamforming vectors across time and resource allocation. To this end, we first study two typical active IRS aided MA schemes, namely time division multiple access (TDMA) and non-orthogonal multiple access (NOMA), by analytically comparing their achievable sum throughput and proposing corresponding algorithms. Interestingly, we prove that given only one available IRS beamforming vector, the NOMA-based scheme generally achieves a larger throughput than the TDMA-based scheme, whereas the latter can potentially outperform the former if multiple IRS beamforming vectors are available to harness the favorable time selectivity of the IRS. To strike a flexible balance between the system performance and the associated signaling overhead incurred by more IRS beamforming vectors, we then propose a general hybrid TDMA-NOMA scheme with user grouping, where the devices in the same group transmit simultaneously via NOMA while devices in different groups occupy orthogonal time slots. By controlling the number of groups, the hybrid TDMA-NOMA scheme is applicable for any given number of IRS beamforming vectors available. Despite of the non-convexity of the considered optimization problem, we propose an efficient algorithm based on alternating optimization. Simulation results illustrate the practical superiorities of the active IRS over the passive IRS in terms of the coverage extension and supporting multiple energy-limited devices, and demonstrate the effectiveness of our proposed hybrid MA scheme for flexibly balancing the performance-cost tradeoff.

cs.IT↗

arXiv2022

Near-Field Modelling and Performance Analysis of Modular Extremely Large-Scale Array Communications

This letter studies a new array architecture, termed as modular extremely large-scale array (XL-array), for which a large number of array elements are arranged in a modular manner. Each module consists of a moderate number of array elements and the modules are regularly arranged with the inter-module space typically much larger than signal wavelength to cater to the actual mounting structure. We study the mathematical modelling and conduct the performance analysis for modular XL-array communications, by considering the non-uniform spherical wave (NUSW) characteristic that is more suitable than the conventional uniform plane wave (UPW) assumption for physically large arrays. A closed-form expression is derived for the maximum signal-to-noise ratio (SNR) in terms of the geometries of the modular XL-array, including the total array size and module separation, as well as the user's location. The asymptotic SNR scaling law is revealed as the size of modular array goes to infinity. Furthermore, we show that the developed modelling and performance analysis include the existing results for collocated XL-array or far-field UPW assumption as special cases. Numerical results demonstrate the importance of near-field modelling for modular XL-array communications since it leads to significantly different results from the conventional far-field UPW modelling.

cs.IT↗

arXiv2022

Spatio-Temporal Analysis of SINR Meta Distribution for mmWave Heterogeneous Networks Under Geo/G/1 Queues

A fine-grained analysis of network performance is crucial for system design. In this paper, we focus on the meta distribution of the signal-to-interference-plus-noise-ratio (SINR) in the mmWave heterogeneous networks where the base stations (BS) in each tier are modeled as a Poisson point process (PPP). By utilizing stochastic geometry and queueing theory, we characterize the spatial and temporal randomness while the special characteristics of mmWave communications, including different path loss laws for line-of-sight and non-line-of-sight links and directional beamforming, are incorporated into the analysis. We derive the moments of the conditional successful transmission probability (STP). By taking the temporal random arrival of traffic into consideration, an equation is formulated to derive the meta distribution and the meta distribution can be obtained in a recursive manner. The numerical results reveal the impact of the key network parameters, such as the SINR threshold and the blockage parameter, on the network performance.

cs.IT↗

arXiv2021

AI-Aided Online Adaptive OFDM Receiver: Design and Experimental Results

Orthogonal frequency division multiplexing (OFDM) has been widely applied in current communication systems. The artificial intelligence (AI)-aided OFDM receivers are currently brought to the forefront to replace and improve the traditional OFDM receivers. In this study, we first compare two AI-aided OFDM receivers, namely, data-driven fully connected deep neural network and model-driven ComNet, through extensive simulation and real-time video transmission using a 5G rapid prototyping system for an over-the-air (OTA) test. We find a performance gap between the simulation and the OTA test caused by the discrepancy between the channel model for offline training and the real environment. We develop a novel online training system, which is called SwitchNet receiver, to address this issue. This receiver has a flexible and extendable architecture and can adapt to real channels by training only several parameters online. From the OTA test, the AI-aided OFDM receivers, especially the SwitchNet receiver, are robust to real environments and promising for future communication systems. We discuss potential challenges and future research inspired by our initial study in this paper.

eess.SP↗

arXiv2021

A Spatial-Temporal asymptotic preserving scheme for radiation magnetohydrodynamics in the equilibrium and non-equilibrium diffusion limit

The radiation magnetohydrodynamics (RMHD) system couples the ideal magnetohydrodynamics equations with a gray radiation transfer equation. The main challenge is that the radiation travels at the speed of light while the magnetohydrodynamics changes with the time scale of the fluid. The time scales of these two processes can vary dramatically. In order to use mesh sizes and time steps that are independent of the speed of light, asymptotic preserving (AP) schemes in both space and time are desired. In this paper, we develop an AP scheme in both space and time for the RMHD system. Two different scalings are considered. One results in an equilibrium diffusion limit system, while the other results in a non-equilibrium system. The main idea is to decompose the radiative intensity into three parts, each part is treated differently with suitable combinations of explicit and implicit discretizations guaranteeing the favorable stability conditionand computational efficiency. The performance of the AP method is presented, for both optically thin and thick regions, as well as for the radiative shock problem.

math.NA↗

arXiv2021

Path Loss Modeling and Measurements for Reconfigurable Intelligent Surfaces in the Millimeter-Wave Frequency Band

Reconfigurable intelligent surfaces (RISs) provide an interface between the electromagnetic world of wireless propagation environments and the digital world of information science. Simple yet sufficiently accurate path loss models for RISs are an important basis for theoretical analysis and optimization of RIS-assisted wireless communication systems. In this paper, we refine our previously proposed free-space path loss model for RISs to make it simpler, more applicable, and easier to use. The impact of the antenna's directivity of the transmitter, receiver, and the unit cells of the RIS on the path loss is explicitly formulated as an angle-dependent loss factor. The refined model gives more accurate estimates of the path loss of RISs comprised of unit cells with a deep sub-wavelength size. Based on the proposed model, the properties of a single unit cell are evaluated in terms of scattering performance, power consumption, and area, which allows us to unveil fundamental considerations for deploying RISs in high frequency bands. Two fabricated RISs operating in the millimeter-wave (mmWave) band are utilized to carry out a measurement campaign. The measurement results are shown to be in good agreement with the proposed path loss model. In addition, the experimental results suggest an effective form to characterize the power radiation pattern of the unit cell for path loss modeling.

eess.SP↗