Michael L. Case
ABSTRACT
This paper presents a new type of sequential technology independent synthesis. Building on the previous notions of combinational observability and sequential equivalence, sequential observability is introduced and discussed. By considering both the sequential nature of the design and observability simultaneously, better results can be obtained than with either algorithm alone. The experimental results show that this method can reduce the technology-independent gate count up to 10% more than the previously best known synthesis techniques.
- J. Baumgartner, "Integrating FV Into Main-Stream Verification: The IBM Experience," Tutorial Given at FMCAD 2006.Google Scholar
- S. Chatterjee, A. Mishchenko, R. K. Brayton, X. Wang, and T. Kam, "Reducing structural bias in technology mapping," in ICCAD 2005. Google ScholarDigital Library
- M. N. Mneimneh and K. A. Sakallah, "Principles of sequential-equivalence verification," in IEEE Design and Test Comp, 2005. Google ScholarDigital Library
- A. Kuehlmann and F. Krohm, "Equivalence checking using cuts and heaps," in DAC 1997. Google ScholarDigital Library
- D. Brand, "Verification of large synthesized designs," in ICCAD 1993. Google ScholarDigital Library
- W. Kunz, "HANNIBAL: An efficient tool for logic verification based on recursive learning," in ICCAD 1993. Google ScholarDigital Library
- W. Kunz, D. Stoffel, and P. Menon, "Logic optimization and equivalence checking by implication analysis," in ICCAD 1997.Google Scholar
- E. Goldberg, M. R. Prasad, and R. K. Brayton, "Using SAT in combinational equivalence checking," in DATE 2001. Google ScholarDigital Library
- F. Lu, L. C. Wang, K. T. Cheng, and R. C. Y. Huang, "A circuit SAT solver with signal correlation guided learning," in DATE 2003. Google ScholarDigital Library
- Berkeley Logic Synthesis and Verification Group, ABC: A System for Sequential Synthesis and Verification, http://www.eecs.berkeley.edu/~alanmi/abc/Google Scholar
- C. van Eijk, "Sequential equivalence checking based on structural similarities," in IEEE Trans. Computer-Aided Design, July 2000. Google ScholarDigital Library
- S. Devadas, A. Ghosh, and K. Keutzer, "Logic Synthesis," McGraw-Hill 1994. Google ScholarDigital Library
- Q. Zhu, N. Kitchen, A. Kuehlmann, and A. Sangiovanni-Vincentelli, "SAT sweeping with local observability don't cares," in DAC 2006. Google ScholarDigital Library
- S. Plaza, K. H. Chang, I. Markov, and V. Bertacco, "Node Mergers in the Presence of Don't Cares," in ASPDAC 2007. Google ScholarDigital Library
- C. E. Leiserson and J. B. Saxe, "Retiming synchronous circuitry," in Algorithmica 1991.Google Scholar
- P. Bjesse and K. Claessen, "SAT-based Verification without State Space Traversal," in FMCAD 2000. Google ScholarDigital Library
- H. K. Ma, S. Devadas, A. R. Newton, and A. Sangiovanni-Vincentelli, "Test generation for sequential circuits," in CAD of Integrated Circuits and Systems 1988.Google Scholar
- P. H. Ho, T. Shiple, K. Harer, J. Kukula, R. Damiano, V. Bertacco, J. Taylor, and J. Long, "Smart simulation using collaborative formal and simulation engines," in ICCAD 2000. Google ScholarDigital Library
- W. A. Burkhard and R. M. Keller, "Some approaches to best-match file searching," in Communications of the ACM 1973. Google ScholarDigital Library
- L. A. Steen and J. A. Seebach, "Counterexamples in Topology," Courier Dover Publications 1970, Page 34.Google Scholar
- M. R. Prasad, A. Biere, and A. Gupta, "A Survey of Recent Advances in SAT-Based Formal Verification," in Software Tools for Technology Transfer 2005.Google Scholar
- Niklas Een, Niklas Sorensson, MiniSat. http://www.cs.chalmers.se/Cs/Research/FormalMethods/MiniSat/Google Scholar
- Sun Microsystems, "Processor Technology Resources - picoJava," http://www.sun.com/software/communitysource/processors/picojava.xmlGoogle Scholar
- A. Mishchenko, S. Chatterjee, and R. K. Brayton, "DAG-aware AIG rewriting: A fresh look at combinational logic synthesis," in DAC 2006. Google ScholarDigital Library
- P. Bjesse and J. Kukula, "Automatic Phase Abstraction for Formal Verification," in ICCAD 2005. Google ScholarDigital Library
Index Terms
- Merging nodes under sequential observability
Recommendations
Synthesis and optimization of multiple-valued combinational and sequential reversible circuits with don't cares
In this paper, a synthesis method for combinational multiple-valued reversible logic (MVRL) circuits is proposed. This algorithm can use the don't care values in the synthesis process to obtain the optimal circuit with respect to quantum cost. The ...
Merging workflows: a new perspective on connecting business processes
This paper describes the concept of workflow merge and methods for merging business processes. We grouped merges in four categories according to the type of merge: sequential, parallel, conditional, and iterative, and describe the corresponding ...
Datapath Synthesis for Standard-Cell Design
ARITH '09: Proceedings of the 2009 19th IEEE Symposium on Computer ArithmeticDatapath synthesis for standard-cell design goes through extraction of arithmetic operations from RTL code, high-level arithmetic optimizations and netlist generation. Numerous architectures and optimization strategies exist that result in circuit ...
Comments