Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
