A PROCEDURE FOR SYNTHESIS OF SWITCHING NETWORKS.

reportActive / Technical Report | Accession Number: AD0618333 | Need Help?

Abstract:

A procedure is described which yields a realization of a sequential machine as any asynchronous switching network. The basic idea is to perform an operation on the flow table which corresponds to opening a feedback loop of some realization. Repetition of such operations leads to the specification of a combinational network which is considered to be a solution to the problem. In addition to being iterative, the procedure is capable to being implemented on a digital computer. Necessary and sufficient conditions for the existence of asynchronous cascade and parallel realizations are given and methods of obtaining such realizations are explored. It is shown that the steady state behaviour of a sequential machine is useful in this regard. Author

Author(s):
Mckellar, Archie Charles
Author Organization(s):
ILLINOIS UNIV URBANA COORDINATED SCIENCE LAB
Descriptive Note:
Doctoral thesis,
Annotation:
Synthesis of switching networks.
Pagination:
0047

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
R-253
Contract/Grant Number(s):
DA-28-043-AMC-00073(E), NSF-GK-36
 Subject Terms
Joint Capability Areas:
JCA_6.1.3_Switching and Routing; JCA_6.1_Information Transport; JCA_6_Net Centric
Communities of Interest:
No COI(s) Identified
Descriptor(s):
*SWITCHING CIRCUITS, SYNTHESIS, SEQUENCE SWITCHES, FEEDBACK, ITERATIONS, INFORMATION THEORY
Report Date:
1965 May 01