Efficient Latch Optimization Using Exclusive Sets - Mines Paris Accéder directement au contenu
Communication Dans Un Congrès Année : 1997

Efficient Latch Optimization Using Exclusive Sets


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.
Fichier non déposé

Dates et versions

hal-00618114 , version 1 (31-08-2011)



Ellen M. Sentovich, Horia Toma, Gérard Berry. Efficient Latch Optimization Using Exclusive Sets. Proceedings of the 1997 34th Design Automation Conference, Jun 1997, Anaheim, CA, United States. pp.8-11, ⟨10.1109/DAC.1997.597108⟩. ⟨hal-00618114⟩
107 Consultations
0 Téléchargements



Gmail Facebook X LinkedIn More