Reactively Loaded Array Pattern Synthesis as a Quadratically Constrained Quadratic Program

• Published in: IEEE transactions on antennas and propagation Vol. 63; no. 11; pp. 5219 - 5224
• Main Author: Corcoles, Juan
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.11.2015; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Antenna arrays; Antenna pattern synthesis; Arrays; Gain; Loaded antennas; Optimization; optimization methods; Ports (Computers); quadratic programming; reconfigurable antennas; semidefinite programming; sidelobe supression; reconfigurable antennas; sidelobe supression; semidefinite (SD) programming; optimization methods; antenna pattern synthesis; quadratic programming; Antenna arrays
• ISSN: 0018-926X; 1558-2221
• DOI: 10.1109/TAP.2015.2478487

The pattern synthesis problem of maximizing the gain at a scanning direction subject to a maximum sidelobe level for a reactively loaded antenna array is formulated as a quadratically constrained quadratic program (QCQP). This formulation is derived from the scattering matrix and the active element patterns of the array considering both fed and loaded antennas as ports. Since the resulting QCQP is nonconvex, the loads are computed from the solution of the semidefinite relaxation of the problem by forcing the feasibility of the constraints in a meaningful physical sense, i.e., by explicitly imposing passive or purely reactive loads. Numerical results of dipole arrays with various configurations are presented and compared to previous works.