DocumentCode
405755
Title
A heuristic state assignment algorithm targeting area
Author
Heng Hu ; Hongxi Xue ; Jinian Bian
Author_Institution
Comput. Sci. Dept., Tsinghua Univ., Beijing, China
Volume
1
fYear
2003
fDate
21-24 Oct. 2003
Firstpage
93
Abstract
This paper presents a new efficient algorithm (designated as BHE) for the state assignment of Finite state machines (FSMs), which is based on the Huffman coding and balanced binary tree algorithms to solve the graph-embedding problem in the state assignment process. Experiments over the MCNC logic synthesis and optimization benchmarks show that compared with NOVA and MFA, BHE can reduce area by 23.2% and 11.4% in less than 10% CPU time.
Keywords
Huffman codes; finite state machines; optimisation; state assignment; BHE; CPU time; FSM; Huffman coding; MCNC logic synthesis; MFA; NOVA; balanced binary tree algorithms; finite state machines; graph embedding problem; heuristic state assignment algorithm; optimization benchmarks; state assignment;
fLanguage
English
Publisher
ieee
Conference_Titel
ASIC, 2003. Proceedings. 5th International Conference on
ISSN
1523-553X
Print_ISBN
0-7803-7889-X
Type
conf
DOI
10.1109/ICASIC.2003.1277498
Filename
1277498
Link To Document