Conditional and unconditional Cramér-Rao bounds for near-field source localization

  • Authors:
  • Mohammed Nabil El Korso;Rémy Boyer;Alexandre Renaux;Sylvie Marcos

  • Affiliations:
  • Laboratoire des Signaux et Systémes, Université Paris-Sud XI, CNRS, Supelec, Gif-Sur-Yvette, France;Laboratoire des Signaux et Systémes, Université Paris-Sud XI, CNRS, Supelec, Gif-Sur-Yvette, France;Laboratoire des Signaux et Systémes, Université Paris-Sud XI, CNRS, Supelec, Gif-Sur-Yvette, France;Laboratoire des Signaux et Systémes, Université Paris-Sud XI, CNRS, Supelec, Gif-Sur-Yvette, France

  • Venue:
  • IEEE Transactions on Signal Processing
  • Year:
  • 2010

Quantified Score

Hi-index 35.69

Visualization

Abstract

Near-field source localization problem by a passive antenna array makes the assumption that the time-varying sources are located near the antenna. In this context, the far-field assumption (i.e., planar wave-front) is, of course, no longer valid and one has to consider a more complicated model parameterized by the bearing (as in the far-field case) and by the distance, named range, between the source and a reference coordinate system. One can find a plethora of estimation schemes in the literature, but their ultimate performance in terms of mean square error (MSE) have not been fully investigated. To characterize these performance, the Cramér-Rao bound (CRB) is a popular mathematical tool in signal processing. The main cause for this is that the MSE of several high-resolution direction of arrival algorithms are known to achieve the CRB under quite general/weak conditions. In this correspondence, we derive and analyze the so-called conditional and unconditional CRBs for a single time-varying near-field source. In each case, we obtain non-matrix closed-form expressions. Our approach has two advantages: i) due to the fact that one has to inverse the Fisher information matrix, the computational cost for a large number of snapshots (in the case of the conditional CRB) and/or for a large number of sensors (in the case of the unconditional CRB), of a matrix-based CRB can be high while our approach is low and ii) some useful information can be deduced from the behavior of the bound. In particular, an explicit relationship between the conditional and the unconditional CRBs is provided and one shows that closer is the source from the array and/or higher is the signal carrier frequency, better is the range estimation.