Abstract
An universal cell (CUSA) permits one to realize any asynchronous automaton by associating such a cell with a state and a connection with a transition. There is no internal variable assignment and all kinds of hazards are avoided. In the first part of the paper we shall present the principle of the CUSA and the synthesis method using flow tables. It is an original method which enables one to reduce the number of cells and useful connections. In the second part, the method is adapted to a synthesis from a flow graph. In this graph, a node is associated with a state, not necessarily a total state, and a branch with a connection. This synthesis method is easy and systematic. CUSA are now being produced by industry and are available as IC's.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
