eprintid: 479
rev_number: 6
eprint_status: archive
userid: 5
dir: disk0/00/00/04/79
datestamp: 2011-03-25
lastmod: 2013-07-01 11:06:07
status_changed: 2013-07-01 11:06:07
type: techreport
metadata_visibility: show
item_issues_count: 0
creators_name: Rocca, Paolo
creators_name: Manica, Luca
creators_name: Martini, Anna
creators_name: Massa, Andrea
title: Synthesis of Large Monopulse Linear Arrays Though a Tree-Based Optimal Excitations Matching
ispublished: pub
subjects: TU
full_text_status: public
keywords: Large linear arrays , monopulse antennas , sum and difference pattern synthesis , tree-searching algorithm
abstract: In this letter, the synthesis of large arrays for monopulse tracking applications is addressed by means of a simple and effective subarraying technique. Towards this purpose, the synthesis problem is recast as the search of an optimal path in a noncomplete binary tree by exploiting some relationships between independently optimal sum and difference excitations. Because of a suitable reduction of the solution space and the implementation of a fast path-searching algorithm, the computational issues arising in dealing with large array aperture are properly addressed. Some numerical experiments are provided in order to assess the feasibility and the computational effectiveness of the tree-based approach. (c) 2007 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: 2007-01
date_type: published
institution: University of Trento
department: informaticat
refereed: TRUE
referencetext: [1] R. L. Haupt, "Optimized weighting of uniform subarrays of unequal size," IEEE Trans.Antennas Propagat., vol. 55, no. 4, pp. 1207-1210, Apr. 2007.
[2] D. A. McNamara, "Synthesis of sub-arrayed monopulse linear arrays through matchingof independently optimum sum and difference excitations," IEE Proc. H , vol. 135, no.5, pp. 371-374, Oct. 1988.
[3] F. Ares, S. R. Rengarajan, J. A. Rodriguez, and E. Moreno, "Optimal Compromiseamong sum and difference patterns through sub-arraying," Proc. IEEE AntennasPropagat. Symp., pp. 1142-1145, Jul. 1996.
[4] P. Lopez, J. A. Rodriguez, F. Ares, and E. Moreno, "Subarray weighting for differencepatterns of monopulse antennas: Joint optimization of subarray Configurations andweights," IEEE Trans. Antennas Propagat ., vol. 49, no. 11, pp. 1606-1608, Nov. 2001.
[5] S. Caorsi, A. Massa, M. Pastorino, and A. Randazzo, "Optimization of the differencepatterns for monopulse antennas by a hybrid real/integer-coded differential evolutionmethod," IEEE Trans. Antennas Propagat., vol. 53, no. 1, pp. 372-376, Jan. 2005.
[6] C. L. Dolph, "A Current distribution for broadside arrays which optimises the rela-tionship between beam width and sidelobe level," Proc. IRE , vol. 34, pp. 335-348,1946.
[7] D. A. McNamara, "Discrete n-distributions for difference patterns," Electron. Lett.,vol. 22, no. 6, pp. 303-304, Jun. 1986.
[8] D. A. McNamara, "Direct synthesis of optimum difference patterns for discrete lineararrays using Zolotarev distribution," IEE Proc. H , vol. 140, no. 6, pp 445-450, Dec.1993.
citation:   Rocca, Paolo and Manica, Luca and Martini, Anna and Massa, Andrea  (2007) Synthesis of Large Monopulse Linear Arrays Though a Tree-Based Optimal Excitations Matching.  [Technical Report]     
document_url: http://www.eledia.org/students-reports/479/1/DISI-11-059.pdf