A SIMPLE AND EFFICIENT STATE CODE ASSIGNMENT ALGORITHM

A simple but efficient method of code assignment in state machines has been presented in this paper. The approach is unique in that it takes into consideration the power-consuming transitions between the states and does not rely on Hamming distance between state codes alone. In this approach, the codes used for encoding are chosen from all available codes. It then proceeds to group the selected codes based on power consuming transitions between them. The states are also grouped based on the transition probabilities. The final code assignment is performed by matching the elements between these two groups. 1