HEURISTIC METHOD FOR LOW POWER RACE-FREE STATE-ASSIGNMENT OF AN ASYNGHRONOUS AUTOMATON
The problem of race free state-assignment of an asynchronous automaton minimizing the switching activity of memory elements in an implementing circuit is considered. A heuristic method to solve this problem for an asynchronous automaton is suggested where the critical races between memory elements o...
| Päätekijä: | |
|---|---|
| Aineistotyyppi: | Artikkeli |
| Kieli: | Russian |
| Julkaistu: |
National Academy of Sciences of Belarus, the United Institute of Informatics Problems
2016-09-01
|
| Sarja: | Informatika |
| Linkit: | https://inf.grid.by/jour/article/view/77 |