Computer-aided design and analysis of circuits and semiconductor – Nanotechnology related integrated circuit design
Reexamination Certificate
2000-12-14
2003-04-08
Smith, Matthew (Department: 2825)
Computer-aided design and analysis of circuits and semiconductor
Nanotechnology related integrated circuit design
C716S030000, C716S030000
Reexamination Certificate
active
06546539
ABSTRACT:
FIELD OF THE INVENTION
The present invention relates to the design of integrated circuits (ICs) using computer-aided design and computer-aided engineering programs (CAD/CAE). In particular, the present invention relates to CAD/CAE programs that optimize the design of an IC.
BACKGROUND OF THE INVENTION
The design process for an integrated circuit (IC) is a process of transforming a specification for desired logic or analog functions to a physical or geometric arrangement for an IC die that can perform the desired functions. Modern integrated circuits, particularly VLSI circuits, are very complex and various stages in the design process are automated using CAD/CAE software tools.
Typically, a technology mapping program will be used to convert a specification into an arrangement of library elements, such as gates, and interconnections. The output of the technology mapping process is a trial netlist which lists the library elements used and their interconnections, also called nodes. The technology mapping process is iterative and several trial netlists may be tried before an accepted netlist is found that has acceptable delays for each node based on a simplified delay calculation performed as part of the technology mapping. Typically, this mapping process includes the simple use of a Shannon expansion theorem equation to co-factor a Boolean function. The Shannon expansion theorem equation is used to move an input with a late arrival closer to the output of the Boolean function. This simple step, however, does not take into account the duplication of logic elements in the Boolean function and does not take into account the delays of the logic elements used to implement the Boolean function.
Next, a physical placement program is used to specify geometric locations for each library element and also a geometric path for each interconnect. After a trial physical placement is made, a more complex delay calculation is made that takes into account the physical placement of the library elements and the interconnections. As the more complex delay calculation identifies critical nodes with excessive delays, the physical placement is iteratively repeated to reduce the delay to an acceptable amount. In some cases, the delay does not converge to an acceptable delay, and development activity returns to the technology mapping program to generate another accepted netlist to be tried by the physical placement program.
At the end of the process, an accepted netlist and global placement are created that may satisfy the delay requirements, however, because of the limitations of the simple Shannon theorem calculations made in the technology mapping program, the netlist and global placement may not be optimized well for implementation as an IC.
A program is needed that will optimize the netlist and the global placement, eliminate duplication of logic elements and account for logic element delay in the logic co-factoring process.
SUMMARY OF THE INVENTION
Disclosed is a program for improving a netlist of logic nodes and physical placement for an IC. The program (A) identifies critical nodes based on time calculated from a physical placement. The program (B) selects a set of critical nodes and sub-netlists associated with the critical nodes and co-factors critical fan-ins in the sub-netlists. The program remaps the sub-netlists by optimization and dynamically estimates and updates fanout loads. The program returns to step B if the remapped sub-netlist is unacceptable, returns to step A if the remapped sub-netlist is acceptable, and exits at step A when no more critical nodes are identified at step A.
REFERENCES:
patent: 5452239 (1995-09-01), Dai et al.
patent: 5526514 (1996-06-01), Pradhan et al.
patent: 5778216 (1998-07-01), Venkatesh
patent: 5875117 (1999-02-01), Jones et al.
patent: 5917728 (1999-06-01), Ueda
patent: 5999715 (1999-12-01), Sato
patent: 6009248 (1999-12-01), Sato et al.
patent: 6030110 (2000-02-01), Scepanovic et al.
patent: 6038385 (2000-03-01), Scepanovic et al.
patent: 6068662 (2000-05-01), Scepanovic et al.
patent: 6075933 (2000-06-01), Pavisic et al.
patent: 6085032 (2000-07-01), Scepanovic et al.
patent: 6124736 (2000-09-01), Yamashita et al.
patent: 6170075 (2001-01-01), Schuster et al.
patent: 6272668 (2001-08-01), Teene
patent: 6396307 (2002-05-01), Kawakami et al.
“Combining Technology Mapping with Post-Placement Resynthesis for Performance Optimization” by A. Lu et al.,IEEE, pp. 616-621, (1998).
“Computing the Area Versus Delay Trade-Off Curves in Technology Mapping” by K. Chaudhary et al.,IEEE, pp. 1480-1489, (1995).
“Delay Estimation and Optimization of Logic Circuits: A Survey” by M. Fujita et al.,IEEEpp. 25-30, (1997).
“Multi-Level Logic Optimization by Implication Analysis” by W. Kunz et al.,ACM, pp. 6-13, (1994).
“Post-Layout Logic Restructuring for Performance Optimization” by Y. Jiang et al.,ACM, pp. 662-665, (1997).
“Post-Layout Optimization for Deep Submicro Design” by K. Sato et al.,ACM, pp. 740-745, (1996).
“Technology Mapping of LUT based FPGAs for Delay Optimisation” by X. Lin et al,FPL, pp. 245-254 (1997).
“Timing Driven Placement in Interaction with Netlist Transformations” by G. Stenz et al.,ISPD, pp. 36-41, (Apr. 1997).
Lu Aiquo
Pavisic Ivan
Raspopovic Pedja
Dinh Paul
LSI Logic Corporation
Smith Matthew
Westman Champlin & Kelly
LandOfFree
Netlist resynthesis program using structure co-factoring does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Netlist resynthesis program using structure co-factoring, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Netlist resynthesis program using structure co-factoring will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3102249