71 research outputs found

    The influence of random element displacement on DOA estimates obtained with (Khatri-Rao-)root-MUSIC

    Get PDF
    Although a wide range of direction of arrival (DOA) estimation algorithms has been described for a diverse range of array configurations, no specific stochastic analysis framework has been established to assess the probability density function of the error on DOA estimates due to random errors in the array geometry. Therefore, we propose a stochastic collocation method that relies on a generalized polynomial chaos expansion to connect the statistical distribution of random position errors to the resulting distribution of the DOA estimates. We apply this technique to the conventional root-MUSIC and the Khatri-Rao-root-MUSIC methods. According to Monte-Carlo simulations, this novel approach yields a speedup by a factor of more than 100 in terms of CPU-time for a one-dimensional case and by a factor of 56 for a two-dimensional case

    Stochastic framework for evaluating the effect of displaced antenna elements on DOA estimation

    Get PDF
    We establish a statistical framework for investigating the influence of correlated random displacements of antenna elements in a uniform circular antenna array (UCA) on the distribution of direction-of-arrival (DOA) estimates. More specifically, we apply a stochastic collocation method formodeling the sparse UCA root-MUSIC-DOA estimates as polynomial expansions of the random displacements. Compared to Monte-Carlo simulations, this approach yields a speedup of about 40 for the case of a displacement of two antenna elements

    DOA Estimation in Partially Correlated Noise Using Low-Rank/Sparse Matrix Decomposition

    Full text link
    We consider the problem of direction-of-arrival (DOA) estimation in unknown partially correlated noise environments where the noise covariance matrix is sparse. A sparse noise covariance matrix is a common model for a sparse array of sensors consisted of several widely separated subarrays. Since interelement spacing among sensors in a subarray is small, the noise in the subarray is in general spatially correlated, while, due to large distances between subarrays, the noise between them is uncorrelated. Consequently, the noise covariance matrix of such an array has a block diagonal structure which is indeed sparse. Moreover, in an ordinary nonsparse array, because of small distance between adjacent sensors, there is noise coupling between neighboring sensors, whereas one can assume that nonadjacent sensors have spatially uncorrelated noise which makes again the array noise covariance matrix sparse. Utilizing some recently available tools in low-rank/sparse matrix decomposition, matrix completion, and sparse representation, we propose a novel method which can resolve possibly correlated or even coherent sources in the aforementioned partly correlated noise. In particular, when the sources are uncorrelated, our approach involves solving a second-order cone programming (SOCP), and if they are correlated or coherent, one needs to solve a computationally harder convex program. We demonstrate the effectiveness of the proposed algorithm by numerical simulations and comparison to the Cramer-Rao bound (CRB).Comment: in IEEE Sensor Array and Multichannel signal processing workshop (SAM), 201

    A review of closed-form Cramér-Rao Bounds for DOA estimation in the presence of Gaussian noise under a unified framework

    Get PDF
    The Cramér-Rao Bound (CRB) for direction of arrival (DOA) estimation has been extensively studied over the past four decades, with a plethora of CRB expressions reported for various parametric models. In the literature, there are different methods to derive a closed-form CRB expression, but many derivations tend to involve intricate matrix manipulations which appear difficult to understand. Starting from the Slepian-Bangs formula and following the simplest derivation approach, this paper reviews a number of closed-form Gaussian CRB expressions for the DOA parameter under a unified framework, based on which all the specific CRB presentations can be derived concisely. The results cover three scenarios: narrowband complex circular signals, narrowband complex noncircular signals, and wideband signals. Three signal models are considered: the deterministic model, the stochastic Gaussian model, and the stochastic Gaussian model with the a priori knowledge that the sources are spatially uncorrelated. Moreover, three Gaussian noise models distinguished by the structure of the noise covariance matrix are concerned: spatially uncorrelated noise with unknown either identical or distinct variances at different sensors, and arbitrary unknown noise. In each scenario, a unified framework for the DOA-related block of the deterministic/stochastic CRB is developed, which encompasses one class of closed-form deterministic CRB expressions and two classes of stochastic ones under the three noise models. Comparisons among different CRBs across classes and scenarios are presented, yielding a series of equalities and inequalities which reflect the benchmark for the estimation efficiency under various situations. Furthermore, validity of all CRB expressions are examined, with some specific results for linear arrays provided, leading to several upper bounds on the number of resolvable Gaussian sources in the underdetermined case

    Augmented Multi-Subarray Dilated Nested Array with Enhanced Degrees of Freedom and Reduced Mutual Coupling

    Get PDF
    Sparse linear arrays (SLAs) can be designed in a systematic way, with the ability for underdetermined DOA estimation where a greater number of sources can be detected than that of sensors. In this paper, as the first stage, a new systematic design named multi-subarray dilated nested array (MDNA), whose difference co-array (DCA) can be proved to be hole-free, is firstly proposed by introducing a sparse ULA and multiple identical dense ULAs with appropriate sub-ULA spacings. The MDNA will degenerate into the nested array under specific conditions, and the uniform degrees of freedom (uDOFs) of MDNA is larger than that of its parent nested array. On the basis of MDNA, to reduce the mutual coupling effect, an augmented multi-subarray dilated nested array (AMDNA) is constructed by migrating some elements of the dense segments of MDNA, without reducing the number of uDOFs. Several theoretical properties of the proposed array structures are proved, and simulation results are provided to demonstrate the effectiveness and superiority of the proposed AMDNA over some existing sparse arrays

    Three more Decades in Array Signal Processing Research: An Optimization and Structure Exploitation Perspective

    Full text link
    The signal processing community currently witnesses the emergence of sensor array processing and Direction-of-Arrival (DoA) estimation in various modern applications, such as automotive radar, mobile user and millimeter wave indoor localization, drone surveillance, as well as in new paradigms, such as joint sensing and communication in future wireless systems. This trend is further enhanced by technology leaps and availability of powerful and affordable multi-antenna hardware platforms. The history of advances in super resolution DoA estimation techniques is long, starting from the early parametric multi-source methods such as the computationally expensive maximum likelihood (ML) techniques to the early subspace-based techniques such as Pisarenko and MUSIC. Inspired by the seminal review paper Two Decades of Array Signal Processing Research: The Parametric Approach by Krim and Viberg published in the IEEE Signal Processing Magazine, we are looking back at another three decades in Array Signal Processing Research under the classical narrowband array processing model based on second order statistics. We revisit major trends in the field and retell the story of array signal processing from a modern optimization and structure exploitation perspective. In our overview, through prominent examples, we illustrate how different DoA estimation methods can be cast as optimization problems with side constraints originating from prior knowledge regarding the structure of the measurement system. Due to space limitations, our review of the DoA estimation research in the past three decades is by no means complete. For didactic reasons, we mainly focus on developments in the field that easily relate the traditional multi-source estimation criteria and choose simple illustrative examples.Comment: 16 pages, 8 figures. This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessibl

    Joint Beamforming Design and 3D DoA Estimation for RIS-aided Communication System

    Full text link
    In this paper, we consider a reconfigurable intelligent surface (RIS)-assisted 3D direction-of-arrival (DoA) estimation system, in which a uniform planar array (UPA) RIS is deployed to provide virtual line-of-sight (LOS) links and reflect the uplink pilot signal to sensors. To overcome the mutually coupled problem between the beamforming design at the RIS and DoA estimation, we explore the separable sparse representation structure and propose an alternating optimization algorithm. The grid-based DoA estimation is modeled as a joint-sparse recovery problem considering the grid bias, and the Joint-2D-OMP method is used to estimate both on-grid and off-grid parts. The corresponding Cram\'er-Rao lower bound (CRLB) is derived to evaluate the estimation. Then, the beampattern at the RIS is optimized to maximize the signal-to-noise (SNR) at sensors according to the estimated angles. Numerical results show that the proposed alternating optimization algorithm can achieve lower estimation error compared to benchmarks of random beamforming design.Comment: 6 pages, 6 figure

    Statistical Performance Analysis of Sparse Linear Arrays

    Get PDF
    Direction-of-arrival (DOA) estimation remains an important topic in array signal processing. With uniform linear arrays (ULAs), traditional subspace-based methods can resolve only up to M-1 sources using M sensors. On the other hand, by exploiting their so-called difference coarray model, sparse linear arrays, such as co-prime and nested arrays, can resolve up to O(M^2) sources using only O(M) sensors. Various new sparse linear array geometries were proposed and many direction-finding algorithms were developed based on sparse linear arrays. However, the statistical performance of such arrays has not been analytically conducted. In this dissertation, we (i) study the asymptotic performance of the MUtiple SIgnal Classification (MUSIC) algorithm utilizing sparse linear arrays, (ii) derive and analyze performance bounds for sparse linear arrays, and (iii) investigate the robustness of sparse linear arrays in the presence of array imperfections. Based on our analytical results, we also propose robust direction-finding algorithms for use when data are missing. We begin by analyzing the performance of two commonly used coarray-based MUSIC direction estimators. Because the coarray model is used, classical derivations no longer apply. By using an alternative eigenvector perturbation analysis approach, we derive a closed-form expression of the asymptotic mean-squared error (MSE) of both estimators. Our expression is computationally efficient compared with the alternative of Monte Carlo simulations. Using this expression, we show that when the source number exceeds the sensor number, the MSE remains strictly positive as the signal-to-noise ratio (SNR) approaches infinity. This finding theoretically explains the unusual saturation behavior of coarray-based MUSIC estimators that had been observed in previous studies. We next derive and analyze the Cramér-Rao bound (CRB) for general sparse linear arrays under the assumption that the sources are uncorrelated. We show that, unlike the classical stochastic CRB, our CRB is applicable even if there are more sources than the number of sensors. We also show that, in such a case, this CRB remains strictly positive definite as the SNR approaches infinity. This unusual behavior imposes a strict lower bound on the variance of unbiased DOA estimators in the underdetermined case. We establish the connection between our CRB and the classical stochastic CRB and show that they are asymptotically equal when the sources are uncorrelated and the SNR is sufficiently high. We investigate the behavior of our CRB for co-prime and nested arrays with a large number of sensors, characterizing the trade-off between the number of spatial samples and the number of temporal samples. Our analytical results on the CRB will benefit future research on optimal sparse array designs. We further analyze the performance of sparse linear arrays by considering sensor location errors. We first introduce the deterministic error model. Based on this model, we derive a closed-form expression of the asymptotic MSE of a commonly used coarray-based MUSIC estimator, the spatial-smoothing based MUSIC (SS-MUSIC). We show that deterministic sensor location errors introduce a constant estimation bias that cannot be mitigated by only increasing the SNR. Our analytical expression also provides a sensitivity measure against sensor location errors for sparse linear arrays. We next extend our derivations to the stochastic error model and analyze the Gaussian case. We also derive the CRB for joint estimation of DOA parameters and deterministic sensor location errors. We show that this CRB is applicable even if there are more sources than the number of sensors. Lastly, we develop robust DOA estimators for cases with missing data. By exploiting the difference coarray structure, we introduce three algorithms to construct an augmented covariance matrix with enhanced degrees of freedom. By applying MUSIC to this augmented covariance matrix, we are able to resolve more sources than sensors. Our method utilizes information from all snapshots and shows improved estimation performance over traditional DOA estimators
    • …
    corecore