By Topic

Sketch for an Algebra of Switchable Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

A network containing switches is equivalent to a number of networks that differ in the values of their components, in the arrangement of the components, or in both respects. When analyzing or synthesizing such a network, one may treat each different network by itself, and then combine the results. This paper describes a method by which the different aspects of a switchable network may be treated simultaneously. The mathematics by which the network is treated is a combination of ordinary field algebra (complex numbers) and Boolean algebra. The mathematical foundation is first laid out, then interpreted in terms of switchable network elements. The paper is concluded with some examples of analysis and synthesis of switchable networks.

Published in:

Proceedings of the IRE  (Volume:41 ,  Issue: 7 )