Controller circuits synthesized from high-level languages often have many more latches than the minimum, with a resulting sparse reachable state space that has a particular structure. We propose an algorithm that exploits this structure to remove latches. The reachable state set (RSS) is much easier to compute for the new, smaller circuit and can be used to efficiently compute the RSS of the original. Thus we provide a method for obtaining the RSS, and two different initial implementations from which to begin logic optimization.
Publié le : 1997-06-09
Classification:
Algorithms,
Approximation theory,
Calculations,
Electric network synthesis,
Logic circuits,
Optimization,
[MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]
@article{hal-00618114,
author = {Sentovich, Ellen M. and Toma, Horia and Berry, G\'erard},
title = {Efficient Latch Optimization Using Exclusive Sets},
journal = {HAL},
volume = {1997},
number = {0},
year = {1997},
language = {en},
url = {http://dml.mathdoc.fr/item/hal-00618114}
}
Sentovich, Ellen M.; Toma, Horia; Berry, Gérard. Efficient Latch Optimization Using Exclusive Sets. HAL, Tome 1997 (1997) no. 0, . http://gdmltest.u-ga.fr/item/hal-00618114/