Accession Number:

AD0253612

Title:

ITERATIVE SWITCHING NETWORKS COMPOSED OF COMBINATIONAL CELLS

Descriptive Note:

Corporate Author:

MONTANA STATE COLL BOZEMAN

Personal Author(s):

Report Date:

1960-12-01

Pagination or Media Count:

1.0

Abstract:

An n-dimensional iterative switching network consists of a number of identical logic cells uniformly interconnected through discrete information channels along each of n axis directions in space. This paper antecedes a general treatment of such networks by focusing on the 1-dimensional case, or the case of a linear cellular array, where cells are combinational, the information channels between them are bilateral, and switching is done synchronously with unit delay through each cell. These constraints are justified by demonstrating the behavioral equivalences which exist between corresponding combinational-cell and sequential-cell networks. Three classes of networks are formed according to whether or not information flowing in one direction along the cellular array is dependent upon that flowing in the other direction. A synoptic discussion of Hennies steadystate analysis results is given for the three classes, and the relative merit and character of the class having mutually dependent information flow is discussed. The main part of the paper deals with this class as the only one which can exhibit stable-state memory properties, and proves several important theorems concerning these properties. A transposition of some of Hennies previous results is given as a start on the transients and cycling problems. Author

Subject Categories:

Distribution Statement:

APPROVED FOR PUBLIC RELEASE