导航

ACTA AERONAUTICAET ASTRONAUTICA SINICA ›› 2017, Vol. 38 ›› Issue (7): 320843-320843.doi: 10.7527/S1000-6893.2017.320843

• Electronics and Electrical Engineering and Control • Previous Articles     Next Articles

Semidefinite programming algorithm with TDOA and FDOA measurements based on WGS-84 earth model

LI Wanchun1,2, PENG Wuke1,3, PENG Li1, MA Yezi1, LI Yingxiang2   

  1. 1. Center for Cyber Security, School of Electronic Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China;
    2. Meteorological Information and Signal Processing Key Laboratory of Sichuan Higher Education Institutes, School of Communication Engineering, Chengdu University of Information Technology, Chengdu 610225, China;
    3. School of Medicine, Tsinghua University, Beijing 100084, China
  • Received:2016-10-12 Revised:2016-11-28 Online:2017-07-15 Published:2017-04-01
  • Supported by:

    Meteorological Information and Signal Processing Key Laboratory of Sichuan Higher Education Institutes

Abstract:

In essence, detecting the location and velocity of a radiation source by utilizing time difference of arrival/frequency difference of arrival (TDOA/FDOA) for multiple satellites can be deemed as a highly nonlinear solution problem within noise. For a ground target, the WGS-84 earth model is the constraint condition, which makes the location system become more complicated. In this paper, a new algorithm for solving this location problem is proposed based on the semi-definite programming (SDP). Based on the novel algorithm, the nonlinear location problem can turn into a semidefinite optimization (SDO) by an appropriate relaxation which can be solved by some mature software like CVX. According to this model, the Cramer-Rao Lower Bound (CRLB) of the location problem is then given. The computer simulation demonstrates that the proposed algorithm can approach the CRLB effectively.

Key words: WGS-84 earth model, location by time difference of arrival, location by frequency difference of arrival, semidefinite programming, Cramer-Rao lower bound

CLC Number: