Abstract

In this paper we present two techniques for improving min-area retiming that combine the actual register minimization with combinational optimization. First, we discuss an on-the-fly retiming approach based on a sequential AND/INVERTER/REGISTER graph. With this method the circuit structure is sequentially compacted using a combination of register “dragging ” and AND vertex hashing. Second, we present an extension of the classical retiming formulation that allows an optimal sharing of fanin registers of AND clusters, similar to traditional fanout register sharing. The combination of both techniques is capable of minimizing the circuit size beyond that possible with a standard Leiserson and Saxe retiming approach on a static netlist structure. Our work is primarily aimed at optimizing the performance of reachability-based verification methods. However, the presented techniques are equally applicable to sequential redundancy removal in technology-independent logic synthesis. A large set of experiments using benchmark and industrial circuits demonstrate the effectiveness of the described techniques. 1

Citations

276	Retiming Synchronous Circuitry - Leiserson, Saxe - 1991
225	HITEC: A test generation package for sequential circuits - Niermann, Patel - 1991
148	J.C.: Verification of synchronous sequential machines based on symbolic execution - Coudert, Berthet, et al.
137	Optimizing synchronous systems - Leiserson, Saxe - 1983
84	Symbolic Model Checking - Burch, Clarke, et al. - 1992
77	Retiming and resynthesis: optimizing sequential networks with combinational techniques - Malik, Sentovich, et al. - 1990
52	Logic decomposition during technology mapping - Lehman, Watanabe, et al. - 1997
45	Circuitbased Boolean reasoning - Kuehlmann, Ganai, et al. - 2001
36	Retiming revisited and reversed - Even, Spillinger, et al. - 1996
35	Computing the Initial States of Retimed Circuits - Touati, Brayton - 1993
31	Transformation-based verification using generalized retiming - Kuehlmann, Baumgartner - 2001
16	Equivalence checking of combinational circuits using boolean expression diagrams - Hulgaard, Williams, et al. - 1999
14	On-the-Fly Compression of Logical Circuits - Ganai, Kuehlmann - 2000
12	Optimizing sequential verification by retiming transformations - Cabodi, Quer, et al. - 2000
10	Formal Implementation Verification of the Bus Interface Unit for the Alpha 21264 - Bischoff, Brace, et al. - 1997
9	Synchronous Logic Synthesis: Algorithms for Cycle-Time Minimization - Micheli - 1991
7	Exploiting retiming in a guided simulation based validation methodology - Gupta, Ashar, et al. - 1999