Learn More
No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any Limit of Liability/Disclaimer of Warranty: While the publisher and author have used their best efforts in preparing this book, they make no representations or warranties with respect to the accuracy or completeness of the contents of this book(More)
sion to reprinttrepublish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Abstract—The Bayesian Ziv–Zakai bound on the mean square error (MSE) in estimating a uniformly(More)
—Quadratic constraints on the weight vector of an adaptive linearly constrained minimum power (LCMP) beam-former can improve robustness to pointing errors and to random perturbations in sensor parameters. In this paper, we propose a technique for implementing a quadratic inequality constraint with recursive least squares (RLS) updating. A variable diagonal(More)
—For code-division multiple access (CDMA) communication systems, many constrained linear receivers have been developed to suppress multiple access interference. The linearly constrained formulations are generally sensitive to multipath fading and other types of signal mismatch. In this paper, we develop robust linear receivers by exploring appropriate(More)
The problem of broadband range and bearing estimation is considered. It is demonstrated that the MUSIC technique can be implemented with an efficient search procedure, alternating maximization, for estimating range and bearing. Range-bearing estimation performance is compared via simulation to MVDR and to the Cramer-Rao lower bound. Experimental range(More)
The Bayesian Cramér-Rao bound (BCRB) on the mean square error in tracking the position and velocity of a moving target in a multistatic radar system is formulated and a recur-sive bound on the state variables as a function of time is derived based on the nonlinear filtering bound developed by Tichavsky et al (1998). The result is an error bound ellipse in(More)