logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

The stochastic CRB for array processing: A textbook derivation

delete2001-05-01
delete312
PRE
AI
P
Petre Stoica *
E
E.G. Larsson
A
A.B. Gershman
DOI：10.1109/97.917699delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The stochastic Cramer-Rao bound (CRB) for direction estimation in array processing applications was indirectly derived some ten years ago as the (asymptotic) covariance matrix of the maximum likelihood (ML) estimator. Attempts to obtain the stochastic CRB directly via the CRB theory fell short of providing a simple derivation and consequently, no direct derivation of this useful performance bound was available in the open literature. In the present letter, we correct this situation by providing a textbook-like direct derivation of the stochastic CRB.
Keywords:
array signal processing
Cramer-Rao bound
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Signal Processing Magazine cover
IEEE Signal Processing Magazine
IF:
9.6
Papers:
1.1W
Citations:
1.7W

Organization

No organization information available