Searcharxiv⌕ Search

arXiv subjects

Rui Zhang

Publications and source records attributed to Rui Zhang.

At least 1,009 records · Page 56Linked to original sources

Intelligent Reflecting Surface Aided Multicasting with Random Passive Beamforming

In this letter, we consider a multicast system where a single-antenna transmitter sends a common message to multiple single-antenna users, aided by an intelligent reflecting surface (IRS) equipped with $N$ passive reflecting elements. Prior works on IRS have mostly assumed the availability of channel state information (CSI) for designing its passive beamforming. However, the acquisition of CSI requires substantial training overhead that increases with $N$. In contrast, we propose in this letter a novel \emph{random passive beamforming} scheme, where the IRS performs independent random reflection for $Q\geq 1$ times in each channel coherence interval without the need of CSI acquisition. For the proposed scheme, we first derive a closed-form approximation of the outage probability, based on which the optimal $Q$ with best outage performance can be efficiently obtained. Then, for the purpose of comparison, we derive a lower bound of the outage probability with traditional CSI-based passive beamforming. Numerical results show that a small $Q$ is preferred in the high-outage regime (or with high rate target) and the optimal $Q$ becomes larger as the outage probability decreases (or as the rate target decreases). Moreover, the proposed scheme significantly outperforms the CSI-based passive beamforming scheme with training overhead taken into consideration when $N$ and/or the number of users are large, thus offering a promising CSI-free alternative to existing CSI-based schemes.

eess.SP↗

Intelligent Reflecting Surface Enhanced Wireless Network: Two-timescale Beamforming Optimization

Intelligent reflecting surface (IRS) has drawn a lot of attention recently as a promising new solution to achieve high spectral and energy efficiency for future wireless networks. By utilizing massive low-cost passive reflecting elements, the wireless propagation environment becomes controllable and thus can be made favorable for improving the communication performance. Prior works on IRS mainly rely on the instantaneous channel state information (I-CSI), which, however, is practically difficult to obtain for IRS-associated links due to its passive operation and large number of elements. To overcome this difficulty, we propose in this paper a new two-timescale (TTS) transmission protocol to maximize the achievable average sum-rate for an IRS-aided multiuser system under the general correlated Rician channel model. Specifically, the passive IRS phase-shifts are first optimized based on the statistical CSI (S-CSI) of all links, which varies much slowly as compared to their I-CSI, while the transmit beamforming/precoding vectors at the access point (AP) are then designed to cater to the I-CSI of the users' effective channels with the optimized IRS phase-shifts, thus significantly reducing the channel training overhead and passive beamforming complexity over the existing schemes based on the I-CSI of all channels. For the single-user case, a novel penalty dual decomposition (PDD)-based algorithm is proposed, where the IRS phase-shifts are updated in parallel to reduce the computational time. For the multiuser case, we propose a general TTS optimization algorithm by constructing a quadratic surrogate of the objective function, which cannot be explicitly expressed in closed-form. Simulation results are presented to validate the effectiveness of our proposed algorithms and evaluate the impact of S-CSI and channel correlation on the system performance.

cs.IT↗

A New Observable for Measuring CP Property of Top-Higgs Interaction

We propose a new dihedral angle observable to measure the CP property of the interaction of top quark and Higgs boson in the $t\bar{t}H$ production at the 14~TeV LHC. We consider two decay modes of the Higgs boson, $H\to b\bar{b}$ and $H\to γγ$ and show that the dihedral angle distribution is able to distinguish the CP-even and the CP-odd hypothesis at 95\% confidence level with an integrated luminosity of $\sim 180~{\rm fb}^{-1}$.

hep-ph↗

A Low-Complexity Beamforming Design for Multiuser Wireless Energy Transfer

Wireless energy transfer (WET) is a green enabler of low-power Internet of Things (IoT). Therein, traditional optimization schemes relying on full channel state information (CSI) are often too costly to implement due to excessive energy consumption and high processing complexity. This letter proposes a simple, yet effective, energy beamforming scheme that allows a multi-antenna power beacon (PB) to fairly power a set of IoT devices by only relying on the first-order statistics of the channels. In addition to low complexity, the proposed scheme performs favorably as compared to benchmarking schemes and its performance improves as the number of PB's antennas increases. Finally, it is shown that further performance improvement can be achieved through proper angular rotations of the PB.

cs.IT↗

Wireless Communication via Double IRS: Channel Estimation and Passive Beamforming Designs

In this letter, we study efficient channel estimation and passive beamforming designs for a double-intelligent reflecting surface (IRS) aided single-user communication system, where a user communicates with an access point (AP) via the cascaded user-IRS 1-IRS 2-AP double-reflection link. First, a general channel estimation scheme is proposed for the system under any arbitrary inter-IRS channel, where all coefficients of the cascaded channel are estimated. Next, for the typical scenario with a line-of-sight (LoS)-dominant inter-IRS channel, we propose another customized scheme to estimate two signature vectors of the rank-one cascaded channel with significantly less channel training time than the first scheme. For the two proposed channel estimation schemes, we further optimize their corresponding cooperative passive beamforming for data transmission to maximize the achievable rate with the training overhead and channel estimation error taken into account. Numerical results show that deploying two cooperative IRSs with the proposed channel estimation and passive beamforming designs achieves significant rate enhancement as compared to the conventional case of single IRS deployment.

cs.IT↗

Signal-Dependent Performance Analysis of Orthogonal Matching Pursuit for Exact Sparse Recovery

Exact recovery of $K$-sparse signals $x \in \mathbb{R}^{n}$ from linear measurements $y=Ax$, where $A\in \mathbb{R}^{m\times n}$ is a sensing matrix, arises from many applications. The orthogonal matching pursuit (OMP) algorithm is widely used for reconstructing $x$. A fundamental question in the performance analysis of OMP is the characterizations of the probability of exact recovery of $x$ for random matrix $A$ and the minimal $m$ to guarantee a target recovery performance. In many practical applications, in addition to sparsity, $x$ also has some additional properties. This paper shows that these properties can be used to refine the answer to the above question. In this paper, we first show that the prior information of the nonzero entries of $x$ can be used to provide an upper bound on $\|x\|_1^2/\|x\|_2^2$. Then, we use this upper bound to develop a lower bound on the probability of exact recovery of $x$ using OMP in $K$ iterations. Furthermore, we develop a lower bound on the number of measurements $m$ to guarantee that the exact recovery probability using $K$ iterations of OMP is no smaller than a given target probability. Finally, we show that when $K=O(\sqrt{\ln n})$, as both $n$ and $K$ go to infinity, for any $0<ζ\leq 1/\sqrtπ$, $m=2K\ln (n/ζ)$ measurements are sufficient to ensure that the probability of exact recovering any $K$-sparse $x$ is no lower than $1-ζ$ with $K$ iterations of OMP. For $K$-sparse $α$-strongly decaying signals and for $K$-sparse $x$ whose nonzero entries independently and identically follow the Gaussian distribution, the number of measurements sufficient for exact recovery with probability no lower than $1-ζ$ reduces further to $m=(\sqrt{K}+4\sqrt{\frac{α+1}{α-1}\ln(n/ζ)})^2$ and asymptotically $m\approx 1.9K\ln (n/ζ)$, respectively.

cs.IT↗

Fast Channel Estimation for IRS-Assisted OFDM

In this letter, we study efficient channel estimation for an intelligent reflecting surface (IRS)-assisted orthogonal frequency division multiplexing (OFDM) system to achieve minimum training time. First, a fast channel estimation scheme with reduced OFDM symbol duration is proposed for arbitrary frequency-selective fading channels. Next, under the typical condition that the IRS-user channel is line-of-sight (LoS) dominant, another fast channel estimation scheme based on the novel concept of sampling-wise IRS reflection variation is proposed. Moreover, the pilot signal and IRS training reflection pattern are jointly optimized for both proposed schemes. Finally, the proposed schemes are compared in terms of training time and channel estimation performance via simulations, as well as against benchmark schemes.

cs.IT↗

Robust photon transmission in nonlinear parity-time-symmetric cavities

We explore the photon transfer in the nonlinear parity-time-symmetry system of two coupled cavities, which contains nonlinear gain and loss dependent on the intracavity photons. Analytical solution to the steady state gives a saturated gain, which satisfy the parity-time symmetry automatically. The eigen-frequency self-adapts the nonlinear saturated gain to reach the maximum efficiency in the steady state. We find that the saturated gain in the weak coupling regime does not match the loss in the steady state, exhibiting an appearance of a spontaneous symmetry-breaking. The photon transmission efficiency in the parity-time-symmetric regime is robust against the variation of the coupling strength, which improves the results of the conventional methods by tuning the frequency or the coupling strength to maintain optimal efficiency. Our scheme provides an experimental platform for realizing the robust photon transfer in cavities with nonlinear parity-time symmetry.

quant-ph↗

Anchor-Assisted Intelligent Reflecting Surface Channel Estimation for Multiuser Communications

Due to the passive nature of Intelligent Reflecting Surface (IRS), channel estimation is a fundamental challenge in IRS-aided wireless networks. Particularly, as the number of IRS reflecting elements and/or that of IRS-served users increase, the channel training overhead becomes excessively high. To tackle this challenge, we propose in this paper a new anchor-assisted two-phase channel estimation scheme, where two anchor nodes, namely A1 and A2, are deployed near the IRS for helping the base station (BS) to acquire the cascaded BS-IRS-user channels. Specifically, in the first phase, the partial channel state information (CSI), i.e., the element-wise channel gain square, of the BS-IRS link is obtained by estimating the BS-IRS-A1/A2 channels and the A1-IRS-A2 channel, separately. Then, in the second phase, by leveraging such partial knowledge of the BS-IRS channel that is common to all users, the individual cascaded BS-IRS-user channels are efficiently estimated. Simulation results demonstrate that the proposed anchor-assisted channel estimation scheme is able to achieve comparable mean-squared error (MSE) performance as compared to the conventional scheme, but with significantly reduced channel training time.

cs.IT↗

Mechanical Properties of Atomically Thin Boron Nitride and the Role of Interlayer Interactions

Atomically thin boron nitride (BN) nanosheets are important two-dimensional nanomaterials with many unique properties distinct from those of graphene, but the investigation of their mechanical properties still greatly lacks. Here we report that high-quality single-crystalline mono- and few-layer BN nanosheets are one of the strongest electrically insulating materials. More intriguingly, few-layer BN shows mechanical behaviors quite different from those of few-layer graphene under indentation. In striking contrast to graphene, whose strength decreases by more than 30% when the number of layers increases from 1 to 8, the mechanical strength of BN nanosheets is not sensitive to increasing thickness. We attribute this difference to the distinct interlayer interactions and hence sliding tendencies in these two materials under indentation. The significantly better mechanical integrity of BN nanosheets makes them a more attractive candidate than graphene for several applications, e.g. as mechanical reinforcements.

cond-mat.mtrl-sci↗

Relative Entropy Regularised TDLAS Tomography for Robust Temperature Imaging

Tunable Diode Laser Absorption Spectroscopy (TDLAS) tomography has been widely used for in situ combustion diagnostics, yielding images of both species concentration and temperature. The temperature image is generally obtained from the reconstructed absorbance distributions for two spectral transitions, i.e. two-line thermometry. However, the inherently ill-posed nature of tomographic data inversion leads to noise in each of the reconstructed absorbance distributions. These noise effects propagate into the absorbance ratio and generate artefacts in the retrieved temperature image. To address this problem, we have developed a novel algorithm, which we call Relative Entropy Tomographic RecOnstruction (RETRO), for TDLAS tomography. A relative entropy regularisation is introduced for high-fidelity temperature image retrieval from jointly reconstructed two-line absorbance distributions. We have carried out numerical simulations and proof-of-concept experiments to validate the proposed algorithm. Compared with the well-established Simultaneous Algebraic Reconstruction Technique (SART), the RETRO algorithm significantly improves the quality of the tomographic temperature images, exhibiting excellent robustness against TDLAS tomographic measurement noise. RETRO offers great potential for industrial field applications of TDLAS tomography, where it is common for measurements to be performed in very harsh environments.

eess.IV↗

Intelligent Reflecting Surface Aided Wireless Communications: A Tutorial

Intelligent reflecting surface (IRS) is an enabling technology to engineer the radio signal prorogation in wireless networks. By smartly tuning the signal reflection via a large number of low-cost passive reflecting elements, IRS is capable of dynamically altering wireless channels to enhance the communication performance. It is thus expected that the new IRS-aided hybrid wireless network comprising both active and passive components will be highly promising to achieve a sustainable capacity growth cost-effectively in the future. Despite its great potential, IRS faces new challenges to be efficiently integrated into wireless networks, such as reflection optimization, channel estimation, and deployment from communication design perspectives. In this paper, we provide a tutorial overview of IRS-aided wireless communication to address the above issues, and elaborate its reflection and channel models, hardware architecture and practical constraints, as well as various appealing applications in wireless networks. Moreover, we highlight important directions worthy of further investigation in future work.

cs.IT↗

Parton distributions and lattice QCD calculations: toward 3D structure

The strong force which binds hadrons is described by the theory of Quantum Chromodynamics (QCD). Determining the character and manifestations of QCD is one of the most important and challenging outstanding issues necessary for a comprehensive understanding of the structure of hadrons. Within the context of the QCD parton picture, the Parton Distribution Functions (PDFs) have been remarkably successful in describing a wide variety of processes. However, these PDFs have generally been confined to the description of collinear partons within the hadron. New experiments and facilities provide the opportunity to additionally explore the transverse structure of hadrons which is described by Generalized Parton Distributions (GPDs) and Transverse Momentum Dependent Parton Distribution Functions (TMD PDFs). In our previous review, we compared and contrasted the two main approaches used to determine the collinear PDFs: the first based on perturbative QCD factorization theorems, and the second based on lattice QCD calculations. In the present report, we provide an update of recent progress on the collinear PDFs, and also expand the scope to encompass the generalized PDFs (GPDs and TMD PDFs). We review the current state of the various calculations, and consider what new data might be available in the near future. We also examine how a shared effort can foster dialog between the PDF and Lattice QCD communities, and yield improvements for these generalized PDFs.

hep-ph↗

Fast Beam Training for IRS-Assisted Multiuser Communications

In this letter, we consider an intelligent reflecting surface (IRS)-assisted multiuser communication system, where an IRS is deployed to provide virtual line-of-sight (LoS) links between an access point (AP) and multiple users. We consider the practical codebook-based IRS passive beamforming and study efficient design for IRS reflect beam training, which is challenging due to the large number of IRS reflecting elements. In contrast to the conventional single-beam training, we propose a new multi-beam training method by dividing the IRS reflecting elements into multiple sub-arrays and designing their simultaneous multi-beam steering over time. By simply comparing the received signal power over time, each user can detect its optimal IRS beam direction with a high probability, even without searching over all possible beam directions as the single-beam training. Simulation results show that our proposed multi-beam training significantly reduces the training time of conventional single-beam training and yet achieves comparable IRS passive beamforming performance for data transmission.

cs.IT↗

Learning Based Distributed Tracking

Inspired by the great success of machine learning in the past decade, people have been thinking about the possibility of improving the theoretical results by exploring data distribution. In this paper, we revisit a fundamental problem called Distributed Tracking (DT) under an assumption that the data follows a certain (known or unknown) distribution, and propose a number data-dependent algorithms with improved theoretical bounds. Informally, in the DT problem, there is a coordinator and k players, where the coordinator holds a threshold N and each player has a counter. At each time stamp, at most one counter can be increased by one. The job of the coordinator is to capture the exact moment when the sum of all these k counters reaches N. The goal is to minimise the communication cost. While our first type of algorithms assume the concrete data distribution is known in advance, our second type of algorithms can learn the distribution on the fly. Both of the algorithms achieve a communication cost bounded byO(k log log N) with high probability, improving the state-of-the-art data-independent bound O(k log N/k). We further propose a number of implementation optimisation heuristics to improve both efficiency and robustness of the algorithms. Finally, we conduct extensive experiments on three real datasets and four synthetic datasets. The experimental results show that the communication cost of our algorithms is as least as 20% of that of the state-of-the-art algorithms.

cs.DS↗

Machine learning active-nematic hydrodynamics

Hydrodynamic theories effectively describe many-body systems out of equilibrium in terms of a few macroscopic parameters. However, such hydrodynamic parameters are difficult to derive from microscopics. Seldom is this challenge more apparent than in active matter where the energy cascade mechanisms responsible for autonomous large-scale dynamics are poorly understood. Here, we use active nematics to demonstrate that neural networks can extract the spatio-temporal variation of hydrodynamic parameters directly from experiments. Our algorithms analyze microtubule-kinesin and actin-myosin experiments as computer vision problems. Unlike existing methods, neural networks can determine how multiple parameters such as activity and elastic constants vary with ATP and motor concentration. In addition, we can forecast the evolution of these chaotic many-body systems solely from image-sequences of their past by combining autoencoder and recurrent networks with residual architecture. Our study paves the way for artificial-intelligence characterization and control of coupled chaotic fields in diverse physical and biological systems even when no knowledge of the underlying dynamics exists.

cond-mat.soft↗

Pilot Decontamination for Massive MIMO Network with UAVs

This letter studies the pilot contamination (PC) problem for massive multiple-input multiple-output (MIMO) networks with coexisting terrestrial users and unmanned aerial vehicles (UAVs). Due to the strong line-of-sight (LoS) air-to-ground channels between UAVs and base stations (BSs), UAVs usually cause a more severe PC issue as compared to the traditional terrestrial users. To mitigate the PC caused by UAVs, we propose a low-complexity distributed scheme by exploiting the full-dimensional beamforming of massive MIMO BSs and the angle-dependent LoS channels between them and high-altitude UAVs. Numerical results show the effectiveness of the proposed pilot decontamination scheme and the significant signal-to-interference-plus-noise ratio (SINR) gains in both the uplink and downlink after pilot decontamination.

cs.IT↗

Grafted network for person re-identification

Convolutional neural networks have shown outstanding effectiveness in person re-identification (re-ID). However, the models always have large number of parameters and much computation for mobile application. In order to relieve this problem, we propose a novel grafted network (GraftedNet), which is designed by grafting a high-accuracy rootstock and a light-weighted scion. The rootstock is based on the former parts of ResNet-50 to provide a strong baseline, while the scion is a new designed module, composed of the latter parts of SqueezeNet, to compress the parameters. To extract more discriminative feature representation, a joint multi-level and part-based feature is proposed. In addition, to train GraftedNet efficiently, we propose an accompanying learning method, by adding an accompanying branch to train the model in training and removing it in testing for saving parameters and computation. On three public person re-ID benchmarks (Market1501, DukeMTMC-reID and CUHK03), the effectiveness of GraftedNet are evaluated and its components are analyzed. Experimental results show that the proposed GraftedNet achieves 93.02%, 85.3% and 76.2% in Rank-1 and 81.6%, 74.7% and 71.6% in mAP, with only 4.6M parameters.

cs.CV↗