By Topic

The Realization of Polylinear Sequential Circuits Using Flip-Flop Memory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

In this paper there are developed simple processes for deriving, for finite synchronous sequential machines, polylinear sequential circuit realizations using trigger, set–reset, or J–K flip-flops as the memory elements. It is shown that each such realization is directly obtainable from a graph analogous to the reverse state diagram of the given machine; the latter graph was shown in a former paper by this author to correspond to a polylinear sequential circuit realization using delays for memory. The processes consist of the straightforward steps in the construction of the reverse state diagram analogs. Almost polylinear sequential circuits are defined, and it is shown how certain proper subgraphs of the aforementioned graphs can be used to derive these circuits.

Published in:

Computers, IEEE Transactions on  (Volume:C-20 ,  Issue: 1 )