646 research outputs found

    Array signal processing for maximum likelihood direction-of-arrival estimation

    Get PDF
    Emitter Direction-of-Arrival (DOA) estimation is a fundamental problem in a variety of applications including radar, sonar, and wireless communications. The research has received considerable attention in literature and numerous methods have been proposed. Maximum Likelihood (ML) is a nearly optimal technique producing superior estimates compared to other methods especially in unfavourable conditions, and thus is of significant practical interest. This paper discusses in details the techniques for ML DOA estimation in either white Gaussian noise or unknown noise environment. Their performances are analysed and compared, and evaluated against the theoretical lower bounds

    Accurate angle-of-arrival measurement using particle swarm optimization

    Get PDF
    As one of the major methods for location positioning, angle-of-arrival (AOA) estimation is a significant technology in radar, sonar, radio astronomy, and mobile communications. AOA measurements can be exploited to locate mobile units, enhance communication efficiency and network capacity, and support location-aided routing, dynamic network management, and many location-based services. In this paper, we propose an algorithm for AOA estimation in colored noise fields and harsh application scenarios. By modeling the unknown noise covariance as a linear combination of known weighting matrices, a maximum likelihood (ML) criterion is established, and a particle swarm optimization (PSO) paradigm is designed to optimize the cost function. Simulation results demonstrate that the paired estimator PSO-ML significantly outperforms other popular techniques and produces superior AOA estimates

    Multi-Step Knowledge-Aided Iterative ESPRIT for Direction Finding

    Full text link
    In this work, we propose a subspace-based algorithm for DOA estimation which iteratively reduces the disturbance factors of the estimated data covariance matrix and incorporates prior knowledge which is gradually obtained on line. An analysis of the MSE of the reshaped data covariance matrix is carried out along with comparisons between computational complexities of the proposed and existing algorithms. Simulations focusing on closely-spaced sources, where they are uncorrelated and correlated, illustrate the improvements achieved.Comment: 7 figures. arXiv admin note: text overlap with arXiv:1703.1052

    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

    Signal Recovery From 1-Bit Quantized Noisy Samples via Adaptive Thresholding

    Full text link
    In this paper, we consider the problem of signal recovery from 1-bit noisy measurements. We present an efficient method to obtain an estimation of the signal of interest when the measurements are corrupted by white or colored noise. To the best of our knowledge, the proposed framework is the pioneer effort in the area of 1-bit sampling and signal recovery in providing a unified framework to deal with the presence of noise with an arbitrary covariance matrix including that of the colored noise. The proposed method is based on a constrained quadratic program (CQP) formulation utilizing an adaptive quantization thresholding approach, that further enables us to accurately recover the signal of interest from its 1-bit noisy measurements. In addition, due to the adaptive nature of the proposed method, it can recover both fixed and time-varying parameters from their quantized 1-bit samples.Comment: This is a pre-print version of the original conference paper that has been accepted at the 2018 IEEE Asilomar Conference on Signals, Systems, and Computer
    • …
    corecore