TY - JOUR
T1 - Spectrally Compatible MIMO Radar Beampattern Design under Constant Modulus Constraints
AU - Alhujaili, Khaled
AU - Yu, Xianxiang
AU - Cui, Guolong
AU - Monga, Vishal
N1 - Publisher Copyright:
© 1965-2011 IEEE.
PY - 2020/12
Y1 - 2020/12
N2 - In this article, we propose a new algorithm that designs a transmit beampattern for multiple-input multiple-output (MIMO) radar considering coexistence with other wireless systems. This design process is conducted by minimizing the deviation of the generated beampattern (which in turn is a function of the transmit waveform) against an idealized one while enforcing the waveform elements to be constant modulus and in the presence of spectral restrictions. This leads to a hard nonconvex optimization problem primarily due to the presence of the constant modulus constraint (CMC). In this article, we exploit the geometrical structure of CMC, i.e., we redefine this constraint as an intersection of two sets (one convex and other nonconvex). This new perspective allows us to solve the nonconvex design problem via a tractable method called iterative beampattern with spectral design (IBS). In particular, the proposed IBS algorithm develops and solves a sequence of convex problems such that constant modulus is achieved at convergence. Crucially, we show that at convergence the obtained solution satisfies the Karush-Kuhn-Tucker conditions of the aforementioned nonconvex problem. Finally, we evaluate the proposed algorithm over challenging simulated scenarios, and show that it outperforms the state-of-the-art competing methods.
AB - In this article, we propose a new algorithm that designs a transmit beampattern for multiple-input multiple-output (MIMO) radar considering coexistence with other wireless systems. This design process is conducted by minimizing the deviation of the generated beampattern (which in turn is a function of the transmit waveform) against an idealized one while enforcing the waveform elements to be constant modulus and in the presence of spectral restrictions. This leads to a hard nonconvex optimization problem primarily due to the presence of the constant modulus constraint (CMC). In this article, we exploit the geometrical structure of CMC, i.e., we redefine this constraint as an intersection of two sets (one convex and other nonconvex). This new perspective allows us to solve the nonconvex design problem via a tractable method called iterative beampattern with spectral design (IBS). In particular, the proposed IBS algorithm develops and solves a sequence of convex problems such that constant modulus is achieved at convergence. Crucially, we show that at convergence the obtained solution satisfies the Karush-Kuhn-Tucker conditions of the aforementioned nonconvex problem. Finally, we evaluate the proposed algorithm over challenging simulated scenarios, and show that it outperforms the state-of-the-art competing methods.
UR - http://www.scopus.com/inward/record.url?scp=85097824014&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85097824014&partnerID=8YFLogxK
U2 - 10.1109/TAES.2020.3003976
DO - 10.1109/TAES.2020.3003976
M3 - Article
AN - SCOPUS:85097824014
SN - 0018-9251
VL - 56
SP - 4749
EP - 4766
JO - IEEE Transactions on Aerospace and Electronic Systems
JF - IEEE Transactions on Aerospace and Electronic Systems
IS - 6
M1 - 9122033
ER -