Abstract

In this paper, we investigate the existence and the algorithm analysis of an adaptive scheme that has been introduced for covariance structure matrix estimation in the context of adaptive radar detection under non-Gaussian noise. This latter has been modeled by spherically invariant random vector (SIRV), which is the product c of the square root of a positive unknown random variable tau and an independent Gaussian vector x,c=radic(tau) x. A similar line of work was undertaken in the context of compound Gaussian noise, and this paper extends the previous results in the case of SIRV modeled noise. More precisely, the fixed-point estimate to be studied verifies a nonlinear algebraic equation (E)x=f(x). The aim of this paper is twofold. First, we prove that (E) admits a unique solution x; secondly, we show that the corresponding iterative algorithm x <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n+1</sub> =f(x <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sub> ) converges to x for every admissible initial condition.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call