 |
 |
|
|
| Detailed view | Conference proceedings |
 |
| Proceedings of the 1997 34th Design Automation Conference, Anaheim, CA : États-Unis (1997) |
|
|
| Efficient Latch Optimization Using Exclusive Sets |
|
|
| Ellen M. Sentovich1Horia Toma2Gérard Berry2 |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
| 1: | Cadence Berkeley Labs |
|
|
| 2: | CMA - Centre de Mathématiques Appliquées |
|
|
|
|
|
|
|
| Algorithms – Approximation theory – Calculations – Electric network synthesis – Logic circuits – Optimization |
| hal-00618114, version 1 | |
| http://hal-ensmp.archives-ouvertes.fr/hal-00618114 | |
| oai:hal-ensmp.archives-ouvertes.fr:hal-00618114 | |
| From: Brigitte Hanot | |
| Submitted on: Wednesday, 31 August 2011 16:54:05 | |
| Updated on: Wednesday, 31 August 2011 16:55:48 | |