Feasible delay Bound Definition

Abstract : Minimizing the number of iterations when satisfying performance constraints in IC design is of fundamental importance to limit the design iterations. We present a method to determine the feasibility of delay constraint imposed on circuit path. From a layout oriented study of the path delay distribution, we show how to obtain the upper and lower bounds of the delay of combinatorial paths. Then we characterise these bounds and present a method to determine, , the average weighted loading factor allowing to satisfy the delay constraint. Example of application is given on different ISCAS circuits.
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00239363
Contributor : Nadine Azemard <>
Submitted on : Tuesday, February 5, 2008 - 3:47:22 PM
Last modification on : Wednesday, October 24, 2018 - 9:02:05 AM

Identifiers

  • HAL Id : lirmm-00239363, version 1

Citation

Michel Aline, Nadine Azemard, Philippe Maurine, Daniel Auvergne. Feasible delay Bound Definition. SOC Design Methodologies, Kluwer Academic Publishers, pp.325-335, 2002. ⟨lirmm-00239363⟩

Share

Metrics

Record views

77