2,619 research outputs found

    Joint ML calibration and DOA estimation with separated arrays

    Full text link
    This paper investigates parametric direction-of-arrival (DOA) estimation in a particular context: i) each sensor is characterized by an unknown complex gain and ii) the array consists of a collection of subarrays which are substantially separated from each other leading to a structured noise covariance matrix. We propose two iterative algorithms based on the maximum likelihood (ML) estimation method adapted to the context of joint array calibration and DOA estimation. Numerical simulations reveal that the two proposed schemes, the iterative ML (IML) and the modified iterative ML (MIML) algorithms for joint array calibration and DOA estimation, outperform the state of the art methods and the MIML algorithm reaches the Cram\'er-Rao bound for a low number of iterations

    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

    Source bearing and steering-vector estimation using partially calibrated arrays

    Get PDF
    The problem of source direction-of-arrival (DOA) estimation using a sensor array is addressed, where some of the sensors are perfectly calibrated, while others are uncalibrated. An algorithm is proposed for estimating the source directions in addition to the estimation of unknown array parameters such as sensor gains and phases, as a way of performing array self-calibration. The cost function is an extension of the maximum likelihood (ML) criteria that were originally developed for DOA estimation with a perfectly calibrated array. A particle swarm optimization (PSO) algorithm is used to explore the high-dimensional problem space and find the global minimum of the cost function. The design of the PSO is a combination of the problem-independent kernel and some newly introduced problem-specific features such as search space mapping, particle velocity control, and particle position clipping. This architecture plus properly selected parameters make the PSO highly flexible and reusable, while being sufficiently specific and effective in the current application. Simulation results demonstrate that the proposed technique may produce more accurate estimates of the source bearings and unknown array parameters in a cheaper way as compared with other popular methods, with the root-mean-squared error (RMSE) approaching and asymptotically attaining the Cramer Rao bound (CRB) even in unfavorable conditions

    Underwater Direction-of-Arrival Finding: Maximum Likelihood Estimation and Performance Analysis

    Get PDF
    In this dissertation, we consider the problems of direction-of-arrival: DOA) finding using acoustic sensor arrays in underwater scenarios, and develop novel signal models, maximum likelihood: ML) estimation methods, and performance analysis results. We first examine the underwater scenarios where the noise on sensor arrays are spatially correlated, for which we consider using sparse sensor arrays consisting of widely separated sub-arrays and develop ML DOA estimators based on the Expectation-Maximization scheme. We examine both zero-mean and non-zero-mean Gaussian incident signals and provide detailed estimation performance analysis. Our results show that non-zero means in signals improve the accuracy of DOA estimation. Then we consider the problem of DOA estimation of marine vessel sources such as ships, submarines, or torpedoes, which emit acoustic signals containing both sinusoidal and random components. We propose a mixed signal model and develop an ML estimator for narrow-band DOA finding of such signals and then generalize the results to the wide-band case. We provide thorough performance analysis for the proposed signal model and estimators. We show that our mixed signal model and ML estimators improve the DOA estimation performance in comparison with the typical stochastic ones assuming zero-mean Gaussian signals. At last, we derive a Barankin-type bound: BTB) on the mean-square error of DOA estimation using acoustic sensor arrays. The typical DOA estimation performance evaluation are usually based on the Cram\u27{e}r-Rao Bound: CRB), which cannot predict the threshold region of signal-to-noise ratio: SNR), below which the accuracy of the ML estimation degrades rapidly. Identification of the threshold region has important applications for DOA estimation in practice. Our derived BTB provides an approximation to the SNR threshold region

    Through-the-Wall Imaging and Multipath Exploitation

    Get PDF
    We consider the problem of using electromagnetic sensing to estimate targets in complex environments, such as when they are hidden behind walls and other opaque objects. The often unknown electromagnetic interactions between the target and the surrounding area, make the problem challenging. To improve our results, we exploit information in the multipath of the objects surrounding both the target and the sensors. First, we estimate building layouts by using the jump-diffusion algorithm and employing prior knowledge about typical building layouts. We also take advantage of a detailed physical model that captures the scattering by the inner walls and efficiently utilizes the frequency bandwidth. We then localize targets hidden behind reinforced concrete walls. The sensing signals reflected from the targets are significantly distorted and attenuated by the embedded metal bars. Using the surface formulation of the method of moments, we model the response of the reinforced walls, and incorporate their transmission coefficients into the beamforming method to achieve better estimation accuracy. In a related effort, we utilize the sparsity constraint to improve electromagnetic imaging of hidden conducting targets, assuming that a set of equivalent sources can be substituted for the targets. We derive a linear measurement model and employ l1 regularization to identify the equivalent sources in the vicinity of the target surfaces. The proposed inverse method reconstructs the target shape in one or two steps, using single-frequency data. Our results are experimentally verified. Finally, we exploit the multipath from sensor-array platforms to facilitate direction finding. This in contrast to the usual approach, which utilizes the scattering close to the targets. We analyze the effect of the multipath in a statistical signal processing framework, and compute the Cramer-Rao bound to obtain the system resolution. We conduct experiments on a simple array platform to support our theoretical approach

    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
    • …
    corecore