The Hybrid Cramer-Rao Lower Bound - From Practice to Theory
Hagit Messer
Abstract
Hagit Messer
Abstract
In 1987, Rockah and Schultheiss (1987) introduced the hybrid Cramer-Rao lower bound (HCRLB ) as an extension of the classical Cramer-Rao bound (CRLB). Whereas the classical CRLB is applicable to the estimation of non-random parameters, and the Bayesian CRLB applies to random parameters, the HCRLB is applicable to the joint estimation of random and non-random parameters. In this paper was review the basic theory of the multi-parameter Cramer-Rao type bounds in a unified framework. Then, we discus the limitations of the HCRLB which may explain why it has not been introduced till needed for a certain array processing application, where it has shown to be useful
OpenAlex reports 50 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In 1987, Rockah and Schultheiss (1987) introduced the hybrid Cramer-Rao lower bound (HCRLB ) as an extension of the classical Cramer-Rao bound (CRLB). Whereas the classical CRLB is applicable to the estimation of non-random parameters, and the Bayesian CRLB applies to random parameters, the HCRLB is applicable to the joint estimation of random and non-random parameters. In this paper was review the basic theory of the multi-parameter Cramer-Rao type bounds in a unified framework. Then, we discus the limitations of the HCRLB which may explain why it has not been introduced till needed for a certain array processing application, where it has shown to be useful
Key concepts: Cramér–Rao bound, Upper and lower bounds, Estimation theory, Bayesian probability, Mathematics, Algorithm, Computer science, Random variable