TY - JOUR
T1 - A graph-based algorithm for the automated datapath synthesis of ASM
AU - Hwang Kuo, Yau
AU - Pong Hsu, Jang
AU - Yeung Kung, Ling
N1 - Funding Information:
\[Def. 1\] : (Refer-and-define table) A Refer-and-define table is a table where each row represents a state and each column represents a symbol element of the program sequence such as operands, operators, and interconnections. Each entry of this table, RD\[i,j\] is defined as follows : This work was supported in part by the National Science Council, Republic of China, under contract NSC76-0408-1006-01.
PY - 1987/8
Y1 - 1987/8
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0023399139&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0023399139&partnerID=8YFLogxK
U2 - 10.1016/0165-6074(87)90102-5
DO - 10.1016/0165-6074(87)90102-5
M3 - Article
AN - SCOPUS:0023399139
VL - 21
SP - 647
EP - 654
JO - Euromicro Newsletter
JF - Euromicro Newsletter
SN - 1383-7621
IS - 1-5
ER -