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...
Main Author: | Yu. V. Pottosin |
---|---|
Format: | Article |
Language: | Russian |
Published: |
The United Institute of Informatics Problems of the National Academy of Sciences of Belarus
2016-09-01
|
Series: | Informatika |
Online Access: | https://inf.grid.by/jour/article/view/77 |
Similar Items
-
LOW POWER RACE-FREE STATE ASSIGNMENT OF AN ASYNGHRONOUS AUTOMATON
by: Yu. V. Pottosin
Published: (2016-09-01) -
A heuristic method for bi-decomposition of partial Boolean functions
by: Yu. V. Pottosin
Published: (2020-09-01) -
A heuristic method for multi-block parallel decomposition of a system of partial Boolean functions
by: Yu. V. Pottosin
Published: (2018-12-01) -
On finite state automaton actions of HNN extensions of free abelian groups
by: V. Prokhorchuk
Published: (2021-06-01) -
Project: automaton
by: Lau, Shan Yu
Published: (2022)