Abstract
This paper proposes an efficient iterative algorithm for determining the position and velocity of a moving target in di stributed MIMO radar systems. We first formulate the localizatio n problem as a constrained weighted least squares (CWLS) probl em, which is essentially a quadratically constrained quadratic pro gramming (QCQP) problem due to its quadratic equality constrai nts. Then, the QCQP problem is transformed into a linearly const rained quadratic programming (LCQP) problem through approx imating each non-convex constraint as a linear constraint, and it i s solved iteratively based on QR decomposition. The closed-form solution in each iteration for solving the LQCP problem makes th e proposed method have high computational efficiency. The perfo rmance of the proposed method is validated via numerical simulations.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
