Tractable Transmit MIMO Beampattern Design Under a Constant Modulus Constraint

• Published in: IEEE transactions on signal processing Vol. 65; no. 10; pp. 2588 - 2599
• Main Authors: Aldayel, Omar, Monga, Vishal, Rangaswamy, Muralidhar
• Format: Journal Article
• Language: English
• Published: New York IEEE 15.05.2017; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithm design and analysis; Broadband; constant modulus; Convergence; MIMO; MIMO (control systems); MIMO radar; Narrowband; Nonlinear programming; Radar; Radar antennas; SCF; Signal processing algorithms; successive algorithm; Tradeoffs; Wideband; wideband beampattern
• ISSN: 1053-587X; 1941-0476
• DOI: 10.1109/TSP.2017.2664040

Multiple-input multiple-output (MIMO) radar systems allow each antenna element to transmit a different waveform. This waveform diversity can be exploited to enhance the beampattern design, in particular, effective management of radar radiation power in directions of interest. We address the problem of designing a beampattern for MIMO radar, which in turn is determined by the transmit waveform. While unconstrained design is straightforward, a key open challenge is enforcing the constant modulus constraint on the radar waveform. It is well known that the problem of minimizing deviation of the designed beampattern from an idealized one subject to the constant modulus constraint constitutes a hard nonconvex problem. Existing methods that address constant modulus invariably lead to a stiff tradeoff between analytical tractability (achieved by relaxations and approximations) and realistic design that exactly achieves constant modulus but is computationally burdensome. A new approach is proposed in our paper, which involves solving a sequence of convex equality constrained quadratic programs, each of which has a closed form solution and such that constant modulus is achieved at convergence. We further prove that the converged solution satisfies the Karush-Kuhn-Tucker optimality conditions of the aforementioned hard nonconvex problem. We evaluate the proposed successive closed forms (SCF) algorithm against the state-of-the art MIMO beampattern design techniques in both narrowband and wideband setups and show that the SCF breaks the tradeoff between desirable performance and the associated computation cost.