?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.relation=http%3A%2F%2Fwww.eledia.org%2Fstudents-reports%2F479%2F&rft.title=Synthesis+of+Large+Monopulse+Linear+Arrays+Though+a+Tree-Based+Optimal+Excitations+Matching&rft.creator=Rocca%2C+Paolo&rft.creator=Manica%2C+Luca&rft.creator=Martini%2C+Anna&rft.creator=Massa%2C+Andrea&rft.subject=TU+Technical+Reports+and+Publications&rft.description=In+this+letter%2C+the+synthesis+of+large+arrays+for+monopulse+tracking+applications+is+addressed+by+means+of+a+simple+and+effective+subarraying+technique.+Towards+this+purpose%2C+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%2C+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%2C+including+reprinting%2F+republishing+this+material+for+advertising+or+promotional+purposes%2C+creating+new+collective+works+for+resale+or+redistribution+to+servers+or+lists%2C+or+reuse+of+any+copyrighted+components+of+this+work+in+other+works.&rft.date=2007-01&rft.type=Technical+Report&rft.type=PeerReviewed&rft.format=text&rft.language=en&rft.identifier=http%3A%2F%2Fwww.eledia.org%2Fstudents-reports%2F479%2F1%2FDISI-11-059.pdf&rft.identifier=++Rocca%2C+Paolo+and+Manica%2C+Luca+and+Martini%2C+Anna+and+Massa%2C+Andrea++(2007)+Synthesis+of+Large+Monopulse+Linear+Arrays+Though+a+Tree-Based+Optimal+Excitations+Matching.++%5BTechnical+Report%5D+++++