Trading propensity-based clustering of circuit elements in a...

Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital logic testing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C714S729000, C716S030000

Reexamination Certificate

active

07430699

ABSTRACT:
An apparatus, program product and method utilize a clustering algorithm based upon trading propensity to generate assignments of circuit elements to clusters or groups to optimize a spatial distribution of the plurality of clusters. For example, trading propensity-based clustering may be used to assign circuit elements such as scan-enabled latches to individual scan chains to optimize the layout of the scan chains in a scan architecture for an integrated circuit design.

REFERENCES:
patent: 6324678 (2001-11-01), Dangelo et al.
patent: 6442743 (2002-08-01), Sarrafzadeh et al.
patent: 6857110 (2005-02-01), Rupp et al.
patent: 6961916 (2005-11-01), Sarrafzadeh et al.
patent: 7162706 (2007-01-01), Kuang et al.
patent: 2002/0162086 (2002-10-01), Morgan
patent: 2004/0225984 (2004-11-01), Tsao et al.
patent: 2004/0230931 (2004-11-01), Barbee et al.
patent: 2004/0250226 (2004-12-01), Lin et al.
patent: 2008/0104564 (2008-05-01), Lin et al.
patent: WO0143166 (2001-06-01), None
Kahng A. B., et al., “Practically Bounded-Skew Clock Routing”, Journal of VLSI Signal Processing Systems for Signal, Image, and Video Technology, Jun. 1997, pp. 199-215, vol. 16, No. 2/3, Sprinter, New York, NY, USA.
Mike Wright, “Experiments with a Plateau-Rich Solution Space”, MIC 2001, 4th Metaheuristics International Conference, Jul. 2001, pp. 317-320, Portugal.
Yip, K. “Clock Tree Distribution”, IEEE Potentials, IEEE, Apr. 1997, pp. 11-14, vol. 16, No. 2, New York, NY, USA.
Bonhommey Y., et al., “Design of Routing-Constrained Low Power Scan Chains”, Electronic Design, Test and Applications, Second IEEE International Workshop on Perth Australia, Jan. 2004, pp. 1-6, Piscataway, NJ, USA.
Liyang Lai, et al., “Logic BIST with Scan Chain Segmentation”, 2004 International Conference on Charlotte, NC, Oct. 26, 2004, pp. 57-66, Piscataway, NJ, USA.
Berthelot D., et al., “An Efficient Linear Time Algorithm for Scan Chain Optimization and Repartitioning”, Proceedings International Test Conference 2002, pp. 781-787, Baltimore, MD, USA.
Dong-Sup Song et al., “Increasing Embedding Probabilities of RPRPs in RIN Based BIST”, pp. 600-613, 2005, Springer Berlin Heidelberg.

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

Trading propensity-based clustering of circuit elements in a... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Trading propensity-based clustering of circuit elements in a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Trading propensity-based clustering of circuit elements in a... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3976101

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