STATE ASSIGNMENT IN FINITE-STATE MACHINES FOR MINIMAL SWITCHING POWER-CONSUMPTION

Abstract

A state assignment algorithm for minimal switching power consumption is proposed. It minimises the switching activity caused by state transitions by assigning codes closer in Hamming distance to the states with higher state transition probabilities. Experimental results show that the switching activity obtained by the proposed algorithm is, on the average, approximately 45%. less than that of NOVA [1] with only a approximately 3% increase in the number of product terms.