Efficient timing graph update for dynamic netlist changes

Details Efficient timing graph update for dynamic netlist changes Efficient timing graph update for dynamic netlist changes

2007-05-25

2010-02-02

Levin, Naum B (Department: 2825)

Computer-aided design and analysis of circuits and semiconductor

Nanotechnology related integrated circuit design

C716S030000

Reexamination Certificate

active

07657855

ABSTRACT:
Various approaches for incrementally updating the timing of an implementation of an electronic circuit design are disclosed. In one approach, a subset timing graph is selected from a primary timing graph. Alternative subset timing graphs are generated that are functionally equivalent and structurally different with respect to the selected subset timing graph. For each of the alternative timing graphs, a respective timing metric is determined. The determined timing metrics and a timing metric for the selected subset timing graph are compared. An alternative timing graph is selected in response to the comparison. Structurally different portions of the selected one of the one or more alternative timing graphs are verified with regard to the design constraints. The structurally different portions are stored to the primary timing graph.

REFERENCES:
patent: 5751596 (1998-05-01), Ginetti et al.
patent: 5880967 (1999-03-01), Jyu et al.
patent: 5923564 (1999-07-01), Jones, Jr.
patent: 6530073 (2003-03-01), Morgan
patent: 7010763 (2006-03-01), Hathaway et al.
patent: 7155691 (2006-12-01), Ratzlaff
patent: 7197732 (2007-03-01), Murgai
patent: 7243315 (2007-07-01), Tan et al.
patent: 7500207 (2009-03-01), Bhattacharya et al.
patent: 2004/0230921 (2004-11-01), Hathaway et al.
patent: 2005/0223345 (2005-10-01), Furusawa
patent: 2007/0150846 (2007-06-01), Furnish et al.
patent: 2007/0250800 (2007-10-01), Keswick
patent: 2008/0244473 (2008-10-01), Parker et al.
Mahmood et al.; “A method for timing driven datapath synthesis”; Proceedings of the Eighth Annual IEEE International; Sep. 18-22, 1995; pp. 362-365.
Hitchcock, R., “Timing Verification and the Timing Analysis Program”, Proceedings 19th Design Automation Conference, 1982, pp. 446-456.

Affiliated with

Also associated with

Rating

Efficient timing graph update for dynamic netlist changes does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient timing graph update for dynamic netlist changes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient timing graph update for dynamic netlist changes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4208939