Efficient latch optimization using exclusive sets

  • Authors:
  • Ellen M. Sentovich;Horia Toma;Géard Berry

  • Affiliations:
  • Cadence Berkeley Labs;CMA, Ecole des Mines de Paris;CMA, Ecole des Mines de Paris

  • Venue:
  • DAC '97 Proceedings of the 34th annual Design Automation Conference
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

Controller circuits synthesized from high-level languagesoften have many more latches than the minimum,with a resulting sparse reachable state space thathas a particular structure. We propose an algorithmthatexploits this structure to remove latches. The reachablestate set (RSS) is much easier to compute for the new,smaller circuit and can be used to efficiently computethe RSS of the original. Thus we provide a method forobtaining the RSS, and two different initial implementationsfrom which to begin logic optimization.