Skip to main navigation Skip to search Skip to main content

Weighted least squares algorithm for target localization in distributed MIMO radar

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

Abstract

In this paper, we address the problem of locating a target using multiple-input multiple-output (MIMO) radar with widely separated antennas. Through linearizing the bistatic range measurements, which correspond to the sum of transmitter-to-target and target-to-receiver distances, a quadratically constrained quadratic program (QCQP) for target localization is formulated. The solution of the QCQP is proved to be an unbiased position estimate whose variance equals the Cramér-Rao lower bound. A weighted least squares algorithm is developed to realize the QCQP. Simulation results are included to demonstrate the high accuracy of the proposed MIMO radar positioning approach.
Original languageEnglish
Pages (from-to)144-150
JournalSignal Processing
Volume115
Online published11 Apr 2015
DOIs
Publication statusPublished - Oct 2015

Research Keywords

  • Bistatic range
  • Multiple-input multiple-output (MIMO) radar
  • Target localization
  • Weighted least squares

Fingerprint

Dive into the research topics of 'Weighted least squares algorithm for target localization in distributed MIMO radar'. Together they form a unique fingerprint.

Cite this