A graph-based algorithm for the automated datapath synthesis of ASM

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.