• DocumentCode
    3087117
  • Title

    The hierarchical timing pair model

  • Author

    Chandrachoodan, Nitin ; Bhattacharyya, Shuvra S. ; Liu, K.J.R.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Maryland Univ., College Park, MD, USA
  • Volume
    5
  • fYear
    2001
  • fDate
    6-9 May 2001
  • Firstpage
    367
  • Abstract
    We present a new model for representing timing information for functions in High-Level Synthesis (HLS). We identify shortcomings of the conventional timing model, which is a very simple model derived from the combinational logic model, and show that our new model overcomes many of these defects. In particular, we are able to provide a unified timing model that describes hierarchical combinational and iterative circuits and provides a compact representation of the information, that can be used to streamline system performance analysis. We present experimental results that demonstrate the effectiveness of our new approach, and describe an efficient algorithm to easily compute the required timing parameters from a description of the graph.
  • Keywords
    data flow graphs; data structures; high level synthesis; modelling; timing; DFG; HLS; graph description; hierarchical combinational circuits; hierarchical iterative circuits; hierarchical timing pair model; high-level synthesis; system performance analysis; timing information representation; timing parameters; unified timing model; Adders; Circuits; Clocks; Computer architecture; Context modeling; Delay; Hardware; High level synthesis; Logic; Timing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on
  • Conference_Location
    Sydney, NSW
  • Print_ISBN
    0-7803-6685-9
  • Type

    conf

  • DOI
    10.1109/ISCAS.2001.922061
  • Filename
    922061