The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
May. 22, 2007
Filed:
Mar. 12, 2003
Douglas Kaufman, Menlo Park, CA (US);
Hazem Almusa, San Jose, CA (US);
Vinay Srinivas, Redwood City, CA (US);
Donald V. Organ, Saratoga, CA (US);
Larry KE, San Jose, CA (US);
Wei LI, Milpitas, CA (US);
Japinder Singh, Santa Clara, CA (US);
Robert Mathews, Los Altos, CA (US);
Douglas Kaufman, Menlo Park, CA (US);
Hazem Almusa, San Jose, CA (US);
Vinay Srinivas, Redwood City, CA (US);
Donald V. Organ, Saratoga, CA (US);
Larry Ke, San Jose, CA (US);
Wei Li, Milpitas, CA (US);
Japinder Singh, Santa Clara, CA (US);
Robert Mathews, Los Altos, CA (US);
Sequence Design, Inc., Santa Clara, CA (US);
Abstract
A method and an apparatus are provided for post-layout optimization of an integrated circuit. In one instance, only local transformations accomplished by incremental changes to placement and routing are provided, so as to avoid the costly design iteration loop that requires re-synthesis, re-place and re-route. Optimization can be provided in multiple optimization phases each accomplishing a specified set of transformations. Static timing analysis is performed at the end of each set of local transformations to determine if further optimization steps are required. In one instance, the physical design is first scanned for mismatch between drivers and loads. Then, in a second optimization phase, 'hot spots' in the physical design are identified for local transformation using a 'bidirectional combinational total negative slack' (BCTNS) algorithm. In subsequent phases, optimization based on meeting setup times and hold times in a critical path are performed.