IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Performance analysis of direction finding with large arrays andfinite data
IEEE Transactions on Signal Processing
Threshold region performance of maximum likelihood direction of arrival estimators
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Threshold behavior of the maximum likelihood estimator of frequency
IEEE Transactions on Signal Processing
Threshold performance analysis of maximum likelihood DOA estimation
IEEE Transactions on Signal Processing
Capon algorithm mean-squared error threshold SNR prediction and probability of resolution
IEEE Transactions on Signal Processing - Part I
IEEE Transactions on Signal Processing
Characterization of threshold for single tone maximum likelihoodfrequency estimation
IEEE Transactions on Signal Processing
GLRT-Based Detection-Estimation for Undersampled Training Conditions
IEEE Transactions on Signal Processing - Part I
Paper: Modeling by shortest data description
Automatica (Journal of IFAC)
A general class of lower bounds in parameter estimation
IEEE Transactions on Information Theory
On the threshold effect in radar range estimation (Corresp.)
IEEE Transactions on Information Theory
Barankin Bounds on Parameter Estimation
IEEE Transactions on Information Theory
Single tone parameter estimation from discrete-time observations
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Signal Processing
Detection-estimation of multi-rank Gaussian sources using expected likelihood
Digital Signal Processing
Hi-index | 0.08 |
Performance assessment of algorithms for direction of arrival (DOA) estimation are typically done using large-sample justified asymptotic constructs such as consistency, efficiency, and the Cramer-Rao lower bound. The performance in parameter accuracy (usually the mean square error of the DOA estimate) of the algorithm relative to the true parameters of the sources is evaluated to determine if the algorithm is accurate, robust, computationally efficient, etc. However, performance assessment of the algorithm in practical circumstances with limited data sample volume cannot use these methods, because asymptotic statistical behavior is no longer met and the true location of the sources is in general unknown. This paper reviews the application of an performance assessment technique referred to as expected likelihood in such practical small-sample circumstances, and provides simulation and real-world examples of the capabilities provided by expected likelihood which does not rely on knowledge of the true source locations. Uses of the approach in other areas such aiding of numerical optimization, model order determination, and determination of appropriate diagonal loading in LSMI applications is also reviewed.