DocumentCode
1163304
Title
Algorithms to Realize Directed Communication Nets
Author
Frisch, I.T. ; Sen, D.K.
Volume
14
Issue
4
fYear
1967
fDate
12/1/1967 12:00:00 AM
Firstpage
370
Lastpage
379
Abstract
Necessary and sufficient conditions are formulated for a real square unsymmetric matrix R to be the terminal capacity matrix of a directed communication net. These conditions lead to a practical set of realizability tests and are used to derive easily tested sufficient conditions for realizability. The sufficient conditions include several previously known realizability conditions as special cases and answer some hitherto unsolved problems concerning the range of applicability of a number of realization schemes.
Keywords
Algorithms for realization; Communication networks, directed; Flow networks; Graph-theoretic realization procedures; Realization algorithms; Computer networks; Graph theory; H infinity control; Laboratories; Operations research; Sufficient conditions; Telephony; Testing;
fLanguage
English
Journal_Title
Circuit Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9324
Type
jour
DOI
10.1109/TCT.1967.1082735
Filename
1082735
Link To Document