TRANSIENT BEHAVIOR IN ITERATIVE COMBINATIONAL SWITCHING NETWORKS

Abstract

Switching networks are discussed which consist of n identical combinational logic cells interconnected from left to right by alpha communication channels into linear arrays. The synchronous cells in these networks have unit switching delays sepaating their receipts of external x and left-neighbor alpha inputs from their corresponding productions of external z and right-neighbor alpha outputs. Three basic types of alpha transient behavior are discussed for such networks. In all three cases, necessary and sufficient conditions are given of the type of alpha logic allowed. These conditions are expressed in terms of corresponding alpha state graph structure. The main results hinge on certain properties of a new type of state sugraph, and on an indirect application of permutation groups to the state-pair transition problem. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1961
Accession Number
AD0271612

Entities

People

  • W.l. Kilmer

Tags

DTIC Thesaurus Topics

  • Arrays
  • Communication Channels
  • Linear Arrays
  • Permutations
  • Production
  • Switching

Readers

  • Analytical Mechanics
  • Mathematical Modeling and Probability Theory.