Searcharxiv⌕ Search

arXiv subjects

Minglei Yang

Publications and source records attributed to Minglei Yang.

21 records · Page 2Linked to original sources

Performance Analysis and Power Allocation of Joint Communication and Sensing Towards Future Communication Networks

To mitigate the radar and communication frequency overlapping caused by massive devices access, we propose a novel joint communication and sensing (JCS) system in this paper, where a micro base station (MiBS) can realize target sensing and cooperative communication simultaneously. Concretely, the MiBS, as the sensing equipment, can also serve as a full-duplex (FD) decode-and-forward (DF) relay to assist the end-to-end communication. To further improve the spectrum utilization, non-orthogonal multiple access (NOMA) is adopted such that the communication between the macro base station (MaBS) and the Internet-of-Things (IoT) devices. To facilitate the performance evaluation, the exact and asymptotic outage probabilities, ergodic rates, sensing probability of the system are characterized. Subsequently, two optimal power allocation (OPA) problems of maximizing the received signal-to-interference-plus-noise ratio of sensing signal and maximizing the sum rate for communication are designed that are solved by means of the Lagrangian method and function monotonicity. The simulation results demonstrate that: 1) the proposed JCS NOMA system can accomplish both communication enhancement and sensing function under the premise of the same power consumption as non-cooperative NOMA; 2) the proposed OPA schemes manifest superiorities over a random power allocation scheme.

cs.IT↗

A Feynman-Kac based numerical method for the exit time probability of a class of transport problems

The exit time probability, which gives the likelihood that an initial condition leaves a prescribed region of the phase space of a dynamical system at, or before, a given time, is arguably one of the most natural and important transport problems. Here we present an accurate and efficient numerical method for computing this probability for systems described by non-autonomous (time-dependent) stochastic differential equations (SDEs) or their equivalent Fokker-Planck partial differential equations. The method is based on the direct approximation of the Feynman-Kac formula that establishes a link between the adjoint Fokker-Planck equation and the forward SDE. The Feynman-Kac formula is approximated using the Gauss-Hermite quadrature rules and piecewise cubic Hermite interpolating polynomials, and a GPU accelerated matrix representation is used to compute the entire time evolution of the exit time probability using a single pass of the algorithm. The method is unconditionally stable, exhibits second-order convergence in space, first-order convergence in time, and is straightforward to parallelize. Applications are presented to the advection-diffusion of a passive tracer in a fluid flow exhibiting chaotic advection, and to the runaway acceleration of electrons in a plasma in the presence of an electric field, collisions, and radiation damping. Benchmarks against analytical solutions as well as comparisons with explicit and implicit finite difference standard methods for the adjoint Fokker-Planck equation are presented.

physics.comp-ph↗

A sparse-grid probabilistic scheme for approximation of the runaway probability of electrons in fusion tokamak simulation

Runaway electrons (RE) generated during magnetic disruptions present a major threat to the safe operation of plasma nuclear fusion reactors. A critical aspect of understanding RE dynamics is to calculate the runaway probability, i.e., the probability that an electron in the phase space will runaway on, or before, a prescribed time. Such probability can be obtained by solving the adjoint equation of the underlying Fokker-Planck equation that controls the electron dynamics. In this effort, we present a sparse-grid probabilistic scheme for computing the runaway probability. The key ingredient of our approach is to represent the solution of the adjoint equation as a conditional expectation, such that discretizing the differential operator reduces to the approximation of a set of integrals. Adaptive sparse grid interpolation is utilized to approximate the map from the phase space to the runaway probability. The main novelties of this effort are the integration of the sparse-grid method into the probabilistic numerical scheme for computing escape probability, as well as the demonstration in computing RE probabilities. Two numerical examples are given to illustrate that the proposed method can achieve $\mathcal{O}(Δt)$ convergence, as well as the adaptive refinement strategy can effectively handle the sharp transition layer between the runaway and non-runaway regions.

physics.comp-ph↗