A heuristic state assignment algorithm targeting area

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.