Layout-driven, area-constrained design optimization

Computer-aided design and analysis of circuits and semiconductor – Nanotechnology related integrated circuit design

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C716S030000, C716S030000

Reexamination Certificate

active

11210182

ABSTRACT:
In one embodiment, a method for layout-driven, area-constrained design optimization includes accessing a design and a layout of the design. The design includes one or more gates and one or more nets coupling the gates to each other. The layout includes blocks that partition a chip area of the design. Each block includes one or more of the gates. The layout also includes a global routing of the nets. The method also includes performing a first timing analysis of the design and the layout and updating the design and the layout. The method also includes performing a second timing analysis of the design and the layout. The second timing analysis takes into account the updates to the design and the layout. The method also includes, if one or more results of the second timing analysis indicate that the design does not meet one or more predetermined design goals and indicate at least a predetermined amount of progress toward one or more of the design goals relative to the one or more results of the first timing analysis, further updating the design and the layout.

REFERENCES:
patent: 6286128 (2001-09-01), Pileggi et al.
patent: 6557145 (2003-04-01), Boyle et al.
patent: 6591407 (2003-07-01), Kaufman et al.
patent: 2001/0010090 (2001-07-01), Boyle et al.
patent: 2005/0138578 (2005-06-01), Alpert et al.
Alpert et al. “Wire Segmenting for Improved Buffer Insertion,” DAC, pp. 588-593, 1997, 7 pages.
Alpert et al., “Buffer Insertion for Noise and Delay Optimization,” DAC, pp. 362-367, 1998, 6 pages.
Alpert et al., “Fast and Flexible Buffer Trees that Navigate the Physical Layout Environment,” DAC, pp. 24-29, 2004, 6 pages.
Kannan et al., “A Methodology and Algorithms for Post-Placement Delay Optimization,” DAC, pp. 327-332, 1994, 6 pages.
Kung, “A Fast Fanout Optimization Algorithm for Near-Continuous Buffer Libraries,” DAC, pp. 352-355, 1998, 4 pages.
Lillis et al., “Optimal Wire Sizing and Buffer Insertion for Low Power and a Generalized Delay Model,” ICCAD, pp. 138-143, 1995, 8 pages.
Murgai, “Delay Constrained Area Recovery Via Layout-Driven Buffer Optimization,” Intl. Conf. on VLSI Design, Jan. 2000, 8 pages.
Murgai, “Layout-Driven Area-Constrained Timing Optimization by Net Buffering,” ICCAD, pp. 379-386, Nov. 2000, 7 pages.
Lukas, “Buffer Placement in Distributed RC-Tree Networks for Minimum Elmore Delay,” ISCAS, pp. 865-868, 1990, 6 pages.
Rubinstein et al., “Signal Delay in RC Tree Networks,” IEEE Trans. on CAD, Jul. 1983, 11 pages.
Tang et al., A New Algorithm for Routing Tree Construction with Buffer Insertion and Wire Sizing Under Obstacle Constraints,: ICCAD, pp. 49-56, 2001, 10 pages.
Vaishnav et al., “Routability-Driven Fanout Optimization,” DAC, pp. 230-235, 1993, 8 pages.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Layout-driven, area-constrained design optimization does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Layout-driven, area-constrained design optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Layout-driven, area-constrained design optimization will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3729138

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.