arXiv subjects

Jiang Zhu

Publications and source records attributed to Jiang Zhu.

At least 73 records · Page 4Linked to original sources

arXiv2019

A Two-Ray Multipath Model for Frequency Diverse Array-Based Directional Modulation in MISOME Wiretap Channels

A two-ray multipath model for frequency diverse array (FDA)-based directional modulation (DM) is proposed in multi-input single-output multi-eavesdropper (MISOME) wiretap channels for the first time. The excitation factors of the FDA and the weighting coefficients of the inserted artificial noise (AN) are jointly designed in a way which imposes no impact on the desired receiver while simultaneously distorting the received signals of eavesdroppers. Secrecy rate is analyzed for the proposed two-ray multipath FDA-based DM model. Numerical simulations verify the capability of physical layer secure (PLS) transmissions of the proposed FDA-DM model in two-ray multipath MISOME wiretap channels.

eess.SP↗

arXiv2019

WFRFT-aided Power-efficient Multi-beam Directional Modulation Schemes Based on Frequency Diverse Array

The artificial noise (AN) aided multi-beam directional modulation (DM) technology is capable of wireless physical layer secure (PLS) transmissions for multiple desired receivers in free space. The application of AN, however, makes it less power-efficient for such a DM system. To address this problem, the weighted fractional Fourier transform (WFRFT) technology is employed in this paper to achieve power-efficient multi-beam DM transmissions. Specifically, a power-efficient multi-beam WFRFT-DM scheme with cooperative receivers and a power-efficient multi-beam WFRFT-DM scheme with independent receivers are proposed based on frequency diverse array (FDA), respectively. The bit error rate (BER), secrecy rate, and robustness of the proposed multi-beam WFRFT-DM schemes are analyzed. Simulations demonstrate that 1) the proposed multi-beam WFRFT-DM schemes are more power-efficient than the conventional multi-beam AN-DM scheme; 2) the transmission security can also be guaranteed even if the eavesdroppers are located close to or the same as the desired receivers; and 3) the proposed multi-beam WFRFT-DM schemes are capable of independent transmissions for different desired receivers with different modulations.

eess.SP↗

arXiv2019

MIN: Co-Governing Multi-Identifier Network Architecture and its Prototype on Operator's Network

IP protocol is the core of TCP/IP network layer. However, since IP address and its Domain Name are allocated and managed by a single agency, there are risks of centralization. The semantic overload of IP address also reduces its scalability and mobility, which further hinders the security. This paper proposes a co-governing Multi-Identifier Network (MIN) architecture that constructs a network layer with parallel coexistence of multiple identifiers, including identity, content, geographic information, and IP address. On the management plane, we develop an efficient management system using consortium blockchain with voting consensus, so the network can simultaneously manage and support by hundreds or thousands of nodes with high throughput. On the data plane, we propose an algorithm merging hash table and prefix tree (HTP) for FIB, which avoids the false-negative error and can inter-translate different identifiers with tens of billions of entries. Further, we propose a scheme to transport IP packets using CCN as a tunnel for supporting progressive deployment. We deployed the prototype of MIN to the largest operators' network in Mainland China, Hongkong and Macao, and demonstrated that the network can register identifier under co-governing consensus algorithm, support VoD service very well.

cs.NI↗

arXiv2019

SVD-Aided Multi-Beam Directional Modulation Scheme Based on Frequency Diverse Array

With the assistance of singular value decomposition (SVD), a multi-beam directional modulation (DM) scheme based on symmetrical multi-carrier frequency diverse array (FDA) is proposed. The proposed DM scheme is capable of achieving range-angle dependent physical layer secure (PLS) transmissions in free space with much lower complexity than the conventional zero-forcing (ZF) method. Theoretical and simulated results about secrecy rate and complexity verify the improved computational efficiency and considerable memory savings despite a very small penalty of secrecy rate.

eess.SP↗

arXiv2019

The Prototype of Decentralized Multilateral Co-Governing Post-IP Internet Architecture and Its Testing on Operator Networks

The Internet has become the most important infrastructure of modern society, while the existing IP network is unable to provide high-quality service. The unilateralism IP network is unable to satisfy the Co-managing and Co-governing demands to Cyberspace for most Nations in the world as well. Facing this challenge, we propose a novel Decentralized Multilateral Co-Governing Post-IP Internet architecture. To verify its effectiveness, we develop the prototype on the operator's networks including China Mainland, Hong Kong, and Macao. The experiments and testing results show that this architecture is feasible for co-existing of Content-Centric Networking and IP network, and it might become a Chinese Solution to the world.

cs.NI↗

arXiv2019

Gridless Variational Bayesian Channel Estimation for Antenna Array Systems with Low Resolution ADCs

Employing low-resolution analog-to-digital converters (ADCs) coupled with large antenna arrays at the receivers has drawn considerable interests in the millimeter wave (mm-wave) system. Since mm-wave channels are sparse in angular dimensions, exploiting the structure could reduce the number of measurements while achieve acceptable performance at the same time. Motivated by the variational Bayesian line spectral estimation (VALSE) algorithm which treats the angles as random parameters, in contrast with previous works which confine the estimate to the set of grid angle points and induce grid mismatch, this paper proposes the grid-less quantized variational Bayesian channel estimation (GL-QVBCE) algorithm for antenna array systems with low resolution ADCs. Compared to the traditional least squares (LS) approach, numerical results show that GL-QVBCE performs significantly better and asymptotically approaches the Cramèr Rao bound (CRB).

eess.SP↗

arXiv2019

Multi-snapshot Newtonized Orthogonal Matching Pursuit for Line Spectrum Estimation with Multiple Measurement Vectors

In this paper, multi-snapshot Newtonized orthogonal matching pursuit (MNOMP) algorithm is proposed to deal with the line spectrum estimation with multiple measurement vectors (MMVs). MNOMP has the low computation complexity and state-of-the-art performance advantage of NOMP, and also includes two key steps: Detecting a new sinusoid on an oversampled discrete Fourier transform (DFT) grid and refining the parameters of already detected sinusoids to avoid the problem of basis mismatch. We provide a stopping criterion based on the overestimating probability of the model order. In addition, the convergence of the proposed algorithm is also proved. Finally, numerical results are conducted to show that the performance of MNOMP benefits from MMVs, and the effectiveness of MNOMP when compared against the state-of-the-art algorithms in terms of frequency estimation accuracy and computation complexity.

cs.IT↗

arXiv2019

A comment on the "A unified Bayesian inference framework for generalized linear models"

The recent work `A unified Bayesian inference framework for generalized linear models' \cite{meng1} shows that the GLM can be solved via iterating between the standard linear module (SLM) (running with standard Bayesian algorithm) and the minimum mean squared error (MMSE) module. The proposed framework utilizes expectation propagation and corresponds to the sum-product version \cite{Rangan1}. While in \cite{Rangan1}, a max-sum GAMP is also proposed. What is their intrinsic relationship? This comment aims to answer this.

eess.SP↗

arXiv2019

Dynamic Carrier and Power Amplifier Mapping for Energy Efficient Multi-Carrier Wireless Communications

The rapid increasing demand of wireless transmission has incurred mobile broadband to continuously evolve through multiple frequency bands, massive antennas and other multi-stream processing schemes. Together with the improved data transmission rate, the power consumption for multi-carrier transmission and processing is proportionally increasing, which contradicts with the energy efficiency requirements of 5G wireless systems. To meet this challenge, multi carrier power amplifier (MCPA) technology, e.g., to support multiple carriers through a single power amplifier, is widely deployed in practical. With massive carriers required for 5G communication and limited number of carriers supported per MCPA, a natural question to ask is how to map those carriers into multiple MCPAs and whether we shall dynamically adjust this mapping relation. In this paper, we have theoretically formulated the dynamic carrier and MCPA mapping problem to jointly optimize the traditional separated baseband and radio frequency processing. On top of that, we have also proposed a low complexity algorithm that can achieve most of the power saving with affordable computational time, if compared with the optimal exhaustive search based algorithm.

eess.SP↗

arXiv2018

Bilinear Adaptive Generalized Vector Approximate Message Passing

This paper considers the generalized bilinear recovery problem which aims to jointly recover the vector $\mathbf b$ and the matrix $\mathbf X$ from componentwise nonlinear measurements ${\mathbf Y}\sim p({\mathbf Y}|{\mathbf Z})=\prod\limits_{i,j}p(Y_{ij}|Z_{ij})$, where ${\mathbf Z}={\mathbf A}({\mathbf b}){\mathbf X}$, ${\mathbf A}(\cdot)$ is a known affine linear function of $\mathbf b$, and $p(Y_{ij}|Z_{ij})$ is a scalar conditional distribution which models the general output transform. A wide range of real-world applications, e.g., quantized compressed sensing with matrix uncertainty, blind self-calibration and dictionary learning from nonlinear measurements, one-bit matrix completion, etc., can be cast as the generalized bilinear recovery problem. To address this problem, we propose a novel algorithm called the Bilinear Adaptive Generalized Vector Approximate Message Passing (BAd-GVAMP), which extends the recently proposed Bilinear Adaptive Vector AMP (BAd-VAMP) algorithm to incorporate arbitrary distributions on the output transform. Numerical results on various applications demonstrate the effectiveness of the proposed BAd-GVAMP algorithm.

cs.IT↗

arXiv2018

A method of detector and event visualization with Unity in JUNO

A visualization method based on Unity engine is proposed for the Jiangmen Underground Neutrino Observatory (JUNO) experiment. The method has been applied in development of a new event display tool named ELAINA (Event Live Animation with unIty for Neutrino Analysis), which provides an intuitive way for users to observe the detector geometry, to tune the reconstruction algorithm and to analyze the physics events. In comparison with the traditional ROOT-based event display, ELAINA provides better visual effects with the Unity engine. It is developed independently of the JUNO offline software but shares the same detector description and event data model in JUNO offline with interfaces. Users can easily download and run the event display on their local computers with different operation systems.

physics.ins-det↗

arXiv2018

Variational Bayesian Line Spectral Estimation with Multiple Measurement Vectors

In this paper, the line spectral estimation (LSE) problem with multiple measurement vectors (MMVs) is studied utilizing the Bayesian methods. Motivated by the recently proposed variational line spectral estimation (VALSE) method, we develop the multisnapshot VALSE (MVALSE) for multi snapshot scenarios, which is especially important in array signal processing. The MVALSE shares the advantages of the VALSE method, such as automatically estimating the model order, noise variance, weight variance, and providing the uncertain degrees of the frequency estimates. It is shown that the MVALSE can be viewed as applying the VALSE with single measurement vector (SMV) to each snapshot, and combining the intermediate data appropriately. Furthermore, the Seq-MVALSE is developed to perform sequential estimation. Finally, numerical results are conducted to demonstrate the effectiveness of the MVALSE method, compared to the state-of-the-art methods in the MMVs setting.

cs.IT↗

arXiv2018

Gridless Line Spectral Estimation with Multiple Measurement Vector via Variational Bayesian Inference

Line spectral estimation (LSE) from multi snapshot samples is studied utilizing the variational Bayesian methods. Motivated by the recently proposed variational line spectral estimation (VALSE) method for a single snapshot, we develop the multisnapshot VALSE (MVALSE) for multi snapshot scenarios, which is important for array processing. The MVALSE shares the advantages of the VALSE method, such as automatically estimating the model order, noise variance and weight variance, closed-form updates of the posterior probability density function (PDF) of the frequencies. By using multiple snapshots, MVALSE improves the recovery performance and it encodes the prior distribution naturally. Finally, numerical results demonstrate the competitive performance of the MVALSE compared to state-of-the-art methods.

eess.SP↗

arXiv2018

A Two-stage Approach to Estimate CFO and Channel with One-bit ADCs

In this letter, we propose a two-stage approach to estimate the carrier frequency offset (CFO) and channel with one-bit analog-to-digital converters (ADCs). Firstly, a simple metric which is only a function of the CFO is proposed, and the CFO is estimated via solving the one-dimensional optimization problem. Secondly, the generalized approximate message passing (GAMP) algorithm combined with expectation maximization (EM) method is utilized to estimate the channel. In order to provide a benchmark of our proposed algorithm in terms of the CFO estimation, the corresponding Cramér-Rao bound (CRB) is derived. Furthermore, numerical results demonstrate the effectiveness of the proposed approach when applied to the general Gaussian channel and mmWave channel.

cs.IT↗

arXiv2018

Vector Approximate Message Passing Algorithm for Structured Perturbed Sensing Matrix

In this paper, we consider a general form of noisy compressive sensing (CS) where the sensing matrix is not precisely known. Such cases exist when there are imperfections or unknown calibration parameters during the measurement process. Particularly, the sensing matrix may have some structure, which makes the perturbation follow a fixed pattern. While previous work has focused on extending the approximate message passing (AMP) and LASSO algorithm to deal with the independent and identically distributed (i.i.d.) perturbation, we propose the robust variant vector approximate message passing (VAMP) algorithm with the perturbation being structured, based on the recent VAMP algorithm. The performance of the robust version of VAMP is demonstrated numerically.

eess.SP↗

arXiv2018

Asymptotically Optimal One-Bit Quantizer Design for Weak-signal Detection in Generalized Gaussian Noise and Lossy Binary Communication Channel

In this paper, quantizer design for weak-signal detection under arbitrary binary channel in generalized Gaussian noise is studied. Since the performances of the generalized likelihood ratio test (GLRT) and Rao test are asymptotically characterized by the noncentral chi-squared probability density function (PDF), the threshold design problem can be formulated as a noncentrality parameter maximization problem. The theoretical property of the noncentrality parameter with respect to the threshold is investigated, and the optimal threshold is shown to be found in polynomial time with appropriate numerical algorithm and proper initializations. In certain cases, the optimal threshold is proved to be zero. Finally, numerical experiments are conducted to substantiate the theoretical analysis.

eess.SP↗

arXiv2018

Binary Sparse Bayesian Learning Algorithm for One-bit Compressed Sensing

In this letter, a binary sparse Bayesian learning (BSBL) algorithm is proposed to slove the one-bit compressed sensing (CS) problem in both single measurement vector (SMV) and multiple measurement vectors (MMVs). By utilising the Bussgang-like decomposition, the one-bit CS problem can be approximated as a standard linear model. Consequently, the standard SBL algorithm can be naturally incorporated. Numerical results demonstrate the effectiveness of the BSBL algorithm.

cs.IT↗

arXiv2018

Event Display in the JUNO Experiment

The current event display system in the offline software of Jiangmen Underground Neutrino Observatory Experiment(JUNO) is based on the ROOT EVE package. We use Unity, a renowned game engine, to improve its performance and make it available on different platforms. Compared to ROOT, Unity provides a more vivid demonstration for high energy physics experiments and can be ported to different platforms easily. We build a tool for event display in JUNO with Unity. It provides us an intuitive way to observe the detector model, the particle trajectories and the hit distributions.

physics.ins-det↗