A NEW THEORY FOR THE ANALYSIS, SYNTHESIS, CUTTING, AND SPLICING OF SEQUENTIAL SWITCHING NETWORKS.
ARMY ELECTRONICS COMMAND FORT MONMOUTH NJ
Pagination or Media Count:
The exponential proliferation of states in the analytical and synthetical procedures of classical switching theory imposes a pragmatic burden on the would be users that render its application difficult. This is particularly true in the treatment of problems associated with the debugging and testing of sequential switching networks. The theory presented subsumes classical switching theory. States are treated as state aggregates rather than as individual states. Theoretical tools and algorithms are presented which lead to the mechanistic determination of the minimal test procedures required for an arbitrary switching net. The primary tool developed towards this end is the SPIF which is an acronym for the Sequential Prime Implicant Ford. The switching theory of sequential nets with binary elements is reduced to the syntactical form of a Boolean algebra, reducing all problems of sequential theory of binary nets to equivalent problems in combination switching theory. A canonical form for sequential, iterative, and multi-inwayoutway combinational nets is presented. Algorithms for cutting nodes, splicing nodes, removing or introducing feedback loops, making state code transformations, and analyzing ambiguities are presented and applied to representative examples.
- Electrical and Electronic Equipment
- Statistics and Probability