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.
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.
