Min-max timing analysis and an application to asynchronous circuits

被引:18
|
作者
Chakraborty, S [1 ]
Dill, DL
Yun, KY
机构
[1] Fujitsu Labs Amer, Sunnyvale, CA 94086 USA
[2] Stanford Univ, Dept Comp Sci, Stanford, CA 94305 USA
[3] Univ Calif San Diego, Dept Elect & Comp Engn, San Diego, CA 92093 USA
关键词
approximate timing analysis; asynchronous circuits; extended burst-mode circuits; min-max timing simulation; polynomial-time analysis; reconvergent fanout analysis; 3D circuits;
D O I
10.1109/5.740025
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Modern high-performance asynchronous circuits depend on timing constraints for correct operation. so timing analyzers are essential asynchronous design tools. In this paper we present a 13-valued abstract waveform algebra and a polynomial-time min-max timing simulation algorithm for use in efficient, approximate timing analysis of asynchronous circuits with bounded component delays. Unlike several previous approaches, our algorithm computes separate propagation delay bounds from each circuit input to each internal gate. This is useful for analyzing asynchronous circuits, where the relative transition times of the inputs may not be known a priori, unlike synchronous circuits. We also describe an efficient reconvergent fanout analysis technique that helps in increasing the accuracy of simulation. We have applied our algorithm to build an efficient timing analysis tool for extended burst-mode circuits (a class of timing-dependent asynchronous circuits) implemented in the 3D design style [1]. Our tool analyzes gate-level 3D circuits assuming bounded component delays and determines safe timing constraints for correct operation. Although OUT results represent conservative approximations to the true timing requirements in the worst case, experiments indicate that our technique is efficient and fairly accurate in practice.
引用
收藏
页码:332 / 346
页数:15
相关论文
共 50 条
  • [1] Analysis of min-max systems
    Olsder, GJ
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1996, 30 (01): : 17 - 30
  • [2] Min-Max Circuits as a Problem Solving Tool(s)
    Kovacevic, Darko
    2013 36TH INTERNATIONAL CONVENTION ON INFORMATION AND COMMUNICATION TECHNOLOGY, ELECTRONICS AND MICROELECTRONICS (MIPRO), 2013, : 1 - 10
  • [3] Min-max inequalities and the timing verification problem with max and linear constraints
    Cheng, YP
    Zheng, DZ
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2005, 15 (02): : 119 - 143
  • [4] Min-Max Spaces and Complexity Reduction in Min-Max Expansions
    Gaubert, Stephane
    McEneaney, William M.
    APPLIED MATHEMATICS AND OPTIMIZATION, 2012, 65 (03): : 315 - 348
  • [5] Complexity of the min-max and min-max regret assignment problems
    Aissi, H
    Bazgan, C
    Vanderpooten, D
    OPERATIONS RESEARCH LETTERS, 2005, 33 (06) : 634 - 640
  • [6] Min-Max Spaces and Complexity Reduction in Min-Max Expansions
    Stephane Gaubert
    William M. McEneaney
    Applied Mathematics & Optimization, 2012, 65 : 315 - 348
  • [7] MIN-MAX OPERATORS IN TEXTURE ANALYSIS
    WERMAN, M
    PELEG, S
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1985, 7 (06) : 730 - 733
  • [8] A CMOS implementation of current-mode min-max circuits and a sample fuzzy application
    Mesgarazdeh, B
    2004 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS 1-3, PROCEEDINGS, 2004, : 941 - 946
  • [9] MIN-MAX CLASSIFIERS - LEARNABILITY, DESIGN AND APPLICATION
    YANG, PF
    MARAGOS, P
    PATTERN RECOGNITION, 1995, 28 (06) : 879 - 899
  • [10] An algorithm for timing verification of systems constrained by min-max inequalities
    Cheng, Yiping
    Zheng, Da-Zhong
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2007, 17 (01): : 99 - 129