TY - JOUR
T1 - Successive QCQP Refinement for MIMO Radar Waveform Design under Practical Constraints
AU - Aldayel, Omar
AU - Monga, Vishal
AU - Rangaswamy, Muralidhar
N1 - Publisher Copyright:
© 1991-2012 IEEE.
PY - 2016/7/15
Y1 - 2016/7/15
N2 - The authors address the problem of designing a waveform for multiple-input multiple-output (MIMO) radar under the important practical constraints of constant modulus and waveform similarity. Incorporating these constraints in an analytically tractable manner is a longstanding open challenge. This is due to the fact that the optimization problem that results from signal-To-interference-plus-noise ratio (SINR) maximization subject to these constraints is a hard non-convex problem. The authors develop a new analytical approach that involves solving a sequence of convex quadratically constrained quadratic programing (QCQP) problems, which they prove converges to a sub-optimal solution. Because an improvement in SINR results via solving each problem in the sequence, they call the method Successive QCQP Refinement (SQR). Furthermore, the proposed SQR method can be easily extended to incorporate emerging requirements of spectral coexistence, as shown briefly in this paper. The authors evaluate SQR against other candidate techniques with respect to SINR performance, beam pattern, and pulse compression properties in a variety of scenarios. Results show that SQR outperforms state-of-The-Art methods that also employ constant modulus and/or similarity constraints while being computationally less burdensome.
AB - The authors address the problem of designing a waveform for multiple-input multiple-output (MIMO) radar under the important practical constraints of constant modulus and waveform similarity. Incorporating these constraints in an analytically tractable manner is a longstanding open challenge. This is due to the fact that the optimization problem that results from signal-To-interference-plus-noise ratio (SINR) maximization subject to these constraints is a hard non-convex problem. The authors develop a new analytical approach that involves solving a sequence of convex quadratically constrained quadratic programing (QCQP) problems, which they prove converges to a sub-optimal solution. Because an improvement in SINR results via solving each problem in the sequence, they call the method Successive QCQP Refinement (SQR). Furthermore, the proposed SQR method can be easily extended to incorporate emerging requirements of spectral coexistence, as shown briefly in this paper. The authors evaluate SQR against other candidate techniques with respect to SINR performance, beam pattern, and pulse compression properties in a variety of scenarios. Results show that SQR outperforms state-of-The-Art methods that also employ constant modulus and/or similarity constraints while being computationally less burdensome.
UR - http://www.scopus.com/inward/record.url?scp=84974621057&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84974621057&partnerID=8YFLogxK
U2 - 10.1109/TSP.2016.2552501
DO - 10.1109/TSP.2016.2552501
M3 - Article
AN - SCOPUS:84974621057
SN - 1053-587X
VL - 64
SP - 3760
EP - 3774
JO - IEEE Transactions on Signal Processing
JF - IEEE Transactions on Signal Processing
IS - 14
M1 - 7450660
ER -