In this letter, we consider the problem of joint selectionof transmitters and receivers in a distributed multi-input multi-output radarnetwork for localization. Different from previousworks, we consider a moremathematically challenging but generalized situation that the transmittingsignals are not perfectly orthogonal. Taking Cramér Rao lower bound asperformance metric, we propose a scheme of joint selection of transmittersand receivers (JSTR) aiming at optimizing the localization performanceunder limited number of nodes. We propose a bi-convex relaxation toreplace the resultant NP hard non-convex problem. Using the bi-convexity,the surrogate problem can be efficiently resolved by nonlinear alternatingdirection method of multipliers. Simulation results reveal that the proposedalgorithm has very close performance compared with the computationallyintensive but global optimal exhaustive search method.
展开▼