Monotone Functions in Sequential Circuits
- 1 October 1973
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-22 (10) , 928-933
- https://doi.org/10.1109/t-c.1973.223620
Abstract
This paper is concerned with the problem of realizing an arbitrary syndconous or asynchronous sequential machine using only monotone AMR (or decreasing) switching functions. It has been found that h ion always exist, that in the asynchronous case only nomal fundamental mode flow tables are considered. Univesl state assignmments resulting in monotone inceasing (or next-state funtions are characterized using the concept of an (i,j) completely separating system.Keywords
This publication has 7 references indexed in Scilit:
- Derivation of Minimum Test Sets for Unate Logical CircuitsIEEE Transactions on Computers, 1971
- Realization Methods for Asynchronous Sequential CircuitsIEEE Transactions on Computers, 1971
- Asynchronous sequential circuits with (2, 1) type state assignmentsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1970
- Minimal completely separating systemsJournal of Combinatorial Theory, 1970
- On a problem concerning separating systems of a finite setJournal of Combinatorial Theory, 1969
- Universal Single Transition Time Asynchronous State AssignmentsIEEE Transactions on Computers, 1969
- Maximum-speed s.t.t. state assignments for sequential machinesElectronics Letters, 1968