eprintid: 468
rev_number: 4
eprint_status: archive
userid: 5
dir: disk0/00/00/04/68
datestamp: 2011-03-25
lastmod: 2013-07-01 09:35:08
status_changed: 2013-07-01 09:35:08
type: techreport
metadata_visibility: show
item_issues_count: 0
creators_name: Manica, Luca
creators_name: Rocca, Paolo
creators_name: Benedetti, Manuel
creators_name: Massa, Andrea
title: A Fast Graph-Searching Algorithm Enabling the Efficient Synthesis of Sub-Arrayed Planar Monopulse Antennas
ispublished: pub
subjects: TU
full_text_status: public
keywords: Planar Arrays, Monopulse Antennas, Sum and Difference Modes, Direct Acyclic Graph
abstract: In this paper, an innovative approach in its different implementations for the synthesis of compromise sum and difference patterns of monopulse planar arrays is presented. The synthesis method is based on a sub-arraying technique aimed at generating the compromise patterns through an optimal excitation matching procedure. By exploiting some properties of the solution space, the synthesis problem is reformulated as a combinatorial one to allow a considerable saving of computational resources. Thanks to a graph-based representation of the solution space, the use of an efficient path-searching algorithm is enabled to speed-up the convergence to the compromise solution. In the numerical validation, a set of representative examples concerned with both pattern matching problems and patternfeature optimization are reported in order to assess the effectiveness and flexibility of the proposed approach. Comparisons with previously published results and solutions obtained by a hybrid version of the approach customized to deal with the optimization of the sidelobe level (SLL) are reported and discussed, as well. (c) 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
date: 2009-03
date_type: published
institution: University of Trento
department: informaticat
refereed: TRUE
referencetext: [1] I. M. Skolnik, Radar Handbook. McGraw-Hill, 1990. [2] P. W. Hannan, “Optimum Feeds for All Three Modes of a Monopulse Antenna I: Theory,” IRE Trans. Antennas Propagat., vol. 9, no. 5, pp. 444-454, Sept. 1961. [3] T. T. Taylor, “Design of a circular aperture for narrow beamwidth and low sidelobes,” IRE Trans. Antennas Propagat., vol. AP-8, pp. 17-22, 1960. [4] E. T. Bayliss, “Design of monopulse antenna difference patterns with low sidelobes,” Bell System Tech. Journal, vol. 47, pp. 623-640, 1968. [5] D. A.McNamara, “Synthesis of sub-arrayed monopulse linear arrays through matching of independently optimum sum and difference excitations,” IEE Proc. H Microwave Antennas Propagat., vol. 135, no. 5, pp. 371-374, 1988. [6] P. Lopez, J. A. Rodriguez, F. Ares, and E.Moreno, “Subarray weighting for difference patterns of monopulse antennas: joint optimization of subarray configurations and weights,” IEEE Trans. Antennas Propagat., vol. 49, no. 11, pp. 1606-1608, 2001. [7] S. Caorsi, A. Massa, M. Pastorino, and A. Randazzo, “Optimization of the difference patterns for monopulse antennas by a hybrid real/integer-coded differential evolution method,” IEEE Trans. Antennas Propagat., vol. 53, no. 1, pp. 372-376, 2005. [8] Y. Chen, S. Yang, and Z. Nie, “The application of a modified differential evolution strategy to some array pattern synthesis problems,” IEEE Trans. Antennas Propagat., vol. 56, no. 7, pp. 1919-1927, Jul. 2008. [9] F. Ares, J. A. Rodriguez, E. Moreno, and S. R. Rengarajan, “Optimal compromise among sum and difference patterns,” J. Electromag. Waves Appl., vol. 10, pp. 1543-1555, 1996. [10] M. D’Urso, T. Isernia, and E. T. Meliadò, “An Effective Hybrid Approach for the Optimal Synthesis of Monopulse Antennas, ” IEEE Trans. Antennas Propagat., vol. 55, no. 4, pp. 1059-1066, Apr. 2007. [11] 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 Propagat., vol. 56, no. 1, pp. 58-66, Jan. 2008. [12] P. Rocca, L. Manica, A. Martini, and A. Massa, “Synthesis of large monopulse linear arrays through a tree-based optimal excitations matching,” IEEE Antennas Wireless Propagat. Lett., vol. 6, pp. 436-439, 2007. [13] D. B. West, Introduction to Graph Theory. Englewood Cliffs, NJ: Prentice-Hall, 2000. [14] L. Manica, P. Rocca, and A. Massa, “Synthesis of sub-arrayed monopulse planar arrays by means of an innovative excitation matching method” Proc. 2007 IEEE Radar Conf., Roma, Italy, May 26-29, 2008. [15] P. Rocca, L. Manica, and A. Massa, “An effective matching method for the synthesis of optimal compromise between sum and difference patterns in planar arrays,” Progress in Electromagnetics Research B, PIER-B 3, pp. 115-130, 2008. [16] L.Manica, P. Rocca, and A.Massa, “On the synthesis of sub-arrayed planar array antennas for tracking radar applications,” IEEE Antennas Wireless Propagat. Lett., 2008. In press. [17] R. E. Hodges and Y. Rahmat-Samii, “On sampling contiguous aperture distributions for discrete planar arrays,” IEEE Trans. Antennas Propagat., vol. 44, no. 11, pp 1499-1508, Nov. 1996. [18] W. D. Fisher, “On grouping for maximum homogeneity,” American Statistical Journal, 789-798, 1958. [19] P. Rocca, L. Manica, A. Martini, and A. Massa, “Computationally-effective optimal excitation matching for the synthesis of large monopulse arrays,” Proc. 2007 IEEE AP-S International Symp., Honolulu, Hawaii, USA, pp. 3153-3156, June 10-15, 2007. [20] R. S. Elliott, Antenna Theory and Design. Wiley-Interscience IEEE Press, 2003. [21] P. Rocca, L. Manica, and A. Massa, “Synthesis of monopulse antennas through iterative contiguous partition method,” Electron. Lett., vol. 43, no. 16, pp. 854-856, Aug. 2007. [22] O. Bucci, M. D’Urso, and T. Isernia, “Optimal synthesis of difference patterns subject to arbitrary sidelobe bounds by using arbitrary array antennas,” IEE Proc. Microwaves Antennas Propagat., vol. 152, no. 3, pp. 129-137, Jun. 2005. [23] P. Rocca, L.Manica, and A.Massa, "Hybrid approach for sub-arrayed monopulse antenna synthesis," Electron. Lett., vol. 44, no. 2, pp. 75-76, Jan. 2008.
citation:   Manica, Luca and Rocca, Paolo and Benedetti, Manuel and Massa, Andrea  (2009) A Fast Graph-Searching Algorithm Enabling the Efficient Synthesis of Sub-Arrayed Planar Monopulse Antennas.  [Technical Report]     
document_url: http://www.eledia.org/students-reports/468/1/DISI-11-033.R164.pdf