Signal-Flow Graph Network Analysis

dc.contributor.author	Dostal, T.
dc.contributor.author	Mikula, J.
dc.coverage.issue	1	cs
dc.coverage.volume	1	cs
dc.date.accessioned	2016-05-09T10:47:02Z
dc.date.available	2016-05-09T10:47:02Z
dc.date.issued	1992-10	cs
dc.description.abstract	A novel type of signal-flow graph is presented creating minimum number of nodes for independent voltages only. The graph will be derived by inspection of the network using special transforming T-graphs. The method is useful for the analysis of medium-size active and switched networks.	en
dc.format	text	cs
dc.format.extent	14-20	cs
dc.format.mimetype	application/pdf	en
dc.identifier.citation	Radioengineering. 1992, vol. 1, č. 1, s. 14-20. ISSN 1210-2512	cs
dc.identifier.issn	1210-2512
dc.identifier.uri	http://hdl.handle.net/11012/58631
dc.language.iso	en	cs
dc.publisher	Společnost pro radioelektronické inženýrství	cs
dc.relation.ispartof	Radioengineering	cs
dc.relation.uri	http://www.radioeng.cz/fulltexts/1992/92_01_03.pdf	cs
dc.rights	Creative Commons Attribution 3.0 Unported License	en
dc.rights.access	openAccess	en
dc.rights.uri	http://creativecommons.org/licenses/by/3.0/	en
dc.subject	networks	en
dc.subject	circuit theory	en
dc.subject	graph theory	en
dc.title	Signal-Flow Graph Network Analysis	en
dc.type.driver	article	en
dc.type.status	Peer-reviewed	en
dc.type.version	publishedVersion	en
eprints.affiliatedInstitution.faculty	Fakulta eletrotechniky a komunikačních technologií	cs

Now showing 1 - 1 of 1