arXiv subjects

Jing Yang

Publications and source records attributed to Jing Yang.

At least 379 records · Page 21Linked to original sources

arXiv2019

Complex-BP-Neural-Network-based Hybrid Precoding for Millimeter Wave Multiuser Massive MIMO Systems

The high energy consumption of massive multi-input multi-out (MIMO) system has become a prominent problem in the millimeter wave(mm-Wave) communication scenario. The hybrid precoding technology greatly reduces the number of radio frequency(RF) chains by handing over part of the coding work to the phase shifting network, which can effectively improve energy efficiency. However, conventional hybrid precoding algorithms based on mathematical means often suffer from performance loss and high computational complexity. In this paper, a novel BP-neural-network-enabled hybrid precoding algorithm is proposed, in which the full-digital zero-forcing(ZF) precoding is set as the training target. Considering that signals at the base station are complex, we choose the complex neural network that has a richer representational capacity. Besides, we present the activation function of the complex neural network and the gradient derivation of the back propagation process. Simulation results demonstrate that the performance of the proposed hybrid precoding algorithm can optimally approximate the ZF precoding.

eess.SP↗

arXiv2019

Power-Consumption Outage Challenge in Next-Generation Cellular Networks

The conventional outage in wireless communication systems is caused by the deterioration of the wireless communication link, i.e., the received signal power is less than the minimum received signal power. Is there a possibility that the outage occurs in wireless communication systems with a good channel state? Based on both communication and heat transfer theories, a power-consumption outage in the wireless communication between millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) base stations (BSs) and smartphones has been modeled and analyzed. Moreover, the total transmission time model with respect to the number of power-consumption outages is derived for mmWave massive MIMO communication systems. Simulation results indicate that the total transmission time is extended by the power-consumption outage, which deteriorates the average transmission rate of mmWave massive MIMO BSs.

cs.NI↗

arXiv2019

Hydrodynamical response of plane correlation in Pb+Pb collisions at $\sqrt{s_\text{NN}}$=2.76 TeV

In high energy heavy-ion collisions, the final anisotropic flow coefficients and their corresponding event-plane correlations are considered as the medium evolutional response to the initial geometrical eccentricities and their corresponding participant-plane correlations. We formulate a systematic theoretical analysis to study the hydrodynamical responses concerning higher order effects in Pb+Pb collisions at $\sqrt{s_\text{NN}}=2.76$ TeV by using Monte Carlo Glauber (MC-Glauber) model. To further understand the transformations of the initial participant-plane correlation, we construct a new set of events which randomize the directions of the initial participant planes of the original events. Our results indicate that the final strong event-plane correlations are mainly transformed from the large initial eccentricities, rather than the strong participant-plane correlations. However, the large flow coefficients and the discrepancies between the flow coefficients calculated by the single-shot and event-by-event simulations in peripheral collisions are relevant to those strong initial participant-plane correlations.

nucl-th↗

arXiv2019

New dynamic and verifiable multi-secret sharing schemes based on LFSR public key cryptosystem

A verifiable multi-secret sharing (VMSS) scheme enables the dealer to share multiple secrets, and the deception of both participants and the dealer can be detected. After analyzing the security of VMSS schemes proposed by Mashhadi and Dehkordi in 2015, we illustrate that they cannot detect some deception of the dealer. By using nonhomogeneous linear recursion and LFSR public key cryptosystem, we introduce two new VMSS schemes. Our schemes can not only overcome the drawback mentioned above, but also have shorter private/public key length at the same safety level. Besides, our schemes have dynamism.

cs.CR↗

arXiv2019

Age of Information Minimization for an Energy Harvesting Source with Updating Erasures: With and Without Feedback

Consider an energy harvesting (EH) sensor that continuously monitors a system and sends time-stamped status update to a destination. The sensor harvests energy from nature and uses it to power its updating operations. The destination keeps track of the system status through the successfully received updates. With the recently introduced information freshness metric "Age of Information" (AoI), our objective is to design optimal online status updating policy to minimize the long-term average AoI at the destination, subject to the energy causality constraint at the sensor. Due to the noisy channel between the sensor and the destination, each transmitted update may be erased with a fixed probability, and the AoI at the destination will be reset to zero only when an update is successfully received. We first consider status updating without feedback available to the sensor and show that the Best-effort Uniform updating (BU) policy is optimal. We then investigate status updating with perfect feedback to the sensor and prove the optimality of the Best-effort Uniform updating with Retransmission (BUR) policy. In order to prove the optimality of the proposed policies, for each case, we first identify a lower bound on the long-term average AoI among a broad class of online policies, and then construct a sequence of virtual policies to approach the lower bound asymptotically. Since those virtual policies are sub-optimal to the original policy, the original policy is thus optimal.

cs.IT↗

arXiv2019

When to Preempt? Age of Information Minimization under Link Capacity Constraint

In this paper, we consider a scenario where a source continuously monitors an object and sends time-stamped status updates to a destination through a rate-limited link. We assume updates arrive randomly at the source according to a Bernoulli process. Due to the link capacity constraint, it takes multiple time slots for the source to complete the transmission of an update. Therefore, when a new update arrives at the source during the transmission of another update, the source needs to decide whether to skip the new arrival or to switch to it, in order to minimize the expected average age of information (AoI) at the destination. We start with the setting where all updates are of the same size, and prove that within a broadly defined class of online policies, the optimal policy should be a renewal policy, and has a sequential switching property. We then show that the optimal decision of the source in any time slot has threshold structures, and only depends on the age of the update being transmitted and the AoI at the destination. We then consider the setting where updates are of different sizes, and show that the optimal Markovian policy also has a multiple-threshold structure. For each of the settings, we explicitly identify the thresholds by formulating the problem as a Markov Decision Process (MDP), and solve it through value iteration. Special structural properties of the corresponding optimal policy are utilized to reduce the computational complexity of the value iteration algorithm.

cs.IT↗

arXiv2019

Age-Minimal Transmission for Energy Harvesting Sensors with Finite Batteries: Online Policies

An energy-harvesting sensor node that is sending status updates to a destination is considered. The sensor is equipped with a battery of finite size to save its incoming energy, and consumes one unit of energy per status update transmission, which is delivered to the destination instantly over an error-free channel. The setting is online in which the harvested energy is revealed to the sensor causally over time, and the goal is to design status update transmission policy such that the long term average age of information (AoI) is minimized. AoI is defined as the time elapsed since the latest update has reached at the destination. Two energy arrival models are considered: a random battery recharge (RBR) model, and an incremental battery recharge (IBR) model. In both models, energy arrives according to a Poisson process with unit rate, with values that completely fill up the battery in the RBR model, and with values that fill up the battery incrementally, unit-by-unit, in the IBR model. The key approach to characterizing the optimal status update policy for both models is showing the optimality of renewal policies, in which the inter-update times follow a specific renewal process that depends on the energy arrival model and the battery size. It is then shown that the optimal renewal policy has an energy-dependent threshold structure, in which the sensor sends a status update only if the AoI grows above a certain threshold that depends on the energy available. For both the RBR and the IBR models, the optimal energy-dependent thresholds are characterized explicitly, i.e., in closed-form, in terms of the optimal long term average AoI. It is also shown that the optimal thresholds are monotonically decreasing in the energy available in the battery, and that the smallest threshold, which comes in effect when the battery is full, is equal to the optimal long term average AoI.

cs.IT↗

arXiv2019

Effect of in-medium mass-shift on transverse-momentum spectrum and elliptic anisotropy of $ϕ$ meson

We study the effect of in-medium mass-shift on transverse-momentum spectrum and elliptic anisotropy of $ϕ$ meson. It is found that the mass-shift enhances the $ϕ$ yields and suppresses the elliptic flow $v_2$ in large momentum region, and the effects increase with the increasing mass-shift. The effects are various for different sources and decrease with the increasing expanding velocity. We further study the effects for parts of all $ϕ$ meson with mass-shift, and the effects decrease with the decreasing probability of $ϕ$ meson with mass-shift. Since the different mass-shift lead to different transverse-momentum spectrum and $v_2$, our study may provide a way to restrict the ranges of in-medium mass-shift of $ϕ$ meson in high-energy heavy-ion collisions.

nucl-th↗

arXiv2019

Adaptive Coding for Information Freshness in a Two-user Broadcast Erasure Channel

In this paper, we investigate the impact of coding on the Age of Information (AoI) in a two-user broadcast symbol erasure channel with feedback. We assume each update consists of $K$ symbols and the source is able to broadcast one symbol in each time slot. Due to random channel noise, the intended symbol at each user will be erased according to an independent and identically distributed (i.i.d.) Bernoulli process. A user is able to successfully decode an update if it accumulates sufficient information and successfully decodes the $K$ symbols of the update. Assuming prefect feedback information at the source right after the transmission of each symbol, our objective is to design an adaptive coding scheme to achieve small AoI at both users. We propose a novel coding scheme to judiciously combine symbols from different updates together, and analyze the AoI at both users. Compared with a baseline greedy scheme, the proposed adaptive coding scheme improves the AoI at the weak user by orders of magnitude without compromising the AoI at the strong user.

cs.IT↗

arXiv2019

Using Erasure Feedback for Online Timely Updating with an Energy Harvesting Sensor

A real-time status updating system is considered, in which an energy harvesting sensor is acquiring measurements regarding some physical phenomenon and sending them to a destination through an erasure channel. The setting is online, in which energy arrives in units according to a Poisson process with unit rate, with arrival times being revealed causally over time. Energy is saved in a unit-sized battery. The sensor is notified by the destination of whether updates were erased via feedback. Updates need to reach the destination successfully in a timely fashion, namely, such that the long term average age of information, defined as the time elapsed since the latest successful update has reached the destination, is minimized. First, it is shown that the optimal status update policy has a renewal structure: successful update times should constitute a renewal process. Then, threshold-greedy policies are investigated: a new update is transmitted, following a successful one, only if the age of information grows above a certain threshold; and if it is erased, then all subsequent update attempts are greedily scheduled whenever energy is available. The optimal threshold-greedy policy is then analytically derived.

cs.IT↗

arXiv2019

Age-Optimal Transmission of Rateless Codes in an Erasure Channel

In this paper, we examine a status updating system where updates generated by the source are sent to the monitor through an erasure channel. We assume each update consists of $k$ symbols and the symbol erasure in each time slot follows an independent and identically distributed (i.i.d.) Bernoulli process. We assume rateless coding scheme is adopted at the transmitter and an update can be successfully decoded if $k$ coded symbols are received successfully. We assume perfect feedback available at the source, so that it knows whether a transmitted symbol has been erased instantly. Then, at the beginning of each time slot, the source has the choice to start transmitting a new update, or continue with the transmission of the previous update if it is not delivered yet. We adopt the metric "Age of Information" (AoI) to measure the freshness of information at the destination, where the AoI is defined as the age of the latest decoded update at the destination. Our objective is to design an optimal online transmission scheme to minimize the time-average AoI. The transmission decision is based on the instantaneous AoI, the age of the update being transmitted, as well as the number of successfully delivered symbols of the update. We formulate the problem as a Markov Decision Process (MDP) and identify the monotonic threshold structure of the optimal policy. Numerical results corroborate the structural properties of the optimal solution.

cs.IT↗

arXiv2019

Quantum-limited estimation of the axial separation of two incoherent point sources

Improving axial resolution is crucial for three-dimensional optical imaging systems. Here we present a scheme of axial superresolution for two incoherent point sources based on spatial mode demultiplexing. A radial mode sorter is used to losslessly decompose the optical fields into a radial mode basis set to extract the phase information associated with the axial positions of the point sources. We show theoretically and experimentally that, in the limit of a zero axial separation, our scheme allows for reaching the quantum Cramér-Rao lower bound and thus can be considered as one of the optimal measurement methods. Unlike other superresolution schemes, this scheme does not require neither activation of fluorophores nor sophisticated stabilization control. Moreover, it is applicable to the localization of a single point source in the axial direction. Our demonstration can be useful to a variety of applications such as far-field fluorescence microscopy.

physics.optics↗

arXiv2019

Thermal transistor and thermometer based on Coulomb-coupled conductors

We study a three-terminal setup consisting of a single-level quantum dot capacitively coupled to a quantum point contact. The point contact connects to a source and drain reservoirs while the quantum dot is coupled to a single base reservoir. This setup has been used to implement a noninvasive, nanoscale thermometer for the bath reservoir by detecting the current in the quantum point contact. Here, we demonstrate that the device can also be operated as a thermal transistor where the average (charge and heat) current through the quantum point contact is controlled via the temperature of the base reservoir. We characterize the performances of this device both as a transistor and a thermometer, and derive the operating condition maximizing their respective sensitivities. The present analysis is useful for the control of charge and heat flow and high precision thermometry at the nanoscale.

cond-mat.mes-hall↗

arXiv2019

Neural Networks in Hybrid Precoding for Millimeter Wave Massive MIMO Systems

Neural networks have been applied to the physical layer of wireless communication systems to solve complex problems. In millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) systems, hybrid precoding has been considered as an energy-efficient technology to replace fully-digital precoding. The way of designing hybrid precoding in mmWave massive MIMO systems by multi-layer neural networks has not been investigated. Based on further decomposing the baseband precoding matrix, an idea is proposed in this paper to map hybrid precoding structure to a multi-layer neural network. Considering the deterioration in the throughput and energy efficiency of mmWave massive MIMO systems, the feasibility of the proposed idea is analyzed. Moreover, a singular value decomposition (SVD) based decomposing (SVDDE) algorithm is proposed to evaluate the feasibility of the proposed idea. Simulation results indicate that there is an optimal number of users which can minimize the performance deterioration. Moreover, the simulation results also show that slight deterioration in the throughput and energy efficiency of mmWave massive MIMO systems is caused by further decomposing the baseband precoding matrix. In other words, further decomposing the baseband precoding matrix is a feasible way to map the hybrid precoding structure to a multi-layer neural network.

cs.NI↗

arXiv2019

Squeezed back-to-back correlations of $K^+$$K^-$ in d+Au collisions at $\sqrt{s_{NN}}=200$ GeV and Au+Au collisions at $\sqrt{s_{NN}}=62.4$ GeV

We investigate the squeezed back-to-back correlations (BBC) of $K^+$$K^-$, caused by the mass modification of the particle in the dense medium formed in d+Au collisions at $\sqrt{s_{NN}}=200$ GeV and Au+Au collisions at $\sqrt{s_{NN}}=62.4$ GeV. Considering some kaons may be not affected by the medium, we further study the BBC functions of $K^+$$K^-$ when parts of all kaons have a mass-shift. Our results indicate that the BBC functions of $K^+$$K^-$ can be observed when only about 10$\%$ of all kaons have a mass-shift in d+Au collisions at $\sqrt{s_{NN}}=200$ GeV and the peripheral collisions of Au+Au at $\sqrt{s_{NN}}=62.4$ GeV. Since the BBC function is caused by the mass-shift due to the interaction between the particle and the medium, the successful detection of the BBC function indirectly marks that the dense medium has formed in these collision systems. We suggest to measure the BBC function of $K^+$$K^-$ experimentally in d+Au collisions at $\sqrt{s_{NN}}=200$ GeV and peripheral collisions of Au+Au at $\sqrt{s_{NN}}=62.4$ GeV.

nucl-th↗

arXiv2019

Adaptive Scenario Discovery for Crowd Counting

Crowd counting, i.e., estimation number of the pedestrian in crowd images, is emerging as an important research problem with the public security applications. A key component for the crowd counting systems is the construction of counting models which are robust to various scenarios under facts such as camera perspective and physical barriers. In this paper, we present an adaptive scenario discovery framework for crowd counting. The system is structured with two parallel pathways that are trained with different sizes of the receptive field to represent different scales and crowd densities. After ensuring that these components are present in the proper geometric configuration, a third branch is designed to adaptively recalibrate the pathway-wise responses by discovering and modeling the dynamic scenarios implicitly. Our system is able to represent highly variable crowd images and achieves state-of-the-art results in two challenging benchmarks.

cs.CV↗

arXiv2019

Energy Efficiency of Generalized Spatial Modulation Aided Massive MIMO Systems

One of focuses in green communication studies is the energy efficiency (EE) of massive multiple-input multiple-output (MIMO) systems. Although the massive MIMO technology can improve the spectral efficiency (SE) of cellular networks by configuring a large number of antennas at base stations (BSs), the energy consumption of radio frequency (RF) chains increases dramatically. The increment of energy consumption is caused by the increase of RF chain number to match the antenna number in massive MIMO communication systems. To overcome this problem, a generalized spatial modulation (GSM) solution is presented to simultaneously reduce the number of RF chains and maintain the SE of massive MIMO communication systems. A EE model is proposed to estimate the transmission and computation power of massive MIMO communication systems with GSM. Simulation results demonstrate that the EE of massive MIMO communication systems with GSM outperforms the massive MIMO communication systems without GSM. Besides, the computation power consumed by massive MIMO communication systems with GSM is effectively reduced.

cs.NI↗

arXiv2019

Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Best-Effort and Save-and-Transmit

An additive white Gaussian noise energy-harvesting channel with an infinite-sized battery is considered. The energy arrival process is modeled as a sequence of independent and identically distributed random variables. The channel capacity $\frac{1}{2}\log(1+P)$ is achievable by the so-called best-effort and save-and-transmit schemes where $P$ denotes the battery recharge rate. This paper analyzes the save-and-transmit scheme whose transmit power is strictly less than $P$ and the best-effort scheme as a special case of save-and-transmit without a saving phase. In the finite blocklength regime, we obtain new non-asymptotic achievable rates for these schemes that approach the capacity with gaps vanishing at rates proportional to $1/\sqrt{n}$ and $\sqrt{(\log n)/n}$ respectively where~$n$ denotes the blocklength. The proof technique involves analyzing the escape probability of a Markov process. When $P$ is sufficiently large, we show that allowing the transmit power to back off from $P$ can improve the performance for save-and-transmit. The results are extended to a block energy arrival model where the length of each energy block $L$ grows sublinearly in $n$. We show that the save-and-transmit and best-effort schemes achieve coding rates that approach the capacity with gaps vanishing at rates proportional to $\sqrt{L/n}$ and $\sqrt{\max\{\log n, L\}/n}$ respectively.

cs.IT↗