Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/8925
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKrishnamacharyulu, N. C. V.-
dc.date.accessioned2014-11-18T06:31:25Z-
dc.date.available2014-11-18T06:31:25Z-
dc.date.issued1967-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/8925-
dc.guideAgarwal, A. K.-
dc.description.abstractIn recent years noon- uniformly spaced antenna arrays have received great att ent i-)n c-s witnessed by d large amount of publication in this areas The main int" erest seems to be in seeking a way to reduce the number of elements, or P equivalently, seeking a way to broaden the bandwidth and the scanning range of the array The work in this field has been started since 1960y but no rigorous theory has been developed yet,. The work so far done in the field is reviewed in Chapter II. Dynamic programming is studied in Chapter III and IV as an optimizing technique in synthesizing unequally spaced asymmetrical linear arrays. The criterion of optimization is to find an : element combination which has the highest sidelobe level over a specified angular interval less than the highest sidelobo of any other comb inat i. n. A 25 elem•ont array is synthesized with aperture length 5O• and spacing quantization " /2,. The synthesis technique is given in Chapter V Tito results obtained are quite encouraging. The calculations were performeden_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectDESIGN-ANTENNAen_US
dc.subjectNON-UNIFORMLY SPACEDen_US
dc.subjectANTENNA ARRAYSen_US
dc.titleDESIGN OF NON-UNIFORMLY SPACED ANTENNA ARRAYSen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number65047en_US
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECD65047.pdf4.98 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.