Skip to Main content Skip to Navigation
Conference papers

Efficient Latch Optimization Using Exclusive Sets

Abstract : 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.
Document type :
Conference papers
Complete list of metadata
Contributor : Magalie Prudon Connect in order to contact the contributor
Submitted on : Wednesday, August 31, 2011 - 4:54:05 PM
Last modification on : Wednesday, November 17, 2021 - 12:30:52 PM



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⟩



Record views