Theory and Design Switching Circ
Theory and Design Switching Circ
Uniform modular realization of sequential machines
ACM '68 Proceedings of the 1968 23rd ACM national conference
Formal languages and their relation to automata
Formal languages and their relation to automata
Universal Modules for Bounded Signal Fan-Out Synchronous Sequential Circuits
IEEE Transactions on Computers
A Synthesis Technique for Binary Input-Binary Output Synchronous Sequential Moore Machines
IEEE Transactions on Computers
Modular Networks and Nondeterministic Sequential Machines
IEEE Transactions on Computers
Reconfiguration for Repair in a Class of Universal Logic Modules
IEEE Transactions on Computers
Iteratively Realized Sequential Circuits
IEEE Transactions on Computers
Tree Structured Sequential Multiple-Valued Logic Design from Universal Modules
IEEE Transactions on Computers
Synchronous Sequential Machines: A Modular and Testable Design
IEEE Transactions on Computers
| Hi-index | 14.99 |
An alternative design procedure is presented for the implementation of finite-state Moore machines as universal modular trees (UMT's). A machine property is shown to provide a design goal in the tree depth. Design specification is made heuristically by labeling transitions on a shift register state diagram. Programming of feedback and output trees is accomplished with a template tree. The procedure is felt to be more prone to reaching minimal tree depth and more expository of design choices (an aid in fault reconfiguration) than previous design procedures.