DocumentCode
1203713
Title
Synthesis of Radio-Communication Nets
Author
Yau, S.S.
Volume
9
Issue
1
fYear
1962
fDate
3/1/1962 12:00:00 AM
Firstpage
62
Lastpage
68
Abstract
A radio-communication net is a communication network in which links between stations have unlimited capacity to transmit information. Such a network can be represented by a graph with weights on the vertices which correspond to the capacities of individual stations. The capacity of a radio-communication net of
stations is described by a matrix of order
called a terminalcapacity matrix. A necessary and sufficient condition for a matrix to be realizable as the terminal-capacity matrix of a radio-communication net is found. A simple algorithm for synthesizing a radio-communication net of a given terminal-capacity matrix, which is proved to have minimum sum of vertex capacities and minimum number of branches, is obtained. A theorem concerning all possible structures of a radio-communication net with the same terminal-capacity matrix is established.
stations is described by a matrix of order
called a terminalcapacity matrix. A necessary and sufficient condition for a matrix to be realizable as the terminal-capacity matrix of a radio-communication net is found. A simple algorithm for synthesizing a radio-communication net of a given terminal-capacity matrix, which is proved to have minimum sum of vertex capacities and minimum number of branches, is obtained. A theorem concerning all possible structures of a radio-communication net with the same terminal-capacity matrix is established.Keywords
Circuit synthesis; Circuit theory; Communication networks; Communication systems; Couplings; Graph theory; Helium; Network synthesis; Sufficient conditions; Symmetric matrices;
fLanguage
English
Journal_Title
Circuit Theory, IRE Transactions on
Publisher
ieee
ISSN
0096-2007
Type
jour
DOI
10.1109/TCT.1962.1086861
Filename
1086861
Link To Document