Abstract
In this paper, a precise model for calculating the steady state probabilities and state transition probabilities of asynchronous finite state machines (AFSMs) is presented. Based on this model, a weighted adjacency diagram is derived and an efficient, dichotomy-based constrained encoding algorithm is proposed to minimize the average switching activity of state variables in AFSMs. Experimental results show that significant improvement on reducing the average switching activity of state variables can be achieved when the weights are considered during state assignment in comparison with the conventional disjoint clique covering technique. Thus, the average power dissipation in AFSMs can be potentially reduced.
| Original language | English |
|---|---|
| Pages | 509-512 |
| Number of pages | 4 |
| Publication status | Published - 1997 Dec 1 |
| Event | 7th International Symposium on IC Technology, Systems and Applications ISIC 97 - Singapore, Singapore Duration: 1997 Sep 10 → 1997 Sep 12 |
Other
| Other | 7th International Symposium on IC Technology, Systems and Applications ISIC 97 |
|---|---|
| Country/Territory | Singapore |
| City | Singapore |
| Period | 97-09-10 → 97-09-12 |
All Science Journal Classification (ASJC) codes
- Electronic, Optical and Magnetic Materials
- Electrical and Electronic Engineering