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 and the derived weighted adjacency diagram, an efficient unicode race-free state assignment technique is proposed to minimize the average switching activity of state variables, thus to potentially reduce the average power dissipation in AFSMs. Experimental results show that the proposed algorithm can achieve less switching activity of state variables in comparison with existing unicode state assignment techniques for AFSMs.
| Original language | English |
|---|---|
| Title of host publication | Midwest Symposium on Circuits and Systems |
| Editors | G. Cameron, M. Hassoun, A. Jerdee, C. Melvin |
| Publisher | IEEE |
| Pages | 1325-1328 |
| Number of pages | 4 |
| Volume | 3 |
| Publication status | Published - 1996 |
| Event | Proceedings of the 1996 IEEE 39th Midwest Symposium on Circuits & Systems. Part 3 (of 3) - Ames, IA, USA Duration: 1996 Aug 18 → 1996 Aug 21 |
Other
| Other | Proceedings of the 1996 IEEE 39th Midwest Symposium on Circuits & Systems. Part 3 (of 3) |
|---|---|
| City | Ames, IA, USA |
| Period | 96-08-18 → 96-08-21 |
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering
- Electronic, Optical and Magnetic Materials