U.S. patents available from 1976 to present.
U.S. patent applications available from 2005 to present.

High capacity netlist comparison

Patent 5463561 Issued on October 31, 1995. Estimated Expiration Date: Icon_subject June 30, 2013. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.

Patent References

Input/output pin assignment method
Patent #: 5231589
Issued on: 07/27/1993
Inventor: Itoh, et al.

Comparison and verification system for logic circuits and method thereof
Patent #: 5243538
Issued on: 09/07/1993
Inventor: Okuzawa, et al.

Method for the hierarchical comparison of schematics and layouts of electronic components
Patent #: 5249133
Issued on: 09/28/1993
Inventor: Batra

Method of layout processing including layout data verification
Patent #: 5249134
Issued on: 09/28/1993
Inventor: Oka

Method to efficiently reduce the number of connections in a circuit Patent #: 5257201
Issued on: 10/26/1993
Inventor: Berman, et al.

Inventor

Assignee

Application

No. 085639 filed on 06/30/1993

US Classes:

716/5Design verification (e.g., wiring line capacitance, fan-out checking, minimum path width)

Examiners

Primary: Trans, Vincent N.

Attorney, Agent or Firm

International Class

G06F 017/50

Abstract

A method for determining whether multiple representations of a design of a circuit are consistent with each other, where the circuit includes multiple devices with channels for conducting electrical current. Each representations includes a list of device elements that describe the devices and node elements that describe the nodes which interconnect the devices. The method includes modifying each of the lists by: (1) analyzing the device elements and the node elements to identify at least one channel connected region of said circuit (where a channel connected region includes the subset of the devices that have channels interconnected by a subset of the nodes), (2) defining, for each channel connected region, a channel connected region element that describes the subset of the devices and the subset of the nodes in the region, and (3) replacing the device elements of each subset of devices and the node elements of each subset of nodes in the lists with the channel connected region elements. Thereafter, the modified lists are compared as a basis for determining whether the representations are consistent with each other.

Other References

  • Derek L. Beatty et al., "Fast Incremental Circuit Analysis Using Extracted Hierarchy", 25th AMC/IEEE Design Automation Conference, Paper 33.1, pp. 495-500
  • D. G. Corneil et al., "A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem" SIAM J. Comput., vol. 9, No. 2, May 1980
  • D. G. Corneil, "Recent Results on the Graph Isomorphism Problem", Proc. Eighth Manitoba Conference on Numerical Math. and Computing, 1978, pp. 13-31
  • Ronald C. Read et al., "The Graph Isomorphism Disease", Journal of Graph Theory, vol. 1 (1977) 339-363
  • K. L. Kodandapani et al., "A Wireless Compare Program for Verifying VLSI Layouts", IEEE Design & Test, Jun. 1986, pp. 46-51
  • Pradeep Batra et al., "Hcompare: A Hierarchical Netlist Comparison Program", 29th ACM/IEEE Design Automation Conference, Paper 21.1, pp. 299-304
  • Carl Ebeling et al., "Validating VLSI Circuit Layout By Wirelist Comparison", Computer Science Department Carnegie-Mellon University, pp. 172-173
PatentsPlus Images
Enhanced PDF formats
loading...
PatentsPlus: add to cart
PatentsPlus: add to cartSearch-enhanced full patent PDF image
$9.95more info
PatentsPlus: add to cart
PatentsPlus: add to cartIntelligent turbocharged patent PDFs with marked up images
$16.95more info
 
Sign InRegister
Username  
Password   
forgot password?