DocumentCode :
1163562
Title :
Terminal Configurations of n-Port Networks
Author :
Lempel, Abraham ; Cederbaum, Israel
Volume :
15
Issue :
1
fYear :
1968
fDate :
3/1/1968 12:00:00 AM
Firstpage :
50
Lastpage :
53
Abstract :
In this paper, bounds on the number of port terminals for families of equivalent 
-port networks are discussed. Classes of -ports, for which no equivalents with less than 
terminals exist, are demonstrated. It is shown that upper bounds (less than 
) on the number of terminals also exist. These may not exceed, in certain cases, even the minimum number of 
terminals. Finally, some incomplete results on related problems are presented.
-port networks are discussed. Classes of -ports, for which no equivalents with less than terminals exist, are demonstrated. It is shown that upper bounds (less than ) on the number of terminals also exist. These may not exceed, in certain cases, even the minimum number of terminals. Finally, some incomplete results on related problems are presented.Keywords :
Terminal configurations; n-ports; Admittance; Circuit theory; Impedance; Network theory (graphs); Symmetric matrices; Tree graphs; Upper bound;
fLanguage :
English
Journal_Title :
Circuit Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9324
Type :
jour
DOI :
10.1109/TCT.1968.1082761
Filename :
1082761
Link To Document :
