Weighted Thinned Arrays by Almost Difference Sets and Convex Programming

Depau, V. (2012) Weighted Thinned Arrays by Almost Difference Sets and Convex Programming. Masters thesis, University of Trento.

Preview

Text Abstract.A295.pdf Download (102kB) | Preview

Abstract

The design of thinned arrays can be carried out with several techniques, including optimization approaches (GA, SA, PSO) as well as analytical methods. In this framework, uniformly weighted synthesis are usually considered in order to simplify the synthesis problem (due to the reduced number of degrees of freedom). However, hybrid techniques aimed at selecting both the thinning scheme as well as the optimal tapering are currently investigated due to the higher achievable performances. Recently, the exploitation of Convex Programming has been proposed as a powerful tool to design optimal weighting sequences with arbitrary patterns. Accordingly, joining a sub-optimal thinning scheme, such as Almost Difference Sets (ADS), with such an approach could yield optimal pattern control performances as well as simple architectures in terms of feeding network complexity and overall weight. As a consequences, the objective of the activity will be that of analyzing the performances of a hybrid Convex Programming-ADS methodology when dealing with linear arrays.

Actions (login required)

View Item