• DocumentCode
    3498964
  • Title

    Clock-constrained simultaneous allocation and binding for multiplexer optimization in high-level synthesis

  • Author

    Hara-Azumi, Yuko ; Tomiyama, Hiroyuki

  • fYear
    2012
  • fDate
    Jan. 30 2012-Feb. 2 2012
  • Firstpage
    251
  • Lastpage
    256
  • Abstract
    This paper proposes a novel simultaneous allocation and binding method in high-level synthesis, which minimizes the circuit area including multiplexers (MUXs) under a clock constraint. Most existing works on binding minimize MUXs under given allocation by minimizing the number of inter connections, but do not care where the MUXs would be in serted in a circuit. As a result, they cannot guarantee the re quired clock frequency and often violate the clock constraint. On the contrary, our work globally optimizes binding and al location for FUs and registers while meeting the clock constraint by considering where MUXs would be inserted. Our work is formulated as an ILP problem. Also, an effective ILP-based heuristic for non-small designs is presented. Ex perimental results demonstrate that our work satisfies the clock constraint with the minimum circuit area.
  • Keywords
    circuit optimisation; clocks; heuristic programming; high level synthesis; integer programming; linear programming; multiplexing equipment; ILP-based heuristic problem; binding method; circuit area minimization; clock frequency; clock-constrained simultaneous allocation; high-level synthesis; integer linear programming; multiplexer optimization; nonsmall designs; Adders; Clocks; Delay; Registers; Allocation; Binding; High-level synthesis; Multiplexer;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Design Automation Conference (ASP-DAC), 2012 17th Asia and South Pacific
  • Conference_Location
    Sydney, NSW
  • ISSN
    2153-6961
  • Print_ISBN
    978-1-4673-0770-3
  • Type

    conf

  • DOI
    10.1109/ASPDAC.2012.6164954
  • Filename
    6164954