Searcharxiv⌕ Search

arXiv subjects

Le Zheng

Publications and source records attributed to Le Zheng.

33 records · Page 2Linked to original sources

URGLQ: An Efficient Covariance Matrix Reconstruction Method for Robust Adaptive Beamforming

The computational complexity of the conventional adaptive beamformer is relatively large, and the performance degrades significantly due to the model mismatch errors and the unwanted signals in received data. In this paper, an efficient unwanted signal removal and Gauss-Legendre quadrature (URGLQ)-based covariance matrix reconstruction method is proposed. Different from the prior covariance matrix reconstruction methods, a projection matrix is constructed to remove the unwanted signal from the received data, which improves the reconstruction accuracy of the covariance matrix. Considering that the computational complexity of most matrix reconstruction algorithms is relatively large due to the integral operation, we proposed a Gauss-Legendre quadrature-based method to approximate the integral operation while maintaining accuracy. Moreover, to improve the robustness of the beamformer, the mismatch in the desired steering vector is corrected by maximizing the output power of the beamformer under a constraint that the corrected steering vector cannot converge to any interference steering vector. Simulation results and prototype experiments demonstrate that the performance of the proposed beamformer outperforms the compared methods and is much closer to the optimal beamformer in different scenarios.

eess.SP↗

Nested sampling statistical errors

Nested sampling (NS) is a popular algorithm for Bayesian computation. We investigate statistical errors in NS both analytically and numerically. We show two analytic results. First, we show that the leading terms in Skilling's expression using information theory match the leading terms in Keeton's expression from an analysis of moments. This approximate agreement was previously only known numerically and was somewhat mysterious. Second, we show that the uncertainty in single NS runs approximately equals the standard deviation in repeated NS runs. Whilst intuitive, this was previously taken for granted. We close by investigating our results and their assumptions in several numerical examples, including cases in which NS uncertainties increase without bound.

astro-ph.IM↗

BigDL 2.0: Seamless Scaling of AI Pipelines from Laptops to Distributed Cluster

Most AI projects start with a Python notebook running on a single laptop; however, one usually needs to go through a mountain of pains to scale it to handle larger dataset (for both experimentation and production deployment). These usually entail many manual and error-prone steps for the data scientists to fully take advantage of the available hardware resources (e.g., SIMD instructions, multi-processing, quantization, memory allocation optimization, data partitioning, distributed computing, etc.). To address this challenge, we have open sourced BigDL 2.0 at https://github.com/intel-analytics/BigDL/ under Apache 2.0 license (combining the original BigDL and Analytics Zoo projects); using BigDL 2.0, users can simply build conventional Python notebooks on their laptops (with possible AutoML support), which can then be transparently accelerated on a single node (with up-to 9.6x speedup in our experiments), and seamlessly scaled out to a large cluster (across several hundreds servers in real-world use cases). BigDL 2.0 has already been adopted by many real-world users (such as Mastercard, Burger King, Inspur, etc.) in production.

cs.LG↗

An Overview of Signal Processing Techniques for Joint Communication and Radar Sensing

Joint communication and radar sensing (JCR) represents an emerging research field aiming to integrate the above two functionalities into a single system, sharing a majority of hardware and signal processing modules and, in a typical case, sharing a single transmitted signal. It is recognised as a key approach in significantly improving spectrum efficiency, reducing device size, cost and power consumption, and improving performance thanks to potential close cooperation of the two functions. Advanced signal processing techniques are critical for making the integration efficient, from transmission signal design to receiver processing. This paper provides a comprehensive overview of JCR systems from the signal processing perspective, with a focus on state-of-the-art. A balanced coverage on both transmitter and receiver is provided for three types of JCR systems, communication-centric, radar-centric, and joint design and optimization.

eess.SP↗

Radar and Communication Co-existence: an Overview

Increased amounts of bandwidth are required to guarantee both high-quality/high-rate wireless services (4G and 5G) and reliable sensing capabilities such as automotive radar, air traffic control, earth geophysical monitoring and security applications. Therefore, co-existence between radar and communication systems using overlapping bandwidths has been a primary investigation field in recent years. Various signal processing techniques such as interference mitigation, pre-coding or spatial separation, and waveform design allow both radar and communications to share the spectrum. This article reviews recent work on co-existence between radar and communication systems, including signal models, waveform design and signal processing techniques. Our goal is to survey contributions in this area in order to provide a primary starting point for new researchers interested in these problems.

eess.SP↗

Interference Removal for Radar/Communication Co-existence: the Random Scattering Case

In this paper we consider an un-cooperative spectrum sharing scenario, wherein a radar system is to be overlaid to a pre-existing wireless communication system. Given the order of magnitude of the transmitted powers in play, we focus on the issue of interference mitigation at the communication receiver. We explicitly account for the reverberation produced by the (typically high-power) radar transmitter whose signal hits scattering centers (whether targets or clutter) producing interference onto the communication receiver, which is assumed to operate in an un-synchronized and un-coordinated scenario. We first show that receiver design amounts to solving a non-convex problem of joint interference removal and data demodulation: next, we introduce two algorithms, both exploiting sparsity of a proper representation of the interference and of the vector containing the errors of the data block. The first algorithm is basically a relaxed constrained Atomic Norm minimization, while the latter relies on a two-stage processing structure and is based on alternating minimization. The merits of these algorithms are demonstrated through extensive simulations: interestingly, the two-stage alternating minimization algorithm turns out to achieve satisfactory performance with moderate computational complexity.

eess.SY↗

Super-Resolution mmWave Channel Estimation using Atomic Norm Minimization

We propose super-resolution MIMO channel estimators for millimeter-wave (mmWave) systems that employ hybrid analog and digital beamforming and generalized spatial modulation, respectively. Exploiting the inherent sparsity of mmWave channels, the channel estimation problem is formulated as an atomic norm minimization that enhances sparsity in the continuous angles of departure and arrival. Both pilot-assisted and data-aided channel estimators are developed, with the former one formulated as a convex problem and the latter as a non-convex problem. To solve these formulated channel estimation problems, we develop a computationally efficient conjugate gradient descent method based on non-convex factorization which restricts the search space to low-rank matrices. Simulation results are presented to illustrate the superior channel estimation performance of the proposed algorithms for both types of mmWave systems compared to the existing compressed-sensing-based estimators with finely quantized angle grids.

cs.IT↗

Adaptive Interference Removal for Un-coordinated Radar/Communication Co-existence

Most existing approaches to co-existing communication/radar systems assume that the radar and communication systems are coordinated, i.e., they share information, such as relative position, transmitted waveforms and channel state. In this paper, we consider an un-coordinated scenario where a communication receiver is to operate in the presence of a number of radars, of which only a sub-set may be active, which poses the problem of estimating the active waveforms and the relevant parameters thereof, so as to cancel them prior to demodulation. Two algorithms are proposed for such a joint waveform estimation/data demodulation problem, both exploiting sparsity of a proper representation of the interference and of the vector containing the errors of the data block, so as to implement an iterative joint interference removal/data demodulation process. The former algorithm is based on classical on-grid compressed sensing (CS), while the latter forces an atomic norm (AN) constraint: in both cases the radar parameters and the communication demodulation errors can be estimated by solving a convex problem. We also propose a way to improve the efficiency of the AN-based algorithm. The performance of these algorithms are demonstrated through extensive simulations, taking into account a variety of conditions concerning both the interferers and the respective channel states.

eess.SY↗

Overcoming The Limitations of Phase Transition by Higher Order Analysis of Regularization Techniques

We study the problem of estimating $β\in \mathbb{R}^p$ from its noisy linear observations $y= Xβ+ w$, where $w \sim N(0, σ_w^2 I_{n\times n})$, under the following high-dimensional asymptotic regime: given a fixed number $δ$, $p \rightarrow \infty$, while $n/p \rightarrow δ$. We consider the popular class of $\ell_q$-regularized least squares (LQLS) estimators, a.k.a. bridge, given by the optimization problem: \begin{equation*} \hatβ (λ, q ) \in \arg\min_β\frac{1}{2} \|y-Xβ\|_2^2+ λ\|β\|_q^q, \end{equation*} and characterize the almost sure limit of $\frac{1}{p} \|\hatβ (λ, q )- β\|_2^2$. The expression we derive for this limit does not have explicit forms and hence are not useful in comparing different algorithms, or providing information in evaluating the effect of $δ$ or sparsity level of $β$. To simplify the expressions, researchers have considered the ideal "no-noise" regime and have characterized the values of $δ$ for which the almost sure limit is zero. This is known as the phase transition analysis. In this paper, we first perform the phase transition analysis of LQLS. Our results reveal some of the limitations and misleading features of the phase transition analysis. To overcome these limitations, we propose the study of these algorithms under the low noise regime. Our new analysis framework not only sheds light on the results of the phase transition analysis, but also makes an accurate comparison of different regularizers possible.

math.ST↗

Joint Design of Overlaid Communication Systems and Pulsed Radars

The focus of this paper is on co-existence between a communication system and a pulsed radar sharing the same bandwidth. Based on the fact that the interference generated by the radar onto the communication receiver is intermittent and depends on the density of scattering objects (such as, e.g., targets), we first show that the communication system is equivalent to a set of independent parallel channels, whereby pre-coding on each channel can be introduced as a new degree of freedom. We introduce a new figure of merit, named the {\em compound rate}, which is a convex combination of rates with and without interference, to be optimized under constraints concerning the signal-to-interference-plus-noise ratio (including {\em signal-dependent} interference due to clutter) experienced by the radar and obviously the powers emitted by the two systems: the degrees of freedom are the radar waveform and the afore-mentioned encoding matrix for the communication symbols. We provide closed-form solutions for the optimum transmit policies for both systems under two basic models for the scattering produced by the radar onto the communication receiver, and account for possible correlation of the signal-independent fraction of the interference impinging on the radar. We also discuss the region of the achievable communication rates with and without interference. A thorough performance assessment shows the potentials and the limitations of the proposed co-existing architecture.

cs.IT↗

Millimeter-Wave Beamformed Full-dimensional MIMO Channel Estimation Based on Atomic Norm Minimization

The millimeter-wave (mmWave) full-dimensional (FD) MIMO system employs planar arrays at both the base station and user equipment and can simultaneously support both azimuth and elevation beamforming. In this paper, we propose atomic-norm-based methods for mmWave FD-MIMO channel estimation under both uniform planar arrays (UPA) and non-uniform planar arrays (NUPA). Unlike existing algorithms such as compressive sensing (CS) or subspace methods, the atomic-norm-based algorithms do not require to discretize the angle spaces of the angle of arrival (AoA) and angle of departure (AoD) into grids, thus provide much better accuracy in estimation. In the UPA case, to reduce the computational complexity, the original large-scale 4D atomic norm minimization problem is approximately reformulated as a semi-definite program (SDP) containing two decoupled two-level Toeplitz matrices. The SDP is then solved via the alternating direction method of multipliers (ADMM) where each iteration involves only closed-form computations. In the NUPA case, the atomic-norm-based formulation for channel estimation becomes nonconvex and a gradient-decent-based algorithm is proposed to solve the problem. Simulation results show that the proposed algorithms achieve better performance than the CS-based and subspace-based algorithms.

eess.SY↗

Improved NN-JPDAF for Joint Multiple Target Tracking and Feature Extraction

Feature aided tracking can often yield improved tracking performance over the standard multiple target tracking (MTT) algorithms with only kinematic measurements. However, in many applications, the feature signal of the targets consists of sparse Fourier-domain signals. It changes quickly and nonlinearly in the time domain, and the feature measurements are corrupted by missed detections and mis-associations. These two factors make it hard to extract the feature information to be used in MTT. In this paper, we develop a feature-aided nearest neighbour joint probabilistic data association filter (NN-JPDAF) for joint MTT and feature extraction in dense target environments. To estimate the rapidly varying feature signal from incomplete and corrupted measurements, we use the atomic norm constraint to formulate the sparsity of feature signal and use the $\ell_1$-norm to formulate the sparsity of the corruption induced by mis-associations. Based on the sparse representation, the feature signal are estimated by solving a semidefinite program (SDP) which is convex. We also provide an iterative method for solving this SDP via the alternating direction method of multipliers (ADMM) where each iteration involves closed-form computation. With the estimated feature signal, re-filtering is performed to estimate the kinematic states of the targets, where the association makes use of both kinematic and feature information. Simulation results are presented to illustrate the performance of the proposed algorithm in a radar application.

eess.SY↗

Demixing Sines and Spikes: Robust Spectral Super-resolution in the Presence of Outliers

We consider the problem of super-resolving the line spectrum of a multisinusoidal signal from a finite number of samples, some of which may be completely corrupted. Measurements of this form can be modeled as an additive mixture of a sinusoidal and a sparse component. We propose to demix the two components and super-resolve the spectrum of the multisinusoidal signal by solving a convex program. Our main theoretical result is that-- up to logarithmic factors-- this approach is guaranteed to be successful with high probability for a number of spectral lines that is linear in the number of measurements, even if a constant fraction of the data are outliers. The result holds under the assumption that the phases of the sinusoidal and sparse components are random and the line spectrum satisfies a minimum-separation condition. We show that the method can be implemented via semidefinite programming and explain how to adapt it in the presence of dense perturbations, as well as exploring its connection to atomic-norm denoising. In addition, we propose a fast greedy demixing method which provides good empirical results when coupled with a local nonconvex-optimization step.

math.OC↗

Super-Resolution Delay-Doppler Estimation for OFDM Passive Radar

In this paper, we consider the problem of joint delay-Doppler estimation of moving targets in a passive radar that makes use of orthogonal frequency-division multiplexing (OFDM) communication signals. A compressed sensing algorithm is proposed to achieve supper-resolution and better accuracy, using both the atomic norm and the $\ell_1$-norm. The atomic norm is used to manifest the signal sparsity in the continuous domain. Unlike previous works which assume the demodulation to be error free, we explicitly introduce the demodulation error signal whose sparsity is imposed by the $\ell_1$-norm. On this basis, the delays and Doppler frequencies are estimated by solving a semidefinite program (SDP) which is convex. We also develop an iterative method for solving this SDP via the alternating direction method of multipliers (ADMM) where each iteration involves closed-form computation. Simulation results are presented to illustrate the high performance of the proposed algorithm.

cs.IT↗

Does $\ell_p$-minimization outperform $\ell_1$-minimization?

In many application areas we are faced with the following question: Can we recover a sparse vector $x_o \in \mathbb{R}^N$ from its undersampled set of noisy observations $y \in \mathbb{R}^n$, $y=A x_o+w$. The last decade has witnessed a surge of algorithms and theoretical results addressing this question. One of the most popular algorithms is the $\ell_p$-regularized least squares (LPLS) given by the following formulation: \[ \hat{x}(γ,p )\in \arg\min_x \frac{1}{2}\|y - Ax\|_2^2+γ\|x\|_p^p, \] where $p \in [0,1]$. Despite the non-convexity of these problems for $p<1$, they are still appealing because of the following folklores in compressed sensing: (i) $\hat{x}(γ,p )$ is closer to $x_o$ than $\hat{x}(γ,1)$. (ii) If we employ iterative methods that aim to converge to a local minima of LPLS, then under good initialization these algorithms converge to a solution that is closer to $x_o$ than $\hat{x}(γ,1)$. In spite of the existence of plenty of empirical results that support these folklore theorems, the theoretical progress to establish them has been very limited. This paper aims to study the above folklore theorems and establish their scope of validity. Starting with approximate message passing algorithm as a heuristic method for solving LPLS, we study the impact of initialization on the performance of AMP. Then, we employ the replica analysis to show the connection between the solution of AMP and $\hat{x}(γ, p)$ in the asymptotic settings. This enables us to compare the accuracy of $\hat{x}(γ,p)$ for $p \in [0,1]$. In particular, we will characterize the phase transition and noise sensitivity of LPLS for every $0\leq p\leq 1$ accurately. Our results in the noiseless setting confirm that LPLS exhibits the same phase transition for every $0\leq p <1$ and this phase transition is much higher than that of LASSO.

cs.IT↗