ePrints

Algebra of switching networks

Lookup NU author(s): Dr Andrey Mokhov

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

A switch, mechanical or electrical, is a fundamental building element of digital systems. The theory of switching networks, or simply circuits, dates back to Shannon's thesis (1937), where he employed Boolean algebra for reasoning about the functionality of switching networks, and graph theory for describing and manipulating their structure. Following this classic approach, one can deduce functionality from a given structure via analysis, and create a structure implementing a specified functionality via synthesis. The use of two mathematical languages leads to a 'language barrier' - whenever a circuit description is changed in one language, it is necessary to translate the change into the other one to keep both descriptions synchronised. This work presents a unified algebra of switching networks. Its elements are circuits rather than just Boolean functions (as in Boolean algebra) or vertices/edges (as in graph theory). This approach allows one to express both the functionality and structure of switching networks in the same mathematical language and brings new methods of circuit composition for greater reuse of components and interfaces. In this paper we demonstrate how to use the algebra to formally transform circuits, reason about their properties, and even solve equations whose 'unknowns' are circuits.

Publication metadata

Author(s): Mokhov A

Publication type: Article

Publication status: Published

Journal: IET Computers & Digital Techniques

Year: 2015

Volume: 9

Issue: 4

Pages: 197-205

Print publication date: 01/07/2015

Acceptance date: 26/11/2014

ISSN (print): 1751-8601

ISSN (electronic): 1751-861X

Publisher: Institute of Engineering and Technology (IET)

URL: http://dx.doi.org/10.1049/iet-cdt.2014.0135

DOI: 10.1049/iet-cdt.2014.0135

Altmetrics

Funding

Share