TY  - THES
Y1  - 2015/09/25/
UR  - http://www.eledia.org/students-reports/711/
ID  - elediasc12711
TI  - Synthesis of Wideband Linear Arrays through Convex Programming

AV  - public
PB  - University of Trento
M1  - masters
A1  - Tingnan, B.
KW  - Convex Programming
KW  -  Array Synthesis
KW  -  Compressive Sensing.
N2  - In the last years the exploitation of Convex Programming (CP) has been proposed as a powerful tool to design optimal weighting sequences with arbitrary patterns. As a matter of fact, when the desired pattern features are expressed as power mask constraints, the determination of the weights of the array such that the upper and the lower bounds of the radiated pattern respect the constraints is a convex problem. As a consequence, effective tools can be used to find the optimum set of array weights, once the array geometry and the power pattern constraints are fixed.
This project is aimed to propose a CP-based strategy for the synthesis of wideband arrays, more and more frequently required for radar applications. Accordingly, the single-frequency pattern synthesis problem will be reformulated as a multi-frequency one, still exploiting the convex nature of the mask-constrained optimization problem.

ER  -