Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/8964
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSekhon, Harjinder Singh-
dc.date.accessioned2014-11-18T07:04:32Z-
dc.date.available2014-11-18T07:04:32Z-
dc.date.issued1968-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/8964-
dc.guideSingh, Harpreet-
dc.description.abstractSeveral attempts have been made recently to utilize state variable technique for the network analysis and synthesis. This thesis is concerned t. with the synthesis problem. In particular; a genera- lized state model for n-port RLC networks including the topology of the sources is derived ° This genera-- lized model for synthesis is restricted to a special case of half degenerate N-port RLC networks in which there is no coupling between the resistance links and conductances tree branches for the normal tree. A synthesis procedure is evolved for this class of networks. The basic idea Is to decompose the and B matrices of the state-model X = AX + BU U, = PK ± QU in the form A = AA1 and B -- A B1 . Matrix gives the element values of the reactances and Al , B1 r P and Q give the topology of the network and values of the resistances. Certain suggestions along with critical discussion are given for further work in order to extend the results obtained in this thesis to more general networks• It is hoped that further work in this direction will lead to more generalen_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.title"NETWORK SYNTHESIS USING STATE VARIABLE TECHNIQUE"en_US
dc.typeM.Tech Dessertationen_US
dc.accession.number105288en_US
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECD105288.pdf2.08 MBAdobe PDFView/Open


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