eprintid: 516
rev_number: 6
eprint_status: archive
userid: 5
dir: disk0/00/00/05/16
datestamp: 2011-07-04
lastmod: 2013-07-01 11:28:08
status_changed: 2013-07-01 11:28:08
type: techreport
metadata_visibility: show
item_issues_count: 0
creators_name: Rocca, Paolo
creators_name: Morabito, Andrea
creators_name: Isernia, Tommaso
creators_name: Massa, Andrea
title: Synthesis of Arbitrary Sidelobes Sum and Difference Patterns with Common Excitation Weights
ispublished: pub
subjects: TU
full_text_status: public
note: This version is a pre-print of the final version available at IEEE.
abstract: The synthesis of sum and difference patterns is a canonical problem widely dealt with by researchers working on antenna array synthesis. As a matter of fact, they are used as transmitting/receiving devices for search-and-track systems (e.g., monopulse radars [1]). In this framework, several procedures have been proposed to reduce the complexity of the beam forming network aimed at generating at least a couple of radiation patterns. Among them, the generation of an optimal sum pattern and a difference one has been carried out by means of a sub-arraying strategy [2,3]. The simplification of the hardware complexity has also been addressed by sharing some excitations for the sum and difference channels [4]. Recently, the synthesis of low-sidelobe sum and difference patterns with a common aperture has been carried out by perturbing the roots of the Bayliss distribution to match as much as possible a given Taylor distribution [5]. The discrete linear arrays have been successively obtained by sampling the resulting continuous apertures. In this work, the same array synthesis problem dealt with in [5] is addressed, and an innovative approach based on a deterministic optimization strategy is presented wherein the problem is formulated as the minimization of a linear function over a convex set. Taking advantage from the approaches proposed in [6] and [7] for the optimal synthesis of sum and difference patterns respectively, the proposed method allows one to synthesize patterns with arbitrary sidelobes (unlike [5]).
date: 2011-01
date_type: published
institution: University of Trento
department: informaticat
refereed: FALSE
referencetext: [1] M. I. Skolnik, Radar Handbook, 3rd ed. New York: McGraw-Hill, 2008. [2] D. A. McNamara, “Synthesis of sub-arrayed monopulse linear arrays through matching of independently optimum sum and difference excitations,” Proc. IEE Microw. Antennas Propag., vol. 135, no. 5, pp. 371–374, Oct. 1988. [3] L. Manica, P. Rocca, A. Martini, and A. Massa, “An innovative approach based on a tree-searching algorithm for the optimal matching of independently optimum sum and difference excitations,” IEEE Trans. Antennas Propag., vol. 56, no. 1, pp. 58–66, Jan. 2008. [4] T.S. Lee and T.-K. Tseng, “Subarray synthesized low side lobe sum and difference patterns with partial common weights,” IEEE Trans. Antennas Propag., vol. 41, no. 6, pp. 791-800, Jun. 1993. [5] M. Alvarez Folgueiras, J. A. Rodriguez Gonzalez, and F. Ares Pena, “Synthesising Taylor and Bayliss linear distributions with common aperture tail,” Electron. Lett., vol. 45, no. 11, pp. 18-19, Jan. 2009. [6] O. M. Bucci, L. Caccavale, and T. Isernia, “Optimal far field focusing of uniformly spaced arrays subject to arbitrary upper bounds in nontarget directions,” IEEE Trans. Antennas Propag., vol. 50, no. 11, pp. 1539-1554, Nov. 2002. [7] O. M. Bucci, M. D’Urso, and T. Isernia, “Optimal synthesis of difference patterns subject to arbitrary sidelobe bounds by using arbitrary array antennas,” Proc. IEE Microw. Antennas Propag., vol. 152, no. 3, pp. 129-137, Jun.2005.
citation:   Rocca, Paolo and Morabito, Andrea and Isernia, Tommaso and Massa, Andrea  (2011) Synthesis of Arbitrary Sidelobes Sum and Difference Patterns with Common Excitation Weights.  [Technical Report]     
document_url: http://www.eledia.org/students-reports/516/1/DISI-11-165.C202.pdf