Computer-aided design and analysis of circuits and semiconductor – Nanotechnology related integrated circuit design
Reexamination Certificate
2006-04-11
2006-04-11
Siek, Vuthe (Department: 2825)
Computer-aided design and analysis of circuits and semiconductor
Nanotechnology related integrated circuit design
C716S030000, C716S030000
Reexamination Certificate
active
07028278
ABSTRACT:
A system and method for representing digital circuits and systems in multiple partitions of Boolean space, and for performing digital circuit or system validation using the multiple partitions. Decision diagrams are built for the digital circuit or system and pseudo-variables are introduced at decomposition points to reduce diagram size. Pseudo-variables remaining after decomposition are composed and partitioned to represent the digital circuit or system as multiple partitions of Boolean space. Each partition is built in a scheduled order, and is manipulable separately from other partitions.
REFERENCES:
patent: 5128871 (1992-07-01), Schmitz
patent: 5243538 (1993-09-01), Okuzawa et al.
patent: 5349659 (1994-09-01), Do et al.
patent: 5377201 (1994-12-01), Chakradhar et al.
patent: 5469367 (1995-11-01), Puri et al.
patent: 5481473 (1996-01-01), Kim et al.
patent: 5485471 (1996-01-01), Bershteyn
patent: 5497334 (1996-03-01), Russell et al.
patent: 5522063 (1996-05-01), Ashar et al.
patent: 5526514 (1996-06-01), Pradhan et al.
patent: 5528508 (1996-06-01), Russell et al.
patent: 5649165 (1997-07-01), Jain et al.
patent: 5671399 (1997-09-01), Meier
patent: 5680332 (1997-10-01), Raimi et al.
patent: 5787006 (1998-07-01), Chevallier et al.
patent: 5801958 (1998-09-01), Dangelo et al.
patent: 5805462 (1998-09-01), Poirot et al.
patent: 6026222 (2000-02-01), Gupta et al.
patent: 6212669 (2001-04-01), Jain
patent: 6216252 (2001-04-01), Dangelo et al.
Akers, “Binary Decision Diagrams,” IEEE Transactions on Computers, vol. C-27, Jun. 1978, (p. 509-516).
Auth, et al., “Improved Test Pattern Generation For Sequential Circuits Using Implicit Enumeration”, IEEE 1992, (p. 1137-1140).
Berman, et al., “Functional Comparison of Logic Designs for VLSI Circuits”, 1989 IEEE International Conference on Computer-Aided Design: Digest of Technical Papers, 1989, (p. 456-459).
Brand, “Verification of Large Synthesized Designs”, 1993 IEEE/ACM International Conference on Computer-Aided Design: Digest of Technical Papers, 1993, (p. 534-537).
Bryant, “Symbolic Boolean Manipulation With Ordered Binary- Decision Diagrams”, ACM Computing Surveys, vol. 24, Sep. 1992, (p. 293-318).
Bryant, “Graph-Based Algorithms for Boolean Function Manipulation”, IEEE Transactions on Computers, vol. C-35, Aug. 1986, (p. 677-691).
Bryant, R.E. et al., “Verification of Arithmetic Circuits with Binary Moment Diagrams,” 32nd Design Automation Conference, Proceedings 1995 (IEEE Cat. No. 95CH35812), Proceedings of the 32nd Design Automation Conference, San Francisco, CA, USA, Jun. 12-16, 1995, (pp 535-541), XP000546358 1995, New York, NY, USA, ACM, USA ISBN: 0-89791-725-1.
Cerny, et al., “Digest of Technical Papers, Tautology Checking Using Cross-Controllability and Cross-Observability Relations”, 1990 IEEE International Conference on Computer-Aided Design, 1990, (p. 34-37).
Chakradhar, et al., “A Transitive Closure Algorithm for Test Generation, IEEE Transactions on Computer- Aided Design of Integrated Circuits and Systems”, vol. 12, 1993, (p. 1015-1027).
Chen, Y. et al., ACV: “An Arithmetic Circuit Verifier”, 1996 IEEE/ACM Interational Conference on Computer-Aided Design, San Jose, CA, USA, Nov. 10-14, 1996, (pp. 361-365), XP000738433 1996, Los Alamitos, CA, USA, IEEE Comput. Soc. Press, USA, ISBN: 0-8186-7597-7.
Coudert, et al., “A Unified Framework For The Formal Verification of Sequential Circuits”, IEEE 1990, (p. 126-129).
Drechsler, et al., “Efficient Representation and Manipulation of Switching Functions Based on Ordered Kronecker Functional Decision Diagrams”, ACM 1994, (p. 415-419).
Fujita, et al., “Evaluation and Improvements of Boolean Comparison Method Based on Binary Decision Diagrams”, IEEE 1988, (p. 2-5).
Jain J. et al., “Formal Verification of Combinational Circuits”, Proceedings Tenth International conference on VLSI Design(Cat. No. 97TB100095), Proceedings Tenth International Conference on VLSI Design, Hyderabad, India, Jan. 4-7, (pp 218-225), XP002120998 1997, Los Alamitos, CA, USA, IEEE Comput, Soc. Press, USA ISBN: 0-8186-7755-4.
Karplus, “Using If-Then-Else DAGS for Multi-Level Logic Minimization, Advanced Research in VLSI:” Proceedings of the Decennial Caltech Conference on VLSI, Mar. 1989, (p. 101-117).
Kunz, et al., Recursive Learning: An Attractive Alternative To The Decision Tree For Test Generation In Digital Circuits, International Test Conference 1993, (p. 816-825).
Kunz, Hannibal: “An Efficient Tool for Logic Verification Based on Recursive Learning”, IEEE 1993, (p. 538-543).
Malik, et al., “Logic Verification Using Binary Decision Diagrams in a Logic Synthesis Environment”, IEEE 1988, (p. 6-9).
Matsunaga, Y., “An Efficient Equivalence Checker for Combinational Circuits”, 33rd Design Automation Conference, Proceedings 1996 (IEEE Cat. No. 96 CH35932), Proceedings of 33rd Design Automation conference, Las Vegas, NV, New York, NY, USA, ACM, USA ISBN: 0-89791-779-0.
Mukherjee, “Application of Functional Learning to ATPG and Design Verification for Combinational Circuits”, Dec. 1994, (73 pages).
Mukherjee, et al., “Functional Learning: A New Approach to Learning in Digital Circuits”, Technical Report 94-020, Department of Computer Science, Texas A&M University, (16 pages).
Mukherjee, R., et al., “Efficient Combinational Verification Using DBBs and A Hash Table”, Proceedings of 1997 IEEE International Symposium on Circuits and Systems, Circuits and Systems in the Information Age, ISCAS '97 (Cat. No. 97CH35987), Proceedings of 1997 IEEE International Symposium on Circuits and Systems, pp. 1025-1028, vol. 2, XP002120997, 1997, New York, NY, USA, IEEE, USA, ISBN: 0-7803-3583-X.
Narayan, et al., “Partioned ROBDDS- A Compact, Canonical and Efficiently Manipulable Representation for Boolean Functions”. (8 pages).
Rudell, “Dynamic Variable Ordering for Ordered Binary Decision Diagrams”, IEEE 1993, (p. 42-47).
Schulz, et al., “Advanced Automatic Test Pattern Generation And Redundancy Identification Techniques”, 1988, (p. 30-35).
Schulz, Socrates: “A Highly Efficient Automatic Test Pattern Generation System.”, International Test Conference, 1987, (p. 1016-1026).
Shih-Chieh Chang, et al., “Technology Mapping via Transformations of Function Graphs”, IEEE, 1063-6404/92, Nov. 10, 1992, (pp. 159-162).
European Patent Office Search Report Communication, Nov. 11, 1999, (pp. 1-5).
European Patent Office Search Report Communication, May 4, 2000, (pp 1-7).
Bowers Brandon
Christie Parker & Hale LLP
Fujitsu Limited
Siek Vuthe
LandOfFree
Method of verifying and representing hardware 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 Method of verifying and representing hardware by..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of verifying and representing hardware by... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3547345