Design of Totally Self-Checking Check Circuits for m-Out-of-n Codes
IEEE Transactions on Computers
Asynchronous Sequential Machines Designed for Fault Detection
IEEE Transactions on Computers
Synthesis of Asynchronous Sequential Circuits with Multiple-Input Changes
IEEE Transactions on Computers
Universal Single Transition Time Asynchronous State Assignments
IEEE Transactions on Computers
Fault-Tolerant Asynchronous Networks Using Read-Only Memories
IEEE Transactions on Computers
On Totally Self-Checking Checkers for Separable Codes
IEEE Transactions on Computers
Monotone Functions in Sequential Circuits
IEEE Transactions on Computers
Realization of Fail-Safe Sequential Machines by Using a k-out-of-n Code
IEEE Transactions on Computers
Fault-Tolerant Asynchronous Networks
IEEE Transactions on Computers
Design of Fast Self-Testing Checkers for a Class of Berger Codes
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
| Hi-index | 14.99 |
Techniques to construct standard state assignments that yield unate next-state functions are presented. These proposed assignments use Berger codes. It is established that for any N row flow table, it is possible to construct