?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.relation=http%3A%2F%2Fwww.eledia.org%2Fstudents-reports%2F450%2F&rft.title=Computationally-Effective+Optimal+Excitation+Matching+for+the+Synthesis+of+Large+Monopulse+Arrays&rft.creator=Manica%2C+Luca&rft.creator=Rocca%2C+Paolo&rft.creator=Martini%2C+Anna&rft.creator=Massa%2C+Andrea&rft.subject=TU+Technical+Reports+and+Publications&rft.description=Antenna+arrays+able+to+generate+two+different+patterns+are+widely+used+in+tracking+radar+systems+%5B1%5D.+Optimal+(in+the+Dolph-Chebyshev+sense)+sum+%5B2%5D+and+difference+patterns+%5B3%5D+can+be+generated+by+using+two+independent+feed+networks.+Unfortunately%2C+such+a+situation+generally+turns+out+to+be+impracticable+because+of+its+costs%2C+the+occupied+physical+space%2C+the+circuit+complexity%2C+and+electromagnetic+interferences.+Thus%2C+starting+from+the+optimal+sum+pattern+a+sub-optimal+solution+for+the+difference+pattern+is+usually+synthesized+by+means+of+the+sub-array+technique.+The+array+elements+are+grouped+in+sub-arrays+properly+weighted+for+matching+the+constrains+of+the+difference+beam.+Finding+the+best+elements+grouping+and+the+sub-array+weights+is+a+complex+and+challenging+research+topic%2C+especially+when+dealing+with+large+arrays.+As+far+as+linear+arrays+are+concerned%2C+McNamara+proposed+in+%5B4%5D+an+analytical+method+for+determining+the+%22best+compromise%22+difference+pattern.+Unfortunately%2C+when+the+ratio+between+the+elements+of+the+array+and+sub-arrays+increases%2C+such+a+technique+exhibits+several+limitations+mainly+due+to+the+ill-conditioning+of+the+problem+and+the+computational+costs+due+to+exhaustive+evaluations.+A+non-negligible+saving+might+be+achieved+by+applying+optimization+algorithms+(see+for+instance+%5B5%5D+and+%5B6%5D)+aimed+at+minimizing+a+suitable+cost+function.+Notwithstanding%2C+optimization-based+approaches+still+appear+computationally+expensive+when+dealing+with+large+arrays+because+of+wide+dimension+of+solution+space+to+be+sampled.+In+order+to+properly+deal+with+these+computational+issues%2C+this+contribution+presents+an+innovative+approach+based+on+an+optimal+excitation+matching+procedure.+By+exploiting+the+relationship+between+independently-optimal+sum+and+difference+patterns%2C+the+dimension+of+the+solution+space+is+considerably+reduced+and+efficiently+sampled+by+taking+into+account+the+presence+of+array+elements+more+suitable+to+change+sub-array+membership.+In+the+following%2C+the+proposed+technique+is+described+pointing+out%2C+through+a+representative+case%2C+its+potentialities+and+effectiveness+in+dealing+with+large+arrays.+This+is+the+author's+version+of+the+final+version+available+at+IEEE.&rft.date=2011-01&rft.type=Technical+Report&rft.type=NonPeerReviewed&rft.format=application%2Fpdf&rft.language=en&rft.identifier=http%3A%2F%2Fwww.eledia.org%2Fstudents-reports%2F450%2F1%2FDISI-11-227.C138.pdf&rft.identifier=++Manica%2C+Luca+and+Rocca%2C+Paolo+and+Martini%2C+Anna+and+Massa%2C+Andrea++(2011)+Computationally-Effective+Optimal+Excitation+Matching+for+the+Synthesis+of+Large+Monopulse+Arrays.++%5BTechnical+Report%5D+++++