A State Variable Assignment Method for Asynchronous Sequential Switching Circuits
Journal of the ACM (JACM)
A row assignment for delay-free realizations of flow tables without essential hazards
SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)
Partially Identifying Codes for Copyright Protection
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Asynchronous Sequential Machines Designed for Fault Detection
IEEE Transactions on Computers
Realization Methods for Asynchronous Sequential Circuits
IEEE Transactions on Computers
Asynchronous State Assignments with Unateness Properties and Fault-Secure Design
IEEE Transactions on Computers
Separating and Completely Separating Systems and Linear Codes
IEEE Transactions on Computers
Fault-Tolerant Asynchronous Networks Using Read-Only Memories
IEEE Transactions on Computers
IEEE Transactions on Computers
On Universal Single Transition Time Asynchronous State Assignments
IEEE Transactions on Computers
Monotone Functions in Sequential Circuits
IEEE Transactions on Computers
A Multicode Single Transition-Time State Assignment for Asynchronous Sequential Machines
IEEE Transactions on Computers
Easily Testable Iterative Systems
IEEE Transactions on Computers
Fault-Tolerant Asynchronous Networks
IEEE Transactions on Computers
Fingerprinting with minimum distance decoding
IEEE Transactions on Information Forensics and Security
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
| Hi-index | 15.01 |
In this paper we consider the problem of deriving upper bounds on the number of state variables required for an n-state universal asynchronous state assignment (i.e., a state assignment which is valid for any n-state asynchronous sequential function). We will consider a special class of state assignments called SST assignments which were first derived by Liu [1] and later extended by Tracey [2]. In these assignments all variables which must change in a given transition are allowed to change simultaneously without critical races. The best universal bound known so far has been developed by Liu and requires 2so-1 state variables, where S0 = [log2n], n being the number of states, and [x] being the least integer x. We shall show how this bound can be substantially improved. We further show that, by generalizing the state assignment to allow multiple codings for states, the bounds can be still further improved.