9,577 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

    Robust Multiple Signal Classification via Probability Measure Transformation

    Full text link
    In this paper, we introduce a new framework for robust multiple signal classification (MUSIC). The proposed framework, called robust measure-transformed (MT) MUSIC, is based on applying a transform to the probability distribution of the received signals, i.e., transformation of the probability measure defined on the observation space. In robust MT-MUSIC, the sample covariance is replaced by the empirical MT-covariance. By judicious choice of the transform we show that: 1) the resulting empirical MT-covariance is B-robust, with bounded influence function that takes negligible values for large norm outliers, and 2) under the assumption of spherically contoured noise distribution, the noise subspace can be determined from the eigendecomposition of the MT-covariance. Furthermore, we derive a new robust measure-transformed minimum description length (MDL) criterion for estimating the number of signals, and extend the MT-MUSIC framework to the case of coherent signals. The proposed approach is illustrated in simulation examples that show its advantages as compared to other robust MUSIC and MDL generalizations

    Space Time MUSIC: Consistent Signal Subspace Estimation for Wide-band Sensor Arrays

    Full text link
    Wide-band Direction of Arrival (DOA) estimation with sensor arrays is an essential task in sonar, radar, acoustics, biomedical and multimedia applications. Many state of the art wide-band DOA estimators coherently process frequency binned array outputs by approximate Maximum Likelihood, Weighted Subspace Fitting or focusing techniques. This paper shows that bin signals obtained by filter-bank approaches do not obey the finite rank narrow-band array model, because spectral leakage and the change of the array response with frequency within the bin create \emph{ghost sources} dependent on the particular realization of the source process. Therefore, existing DOA estimators based on binning cannot claim consistency even with the perfect knowledge of the array response. In this work, a more realistic array model with a finite length of the sensor impulse responses is assumed, which still has finite rank under a space-time formulation. It is shown that signal subspaces at arbitrary frequencies can be consistently recovered under mild conditions by applying MUSIC-type (ST-MUSIC) estimators to the dominant eigenvectors of the wide-band space-time sensor cross-correlation matrix. A novel Maximum Likelihood based ST-MUSIC subspace estimate is developed in order to recover consistency. The number of sources active at each frequency are estimated by Information Theoretic Criteria. The sample ST-MUSIC subspaces can be fed to any subspace fitting DOA estimator at single or multiple frequencies. Simulations confirm that the new technique clearly outperforms binning approaches at sufficiently high signal to noise ratio, when model mismatches exceed the noise floor.Comment: 15 pages, 10 figures. Accepted in a revised form by the IEEE Trans. on Signal Processing on 12 February 1918. @IEEE201

    Approximate maximum likelihood estimation of two closely spaced sources

    Get PDF
    The performance of the majority of high resolution algorithms designed for either spectral analysis or Direction-of-Arrival (DoA) estimation drastically degrade when the amplitude sources are highly correlated or when the number of available snapshots is very small and possibly less than the number of sources. Under such circumstances, only Maximum Likelihood (ML) or ML-based techniques can still be effective. The main drawback of such optimal solutions lies in their high computational load. In this paper we propose a computationally efficient approximate ML estimator, in the case of two closely spaced signals, that can be used even in the single snapshot case. Our approach relies on Taylor series expansion of the projection onto the signal subspace and can be implemented through 1-D Fourier transforms. Its effectiveness is illustrated in complicated scenarios with very low sample support and possibly correlated sources, where it is shown to outperform conventional estimators

    Relaxed concentrated MLE for robust calibration of radio interferometers

    Full text link
    In this paper, we investigate the calibration of radio interferometers in which Jones matrices are considered to model the interaction between the incident electromagnetic field and the antennas of each station. Specifically, perturbation effects are introduced along the signal path, leading to the conversion of the plane wave into an electric voltage by the receptor. In order to design a robust estimator, the noise is assumed to follow a spherically invariant random process (SIRP). The derived algorithm is based on an iterative relaxed concentrated maximum likelihood estimator (MLE), for which closed-form expressions are obtained for most of the unknown parameters

    Performance Bounds for Parameter Estimation under Misspecified Models: Fundamental findings and applications

    Full text link
    Inferring information from a set of acquired data is the main objective of any signal processing (SP) method. In particular, the common problem of estimating the value of a vector of parameters from a set of noisy measurements is at the core of a plethora of scientific and technological advances in the last decades; for example, wireless communications, radar and sonar, biomedicine, image processing, and seismology, just to name a few. Developing an estimation algorithm often begins by assuming a statistical model for the measured data, i.e. a probability density function (pdf) which if correct, fully characterizes the behaviour of the collected data/measurements. Experience with real data, however, often exposes the limitations of any assumed data model since modelling errors at some level are always present. Consequently, the true data model and the model assumed to derive the estimation algorithm could differ. When this happens, the model is said to be mismatched or misspecified. Therefore, understanding the possible performance loss or regret that an estimation algorithm could experience under model misspecification is of crucial importance for any SP practitioner. Further, understanding the limits on the performance of any estimator subject to model misspecification is of practical interest. Motivated by the widespread and practical need to assess the performance of a mismatched estimator, the goal of this paper is to help to bring attention to the main theoretical findings on estimation theory, and in particular on lower bounds under model misspecification, that have been published in the statistical and econometrical literature in the last fifty years. Secondly, some applications are discussed to illustrate the broad range of areas and problems to which this framework extends, and consequently the numerous opportunities available for SP researchers.Comment: To appear in the IEEE Signal Processing Magazin

    Reciprocity Calibration for Massive MIMO: Proposal, Modeling and Validation

    Get PDF
    This paper presents a mutual coupling based calibration method for time-division-duplex massive MIMO systems, which enables downlink precoding based on uplink channel estimates. The entire calibration procedure is carried out solely at the base station (BS) side by sounding all BS antenna pairs. An Expectation-Maximization (EM) algorithm is derived, which processes the measured channels in order to estimate calibration coefficients. The EM algorithm outperforms current state-of-the-art narrow-band calibration schemes in a mean squared error (MSE) and sum-rate capacity sense. Like its predecessors, the EM algorithm is general in the sense that it is not only suitable to calibrate a co-located massive MIMO BS, but also very suitable for calibrating multiple BSs in distributed MIMO systems. The proposed method is validated with experimental evidence obtained from a massive MIMO testbed. In addition, we address the estimated narrow-band calibration coefficients as a stochastic process across frequency, and study the subspace of this process based on measurement data. With the insights of this study, we propose an estimator which exploits the structure of the process in order to reduce the calibration error across frequency. A model for the calibration error is also proposed based on the asymptotic properties of the estimator, and is validated with measurement results.Comment: Submitted to IEEE Transactions on Wireless Communications, 21/Feb/201

    Code-timing synchronization in DS-CDMA systems using space-time diversity

    Get PDF
    The synchronization of a desired user transmitting a known training sequence in a direct-sequence (DS) asynchronous code-division multiple-access (CDMA) sys-tem is addressed. It is assumed that the receiver consists of an arbitrary antenna array and works in a near-far, frequency-nonselective, slowly fading channel. The estimator that we propose is derived by applying the maximum likelihood (ML) principle to a signal model in which the contribution of all the interfering compo-nents (e.g., multiple-access interference, external interference and noise) is modeled as a Gaussian term with an unknown and arbitrary space-time correlation matrix. The main contribution of this paper is the fact that the estimator makes eÆcient use of the structure of the signals in both the space and time domains. Its perfor-mance is compared with the Cramer-Rao Bound, and with the performance of other methods proposed recently that also employ an antenna array but only exploit the structure of the signals in one of the two domains, while using the other simply as a means of path diversity. It is shown that the use of the temporal and spatial structures is necessary to achieve synchronization in heavily loaded systems or in the presence of directional external interference.Peer ReviewedPostprint (published version

    Covariance Estimation in Elliptical Models with Convex Structure

    Full text link
    We address structured covariance estimation in Elliptical distribution. We assume it is a priori known that the covariance belongs to a given convex set, e.g., the set of Toeplitz or banded matrices. We consider the General Method of Moments (GMM) optimization subject to these convex constraints. Unfortunately, GMM is still non-convex due to objective. Instead, we propose COCA - a convex relaxation which can be efficiently solved. We prove that the relaxation is tight in the unconstrained case for a finite number of samples, and in the constrained case asymptotically. We then illustrate the advantages of COCA in synthetic simulations with structured Compound Gaussian distributions. In these examples, COCA outperforms competing methods as Tyler's estimate and its projection onto a convex set
    • …
    corecore