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.
No takes yet. Share an insight, caveat, or question.
Xia et al. (2002) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: