Cramér–Rao Bounds for DoA Estimation of Sparse Bayesian Learning with the Laplace Prior

Abstract

In this paper, we derive the Cramér–Rao lower bounds (CRLB) for direction of arrival (DoA) estimation by using sparse Bayesian learning (SBL) and the Laplace prior. CRLB is a lower bound on the variance of the estimator, the change of CRLB can indicate the effect of the specific factor to the DoA estimator, and in this paper a Laplace prior and the three-stage framework are used for the DoA estimation. We derive the CRLBs under different scenarios: (i) if the unknown parameters consist of deterministic and random variables, a hybrid CRLB is derived; (ii) if all the unknown parameters are random, a Bayesian CRLB is derived, and the marginalized Bayesian CRLB is obtained by marginalizing out the nuisance parameter. We also derive the CRLBs of the hyperparameters involved in the three-stage model and explore the effect of multiple snapshots to the CRLBs. We compare the derived CRLBs of SBL, finding that the marginalized Bayesian CRLB is tighter than other CRLBs when SNR is low and the differences between CRLBs become smaller when SNR is high. We also study the relationship between the mean squared error of the source magnitudes and the CRLBs, including numerical simulation results with a variety of antenna configurations such as different numbers of receivers and different noise conditions.

Keywords

• Cramér–Rao lower bound
• sparse Bayesian learning
• Bayesian CRLB
• Laplace prior
• nonuniform array