Computer-aided design and analysis of circuits and semiconductor – Nanotechnology related integrated circuit design
Reexamination Certificate
2007-05-08
2007-05-08
Do, Thuan (Department: 2825)
Computer-aided design and analysis of circuits and semiconductor
Nanotechnology related integrated circuit design
C716S030000, C716S030000
Reexamination Certificate
active
11057651
ABSTRACT:
The present invention provides a method for determining whether a Boolean function is equivalent to a Boolean constant 1 within a given subset of the input space. The given subset is divided into a plurality of smaller subsets regardless how the smaller subsets are chosen. If any of the smaller subsets is not a cube, this smaller subset is divided further. If one of the smaller subsets is a cube, the Boolean function is simplified with constant substitution within the cube. If the simplification result is not a constant, the cube is divided further. If the simplification result is constant 0, a negative conclusion is reached. The conclusion is positive if none of the simplification result is Boolean constant 0. Many of the subset division steps and many of the Boolean function simplification steps can be performed independently of one another, and therefore these independent operations can be performed separately at different times or on different computers. The given subset can expand or shrink dynamically if updates of the given subset are considered in the steps. These dynamic updates make it possible to dynamically adjust the divided subsets.
REFERENCES:
patent: 5032988 (1991-07-01), van der Linden
patent: 5243538 (1993-09-01), Okuzawa et al.
patent: 5276897 (1994-01-01), Stalmarck
patent: 5526514 (1996-06-01), Pradhan et al.
patent: 5748486 (1998-05-01), Ashar et al.
patent: 5946481 (1999-08-01), Kurshan et al.
patent: 5949691 (1999-09-01), Kurosaka et al.
patent: 6086626 (2000-07-01), Jain et al.
R. E. Bryant, “Symbolic Boolean Manipulation With Ordered Binary Decision Diagrams”, ACM Computing Surveys, vol. 24, No. 3, Sep. 1992, pp. 293-318.
J. R. Burch, V. Singhal, “Tight Integration of Combinational Verification Methods”, IEEE/ACM International Conference on Computer Aided Design Digest of Technical Papers, Nov. 1998, IEEE, Piscataway, NJ, USA, pp. 570-576.
C. A. J. van Eijk, “A BDD Based Verification Method for Large Synthesized Circuits”, INTEGRATION, the VLSI Journal, vol. 23, No. 2, Nov. 1997, pp. 131-149.
J. Jain et al., “A Survey of Techniques for Formal Verification of Combinational Circuits”, Proceedings of IEEE International Conference on Computer Design: VLSI in Computers and Processors, Oct. 1997, IEEE, Piscataway, NJ, USA, pp. 445-454.
J. P. Marques-Silva, K. A. Sakallah, “Boolean Satisfiability in Electronic Design Automation”, Proceedings of 37th Design Automation Conference, Jun. 2000, IEEE, Piscataway, NJ, USA, pp. 657-662.
S. Woods, G. Casinovi, “Efficient Solution of Systems of Boolean Equations”, IEEE/ACM International Conference on Computer Aided Design Digest of Technical Papers, Nov. 1996, IEEE, Piscataway, NJ, USA.
LandOfFree
Checkpoint restart method using condensed partial results by... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Checkpoint restart method using condensed partial results by..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Checkpoint restart method using condensed partial results by... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3748047