Structure-Driven Equivalence Verification for Circuits Optimized by Retiming and Combinational Synthesis
نویسندگان
چکیده
Sequential optimization techniques fall in two broad categories: state-based and structure-based [4]. Structurebased techniques optimize a circuit netlist by interleaving retiming and combinational synthesis in different ways to improve design metrics such as delay, area, and power. Examples of such optimizations include among others: peripheral retiming [7], architectural retiming [6], and iterative retiming and resynthesis [2]. While structure-based synthesis algorithms can handle relatively large netlists, current sequential equivalence verification algorithms are not as scalable and as robust. We believe that the absence of a reliable verification framework for such sequential optimization hinders their industrial acceptance despite potential improvements in design quality.
منابع مشابه
REVERSE: Efficient Sequential Verification for Retiming
We propose a new framework for verifying the sequential equivalence of circuits optimized by retiming. Our approach recognizes the existence of a retiming invariant relating the two circuits, and utilizes that invariant in an induction-based verification paradigm. We prove useful properties about that invariant and present efficient algorithms for computing as well as employing it for verificat...
متن کاملRecord & play: a structural fixed point iteration for sequential circuit verification
This paper proposes a technique for sequential logic equivalence checking by a structural fixed point iteration. Verification is performed by expanding the circuit into an iterative circuit array and by proving equivalence of each time frame by well-known combinational verification techniques. These exploit structural similarity between designs by local circuit transformations. Starting from th...
متن کاملMin-Area Retiming on Dynamic Circuit Structures
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 pr...
متن کاملFormal Equivalence Checking of Software Specifications
Ever-growing complexity is forcing logic design to move above the register transfer level (RTL). For example, functional specifications are being written in software. These specifications are written for clarity, and are not optimized or intended for synthesis. Since the software is the target of functional validation, equivalence verification between the software specification and the RTL impl...
متن کامل8 Conclusions and Future Work
[5] M. Mutz. Using the HOL theorem proving environment for proving the correctness of term rewriting rules reducing terms of sequential behavior. and automating hardware proofs in a higher-order theorem-proving environment. In this paper, an approach to the formal synthesis of verification-friendly hardware structures has been presented. Having applied standard scheduling and allocation algorit...
متن کامل