In this communication, a very simple and extremely fast algorithm is proposed for the pencil beam synthesis of linear sparse arrays having uniform distribution of the excitations. The key idea is that of selecting, as a desired pattern, a Gaussian function having small standard deviation, so as to obtain a narrow beam. This immediately provides the excitation density of the corresponding continuous array of infinite length. Starting from this result and considering a linear array of length L with N elements having equal excitations, an extremely fast and accurate algorithm based on a density tapering approach is proposed that yields suitable positions of the elements, in such a way as to provide an array factor that well approximates the desired pattern. Numerical examples are presented to show the effectiveness of the developed procedure, also when compared with state-of-the-art algorithms. The proposed approach does not consider the mutual coupling between the array elements, but it is numerically shown that this effect produces quite acceptable degradation on the synthesized patterns. Finally, it is shown that also problems involving thousands of elements can be solved in a very accurate way in few milliseconds.
Density Tapering of Linear Arrays Radiating Pencil Beams: A New Extremely Fast Gaussian Approach
Buttazzoni, Giulia;Vescovo, Roberto
2017-01-01
Abstract
In this communication, a very simple and extremely fast algorithm is proposed for the pencil beam synthesis of linear sparse arrays having uniform distribution of the excitations. The key idea is that of selecting, as a desired pattern, a Gaussian function having small standard deviation, so as to obtain a narrow beam. This immediately provides the excitation density of the corresponding continuous array of infinite length. Starting from this result and considering a linear array of length L with N elements having equal excitations, an extremely fast and accurate algorithm based on a density tapering approach is proposed that yields suitable positions of the elements, in such a way as to provide an array factor that well approximates the desired pattern. Numerical examples are presented to show the effectiveness of the developed procedure, also when compared with state-of-the-art algorithms. The proposed approach does not consider the mutual coupling between the array elements, but it is numerically shown that this effect produces quite acceptable degradation on the synthesized patterns. Finally, it is shown that also problems involving thousands of elements can be solved in a very accurate way in few milliseconds.File | Dimensione | Formato | |
---|---|---|---|
08080225.pdf
Accesso chiuso
Descrizione: Articolo
Tipologia:
Documento in Versione Editoriale
Licenza:
Copyright Editore
Dimensione
811.22 kB
Formato
Adobe PDF
|
811.22 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
2914860_08080225-PostPrint.pdf
accesso aperto
Descrizione: PostPrint VQR3
Tipologia:
Bozza finale post-referaggio (post-print)
Licenza:
Digital Rights Management non definito
Dimensione
1.43 MB
Formato
Adobe PDF
|
1.43 MB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.