Abstract
Among other important aspects, finite state machines represent a powerful way for synchronising hardware components so that these components may cooperate in the fulfilment of the main objective of the hardware design. In this paper, we propose to optimally solve the state assignment NP-complete problem, which is inherent to designing any synchronous finite state machines using evolutionary computations. This is motivated by to reasons: first, finite state machines are very important in digital design and second, with an optimal state assignment one can physically implement the state machine in question using a minimal hardware area and reduce the propagation delay of the machine output signals.
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.
