ACM Home Page
Please provide us with feedback. Feedback
Complete-k-distinguishability for retiming and resynthesis equivalence checking without restricting synthesis
Full text PdfPdf (124 KB)
Source
Asia and South Pacific Design Automation Conference archive
Proceedings of the 2009 Asia and South Pacific Design Automation Conference table of contents
Yokohama, Japan
SESSION: Sequential design verification table of contents
Pages 636-641  
Year of Publication: 2009
ISBN:978-1-4244-2748-2
Authors
Nikolaos Liveris  Northwestern University, Evanston, IL
Hai Zhou  Northwestern University, Evanston, IL
Prithviraj Banerjee  HP Labs, Palo Alto, CA
Sponsors
: IEEE Circuits and Systems Society
SIGDA: ACM Special Interest Group on Design Automation
IEICE ESS : Institute of Electronics, Information and Communication Engineers - Engineering Sciences Society
IPSJ SIGSLDM : Information Processing Society of Japan - SIG System LSI Design Methodology
Publisher
IEEE Press  Piscataway, NJ, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 15,   Citation Count: 0
Additional Information:

abstract   references   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

Iterative retiming and resynthesis is a powerful way to optimize sequential circuits but its massive adoption has been hampered by the hardness of verification. This paper tackles the problem of retiming and resynthesis equivalence checking on a pair of circuits. For this purpose we define the Complete-k-Distinguishability (C-k-D) property for any natural number k based on C-1-D. We show how the equivalence checking problem can be simplified if the circuits satisfy this property and prove that the method is complete for any number of retiming and resynthesis steps. We also provide a way to enforce C-k-D on the circuits without restricting the optimization power of retiming and resynthesis or increasing their complexity. Experimental results demonstrate that enforcing C-k-D property can speed up the verification process.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
Berkeley Logic Synthesis and Verification Group. ABC: A System for Sequential Synthesis and Verification, Release, 70930, http://www.eecs.berkeley.edu/alanmi/abc/.
 
4
 
5
6
 
7
Jiang, J.-H. R., and Brayton, R. K. Retiming and resynthesis: A complexity perspective. Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on 25, 12 (Dec. 2006), 2674--2686.
 
8
 
9
 
10
Leiserson, C. E., and Saxe, J. B. Retiming synchronous circuitry. Algorithmica 6, 1 (1991), 5--35.
 
11
Malik, S., Sentovich, E., Brayton, R., and Sangiovanni-Vincentelli, A. Retiming and resynthesis: optimizing sequential networks with combinational techniques. Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on 10, 1 (Jan 1991), 74--84.
 
12
 
13
Mishchenko, A., and Brayton, R. K. Recording synthesis history for sequential verification. In IWLS (2008).
 
14
van Eijk, C. A. J. Sequential equivalence checking based on structural similarities. IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems 19, 7 (2000), 814--819.
 
15
Zhou, H., Singhal, V., and Aziz, A. How powerful is retiming? In IWLS (1998).
Collaborative Colleagues:
Nikolaos Liveris: colleagues
Hai Zhou: colleagues
Prithviraj Banerjee: colleagues