The Stochastic Crb For Array Processing A Textbook Derivation Today

Let ( \mathbfB = \mathbfA \mathbfP^1/2 ). Then ( \mathbfR = \mathbfB \mathbfB^H + \sigma^2 \mathbfI ). The projection matrix onto the column space of ( \mathbfB ): [ \mathbfP_B = \mathbfB(\mathbfB^H \mathbfB)^-1 \mathbfB^H ] but ( \mathbfB^H \mathbfB = \mathbfP^1/2 \mathbfA^H \mathbfA \mathbfP^1/2 ).

[ \textCRB(\boldsymbol\theta) = \frac\sigma^22N \left[ \Re \left( \mathbfD^H \mathbf\Pi_A^\perp \mathbfD \odot \mathbfP^T \right) \right]^-1 ] Let ( \mathbfB = \mathbfA \mathbfP^1/2 )

The CRB for ( \boldsymbol\theta ) (with nuisance parameters ( \mathbfp, \sigma^2 )) is: [ \textCRB(\boldsymbol\theta) = \left( \mathbfF \theta\theta - [\mathbfF \theta p \ \mathbfF \theta \sigma^2] \beginbmatrix \mathbfF pp & \mathbfF p\sigma^2 \ \mathbfF \sigma^2 p & \mathbfF \sigma^2\sigma^2 \endbmatrix^-1 \beginbmatrix \mathbfF p\theta \ \mathbfF_\sigma^2\theta \endbmatrix \right)^-1 ] Let ( \mathbfB = \mathbfA \mathbfP^1/2 )