Abstract
In this paper, we extend the partition theory developed by Hartmanis and Stearns for synchronous sequential circuits to asynchronous sequential circuits. A method which utilizes the concept of partition pairs to obtain single transition time asynchronous state assignments with reduced dependence is presented. Parallel and serial decompositions of asynchronous sequential circuits are also considered. Single transition time and multiple transition time serial decompositions are discussed and procedures for obtaining such decompositions are presented.
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.
