z
|
Abstract:
The estimation of signal stable ranges in a combinational circuit is very critical for determining clock time in a synchronous system. How to determine an optimal clocking period highly depends on the accuracy of the estimated shortest path length as well as the estimated longest path length in a combinational circuit. In this paper, a sensitization criterion for short paths is first proposed. Based on this sensitization criterion, an approach to calculating signal stable ranges is developed. The proposed approach allows the output stable range of a gate to be the union of the stable ranges of its input-leads in some cases. An efficient algorithm called LS-algorithm based on the proposed approach and Best-First Search is implemented. The experimental results obtained indicate the stable ranges generated by the LS-algorithm is more accurate than those produced by several previous approaches. Indexed terms: timing analysis, false path problem, path sensitization, signal stable ranges, combinational circuits.
Citations
| 105 | Clock skew optimization – Fishburn - 1990 |
| 23 | Efficient Algorithms for Computing the Longest Viable – McGeer, Brayton - 1989 |
| 19 | Clocking Schemes for High-Speed Digital Systems – Unger, Tan - 1986 |
| 15 | Timing Verification Using Statically Sensitizable Paths – Benkoski, al - 1990 |
| 15 | Timing Analysis Using Functional Analysis – Brand, Iyengar - 1988 |
| 8 | On the Calculation of Optimal Clocking Parameters in Synchronous Circuits with Level-Sensitive Latches – Dagenais, Rumin - 1989 |
| 7 | An Efficient Parallel Critical Path Algorithm – Liu, Du, et al. - 1991 |
| 1 | Timing Verification by Formal Signal Interaction Modeling in a Multi-level Timing Simulator – Benkoski, Strojwas - 1989 |
| 1 | Optimal Clocking of Synchronous Systems – Sakallah, Mudge, et al. - 1990 |
