Abstract

The use of assignment to minimise power dissipation and area for finite-state machines is computationally difficult. Most published results show that the reduction of switching activity often trades with area penalty. Two cost functions are introduced and a genetic algorithm is used to optimise the cost functions. Experimental results show a significant reduction of switching activity without area penalty or with smaller area penalty than previous publications.

Full Text
Published version (Free)

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 call