Thinning is a standard technique to reduce the power consumption, hardware complexity, cost, and weight of large arrays [1][2]. However, array thinning does not allow a suitable control of the peak sidelobe level (PSL), as for filled arrays, with a reduction of the array performances [1][2]. In the literature, several techniques have been proposed for the design of thinned arrays with low sidelobes [1-][4]. In a chronological order, arrays were at first thinned by deterministic techniques, but no significant advantages on the PSL reduction have been obtained over random approaches [1]. Successively, stochastic optimization techniques have been widely and successfully applied [3][4]. However, such techniques present high computational costs when applied to large arrays, and they do not allow a-priori estimates of the expected performances for a given aperture size and thinning factor [2]. More recently, thinned arrays have been synthesized by exploiting the autocorrelation properties of binary sequences derived from Difference Sets (DSs) [2][5]. Such an approach has several advantages over traditional thinning techniques. It is computationally efficient and its performances are predictable [2]. However, DSs exist only for a limited subset of configurations, and their features cannot be exploited in a general way [2][5]. In order to apply the same strategy to a wider set of array configurations, sequences which are sub-optimal with respect to DSs can be considered. For instance, Almost Difference Sets (ADSs) [6] are good candidates for large array thinning, since they represent a generalization of DSs with several similar properties [6]. This paper is aimed at analyzing the applicability of ADSs to the design of thinned linear arrays, as well as the effectiveness of such an array synthesis technique in terms of beam-pattern features. Selected numerical results are provided to assess the performances of the proposed approach also in comparison with state-of-the-art thinning techniques with predictable PSL behaviour.

Array Thinning Through Binary Sequences / Oliveri, Giacomo; Massa, Andrea. - ELETTRONICO. - (2011).

Array Thinning Through Binary Sequences

Oliveri, Giacomo
Primo
;
Massa, Andrea
Ultimo
2011-01-01

Abstract

Thinning is a standard technique to reduce the power consumption, hardware complexity, cost, and weight of large arrays [1][2]. However, array thinning does not allow a suitable control of the peak sidelobe level (PSL), as for filled arrays, with a reduction of the array performances [1][2]. In the literature, several techniques have been proposed for the design of thinned arrays with low sidelobes [1-][4]. In a chronological order, arrays were at first thinned by deterministic techniques, but no significant advantages on the PSL reduction have been obtained over random approaches [1]. Successively, stochastic optimization techniques have been widely and successfully applied [3][4]. However, such techniques present high computational costs when applied to large arrays, and they do not allow a-priori estimates of the expected performances for a given aperture size and thinning factor [2]. More recently, thinned arrays have been synthesized by exploiting the autocorrelation properties of binary sequences derived from Difference Sets (DSs) [2][5]. Such an approach has several advantages over traditional thinning techniques. It is computationally efficient and its performances are predictable [2]. However, DSs exist only for a limited subset of configurations, and their features cannot be exploited in a general way [2][5]. In order to apply the same strategy to a wider set of array configurations, sequences which are sub-optimal with respect to DSs can be considered. For instance, Almost Difference Sets (ADSs) [6] are good candidates for large array thinning, since they represent a generalization of DSs with several similar properties [6]. This paper is aimed at analyzing the applicability of ADSs to the design of thinned linear arrays, as well as the effectiveness of such an array synthesis technique in terms of beam-pattern features. Selected numerical results are provided to assess the performances of the proposed approach also in comparison with state-of-the-art thinning techniques with predictable PSL behaviour.
2011
Trento
Università degli Studi di Trento, Dipartimento di Ingegneria e Scienza dell'Informazione
Array Thinning Through Binary Sequences / Oliveri, Giacomo; Massa, Andrea. - ELETTRONICO. - (2011).
Oliveri, Giacomo; Massa, Andrea
File in questo prodotto:
File Dimensione Formato  
DISI-11-194.C173.pdf

accesso aperto

Tipologia: Versione editoriale (Publisher’s layout)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 199.63 kB
Formato Adobe PDF
199.63 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11572/359413
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact