Circuit optimization for minimum path timing violations

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

Reexamination Certificate

active

10627933

ABSTRACT:
A method is provided to optimize delay insertions for reducing timing violations. The method includes inserting a buffer between a driver and a receiver in a timing path and placing the buffer either inside or outside a bounding box that encloses the driver and the receiver. The placement of the buffer inside or outside the bounding box creates the appropriate effective loading on the buffer to generates the required minimum delay to avoid timing violations.

REFERENCES:
patent: 5402356 (1995-03-01), Schaefer et al.
patent: 5507029 (1996-04-01), Granato et al.
patent: 5764528 (1998-06-01), Nakamura
patent: 5896301 (1999-04-01), Barrientos
patent: 6434731 (2002-08-01), Brennan et al.
patent: 6449756 (2002-09-01), Malik et al.
patent: 6480991 (2002-11-01), Cho et al.
patent: 6487697 (2002-11-01), Lu et al.
patent: 6513149 (2003-01-01), Donato
patent: 6557145 (2003-04-01), Boyle et al.
patent: 6591407 (2003-07-01), Kaufman et al.
patent: 6792582 (2004-09-01), Cohn et al.
patent: 6836753 (2004-12-01), Silve
patent: 2003/0101399 (2003-05-01), Yoshikawa

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

Circuit optimization for minimum path timing violations does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Circuit optimization for minimum path timing violations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Circuit optimization for minimum path timing violations will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3793067

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