Abstract
Presents a new, efficient algorithm for the state encoding of finite-state machines which minimises the area of the combinational logic. The encoding problem is modelled as the construction of a hypercube, where the encoding of each state is given by the co-ordinate of the corresponding vertex of the D-dimensional Boolean hypercube (D=log/sub 2/(number of states)). The proposed state encoding scheme consists of computing the encoding affinities between states and placing states with strong encoding affinities closely in the hypercube. The algorithms are implemented as a program called SECH (State Encoding by Construction of Hypercube). Experimental results show that SECH yields more than 20% better results than NOVA (Villa et al., 1990) in a comparable CPU time, and about 10% better results than NOVA in about 1/200 of the 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 callMore From: IEE Proceedings - Computers and Digital Techniques
Disclaimer: 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.
