Abstract
In general, a digital system can be realized with two cooperated automata: control automaton and operational automaton. This methodology on logic design is called the algorithmic state machine (ASM). Datapath synnthesis plays the role of implementing the operational automaton of ASM. It includes the tasks of storage element allocation, data operator allocation and interconnection unit allocation. These tasks can be formulated as a clique-partitioning problem. This paper presents two graph-based algorithms, EAFIT and MOFAT, to resolve this problem. In order to evaluate allocation efficiency, the EAFIT and MOFAT algorithms are compared with the Facet algorithm of CMU-DA system. According to experimental results, the EAFIT has the fastest computation speed and the best allocation efficiency.
Sign-in/Register to access full text options 
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.
