State Assignments for Asynchronous Sequential Machines

  • Authors:
  • Chung-Jen Tan

  • Affiliations:
  • -

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1971

Quantified Score

Hi-index 15.01

Visualization

Abstract

In this paper, a heuristic state assignment algorithm for asynchronous sequential machines is presented. Machines realized by this assignment scheme will result in circuits having a small amount of gate inputs and operating in single transition time. It is also shown that for a flow table having m1input columns, m input variables, and d stable states, the number of gate inputs required