Plane localization for MIMO radar

Kilpatrick, Troy A. and Clarkson, I. Vaughan L. (2015) Plane localization for MIMO radar. IEEE Journal of Selected Topics in Signal Processing, 9 8: 1599-1609. doi:10.1109/JSTSP.2015.2470647

Author Kilpatrick, Troy A.
Clarkson, I. Vaughan L.
Title Plane localization for MIMO radar
Journal name IEEE Journal of Selected Topics in Signal Processing   Check publisher's open access policy
ISSN 1932-4553
Publication date 2015-12-01
Year available 2015
Sub-type Article (original research)
DOI 10.1109/JSTSP.2015.2470647
Open Access Status Not Open Access
Volume 9
Issue 8
Start page 1599
End page 1609
Total pages 11
Place of publication New York, NY United States
Publisher Institute of Electrical and Electronics Engineers
Language eng
Formatted abstract
We consider the problem of localizing a ground plane with respect to a multiple-input multiple-output (MIMO) radar within a three-dimensional environment. An example application is a low-visibility landing radar as described by Longstaff (“MIMO radar developments at Teledyne Australia,” Proc. Int. Conf. Radar, 2013). We propose an extension to the common tangent algorithm (COTA), which has been developed by the echo location community for localizing planes with single input multiple output (SIMO) audio systems. The method adopted for this paper is to generalize COTA for the multiple transmitters of the MIMO radar case. Generalizing the COTA equations generates a Non-Convex Quadratically Constrained Quadratic Program (NC-QCQP). We show that by first replacing the quadratic constraints by linear approximations we can solve the NC-QCQP problem by iteratively solving a series of quadratic programming problems. This method demonstrates both global convergence and convergence to the Cramér-Rao Lower Bound (CRLB). We then extend this approach to additionally linearize the quadratic objective function, which in turn reduces the iterate to a simple pseudoinverse. This method retains the global convergence properties of the previous method, but does not quite converge to the CRLB. We also investigate two methods which operate directly on the unconstrained cost function, the first a Newton-Raphson based method and the second a singular value decomposition (SVD)-based approach to solving the optimization problem. The SVD method exhibits approximately quadratic convergence and reaches the CRLB. However, it is only locally convergent. The Newton-Raphson method also achieves the CRLB. We use numerical simulations to demonstrate the validity of the techniques presented and show a comparison to the CRLB for the plane localization problem. Finally, we discuss a preprocessing technique that can be used to improve the estimation accuracy. We conclude by demonstra- ing the proposed algorithms on data collected from the low visibility landing aid radar (Longstaff , 2013) developed at Teledyne Defence Australia.
Keyword Common tangent algorithm (COTA)
Multiple-input multiple-output (MIMO)
Plane localization
Q-Index Code C1
Q-Index Status Provisional Code
Institutional Status UQ

Document type: Journal Article
Sub-type: Article (original research)
Collections: Official 2016 Collection
School of Information Technology and Electrical Engineering Publications
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 2 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 2 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Sun, 10 Jan 2016, 10:22:54 EST by System User on behalf of School of Information Technol and Elec Engineering