LOW POWER RACE-FREE STATE ASSIGNMENT OF AN ASYNGHRONOUS AUTOMATON
The problem of a race free state assignment of an asynchronous automaton is considered. A method for the state assignment is suggested that provides the minimization of the number and theswitching activity of the memory elements along with the elimination of the critical races betweenthem.
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
National Academy of Sciences of Belarus, the United Institute of Informatics Problems
2016-09-01
|
| Series: | Informatika |
| Online Access: | https://inf.grid.by/jour/article/view/24 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The problem of a race free state assignment of an asynchronous automaton is considered. A method for the state assignment is suggested that provides the minimization of the number and theswitching activity of the memory elements along with the elimination of the critical races betweenthem. |
|---|---|
| ISSN: | 1816-0301 |