Optimum buffer placement for noise avoidance

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

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

716 17, 703 13, G06F 1750

Patent

active

061171824

ABSTRACT:
A method for optimal insertion of buffers into an integrated circuit design. A model representative of a plurality of circuits is created where each circuit has a receiving node coupled to a conductor and a source. A receiving node is selected from the modeled plurality of circuits and circuit noise is calculated for the selected receiving node utilizing the circuit model. If the calculated circuit noise exceeds an acceptable value an optimum distance is computed from the receiving node on the conductor for buffer insertion. In a multi-sink circuit merging of the noise calculation for the two receiving circuits must be accomplished. If an intersection of conductors exists between the receiving node and the optimum distance a set of candidate buffer locations is generated. The method then prunes inferior solutions to provide an optimal insertion of buffers.

REFERENCES:
patent: 5019724 (1991-05-01), McClure
patent: 5402356 (1995-03-01), Schaefer et al.
patent: 5666288 (1997-09-01), Jones et al.
patent: 5799170 (1998-08-01), Drumm et al.
patent: 5838581 (1998-11-01), Kuroda

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

Optimum buffer placement for noise avoidance does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Optimum buffer placement for noise avoidance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimum buffer placement for noise avoidance will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-91972

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