### 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 n stations is described by a matrix of order n called a terminal-capacity 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.

Original language | English (US) |
---|---|

Pages (from-to) | 62-68 |

Number of pages | 7 |

Journal | IRE Transactions on Circuit Theory |

Volume | 9 |

Issue number | 1 |

DOIs | |

State | Published - 1962 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Electrical and Electronic Engineering

### Cite this

*IRE Transactions on Circuit Theory*,

*9*(1), 62-68. https://doi.org/10.1109/TCT.1962.1086861

**Synthesis of Radio-Communication Nets.** / Yau, Sik-Sang; Yau, S. S.

Research output: Contribution to journal › Article

*IRE Transactions on Circuit Theory*, vol. 9, no. 1, pp. 62-68. https://doi.org/10.1109/TCT.1962.1086861

}

TY - JOUR

T1 - Synthesis of Radio-Communication Nets

AU - Yau, Sik-Sang

AU - Yau, S. S.

PY - 1962

Y1 - 1962

N2 - 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 n stations is described by a matrix of order n called a terminal-capacity 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.

AB - 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 n stations is described by a matrix of order n called a terminal-capacity 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.

UR - http://www.scopus.com/inward/record.url?scp=84937656896&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84937656896&partnerID=8YFLogxK

U2 - 10.1109/TCT.1962.1086861

DO - 10.1109/TCT.1962.1086861

M3 - Article

AN - SCOPUS:84937656896

VL - 9

SP - 62

EP - 68

JO - IRE Transactions on Circuit Theory

JF - IRE Transactions on Circuit Theory

SN - 0096-2007

IS - 1

ER -