TY - JOUR
T1 - Riemannian geometric optimization methods for joint design of transmit sequence and receive filter on MIMO radar
AU - Li, Jie
AU - Liao, Guisheng
AU - Huang, Yan
AU - Zhang, Zhen
AU - Nehorai, Arye
N1 - Publisher Copyright:
© 1991-2012 IEEE.
PY - 2020
Y1 - 2020
N2 - In this paper, we study the joint design of a transmit sequence and a receive filter for an airborne multiple-input multiple-output (MIMO) radar system to improve its moving target detection performance in the presence of signal-dependent interference. The optimization problem is formulated to maximize the output signal-to-noise-plus-interference ratio (SINR), subject to the waveform constant-envelope (CE) constraint. To address the challenge of this non-convex problem, we propose a novel optimization framework for solving the problem over a Riemannian manifold which is the product of complex circles and a Euclidean space. Manifold optimization views the constrained optimization problem as an unconstrained one over a restricted search space. The Riemannian gradient descent algorithms and the Riemannian trust-region algorithm are then developed to solve the reformulated problem efficiently with low iteration complexity. In addition, the proposed manifold-based algorithms provably converge to an approximate local optimum from an arbitrary initialization point. Numerical experiments demonstrate the algorithmic advantages and performance gains of the proposed algorithms.
AB - In this paper, we study the joint design of a transmit sequence and a receive filter for an airborne multiple-input multiple-output (MIMO) radar system to improve its moving target detection performance in the presence of signal-dependent interference. The optimization problem is formulated to maximize the output signal-to-noise-plus-interference ratio (SINR), subject to the waveform constant-envelope (CE) constraint. To address the challenge of this non-convex problem, we propose a novel optimization framework for solving the problem over a Riemannian manifold which is the product of complex circles and a Euclidean space. Manifold optimization views the constrained optimization problem as an unconstrained one over a restricted search space. The Riemannian gradient descent algorithms and the Riemannian trust-region algorithm are then developed to solve the reformulated problem efficiently with low iteration complexity. In addition, the proposed manifold-based algorithms provably converge to an approximate local optimum from an arbitrary initialization point. Numerical experiments demonstrate the algorithmic advantages and performance gains of the proposed algorithms.
KW - Multiple-input multiple-output (MIMO) radar
KW - Riemannian optimization
KW - constant envelope (CE) constraint
KW - joint design
KW - product manifold
KW - receive filter
KW - transmit sequence
UR - http://www.scopus.com/inward/record.url?scp=85092718822&partnerID=8YFLogxK
U2 - 10.1109/TSP.2020.3022821
DO - 10.1109/TSP.2020.3022821
M3 - Article
AN - SCOPUS:85092718822
SN - 1053-587X
VL - 68
SP - 5602
EP - 5616
JO - IEEE Transactions on Signal Processing
JF - IEEE Transactions on Signal Processing
M1 - 9194083
ER -