๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the properties of directed switching networks

โœ Scribed by Min-You Wu; Shu-Park Chan

Publisher
John Wiley and Sons
Year
1987
Tongue
English
Weight
947 KB
Volume
17
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

โœฆ Synopsis

The theory of directed switching networks is developed. After the fundamental concepts are defined, the rank of the path matrix of a Directed Single-Contact (Di-SC) network is discussed. The theorem which gives the essential relationship between the SC and Di-SC networks is proved. Then the Odd-Addition-Subtraction (OAS) condition is given as a necessary condition for Di-SC functions. The analysis of directed switching networks and the synthesis of Di-SC 'networks are also given for practical applications. The results could be used in the design of electrical and computer systems with directed elements.

๐Ÿ“œ SIMILAR VOLUMES

On the construction of balanced switchin
On the construction of balanced switching networks
โœ F. K. Hwang; S. Lin ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 919 KB

## Abstract A balanced switching network is a multistage switching network where all channel graphs G(ฮฑ, ฮฒ) (the union of all paths from the input switch ฮฑ to the output switch ฮฒ) are isomorphic. In this paper we: (1) derive some necessary conditions for the existence of balanced switching networks

On the number of classes of (n,k) switch
On the number of classes of (n,k) switching networks
โœ Michael A. Harrison ๐Ÿ“‚ Article ๐Ÿ“… 1963 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 588 KB

An (n,k) switching network is defined as all n-input, k-output network such that associated with each output is a Boolean transmission function of the n-inputs. If we allow a group @ on the inputs and a group ~ on the outputs, then the family of networks is decomposed into equivalence classes. In th