Preview

Informatics

Advanced search

HEURISTIC METHOD FOR LOW POWER RACE-FREE STATE-ASSIGNMENT OF AN ASYNGHRONOUS AUTOMATON

Abstract

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 of the implementing circuit are eliminated.

For citations:


Pottosin Yu.V. HEURISTIC METHOD FOR LOW POWER RACE-FREE STATE-ASSIGNMENT OF AN ASYNGHRONOUS AUTOMATON. Informatics. 2016;(3):113-123. (In Russ.)

Views: 793


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.


ISSN 1816-0301 (Print)
ISSN 2617-6963 (Online)