• DocumentCode
    2550624
  • Title

    Assignment-space exploration approach to concurrent data-path/floorplan synthesis

  • Author

    Oohashi, Koji ; Kaneko, Mineo ; Tayu, Satoshi

  • Author_Institution
    Sch. of Inf. Sci., Japan Adv. Inst. of Sci. Technol., Japan
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    370
  • Lastpage
    375
  • Abstract
    As the geometrical design rules of VLSIs become finer into the order of deep sub-micron, the impact of wires to VLSI performance becomes larger relatively to the other components, and their estimation at RT-level description and performance-driven datapath synthesis need explicit connectivity information about RT-level architecture and its floorplan. In this paper, an assignment-driven approach to the datapath synthesis incorporated with one-dimensional floor planning is proposed. In our approach, scheduling and one-dimensional floorplanning, both of which are driven by iteratively generated functional unit and register assignment (binding), are performed fully concurrently. Pseudo-branch-and-bound assignment space exploration is adopted for generating assignments in this pilot system
  • Keywords
    VLSI; circuit layout CAD; RT-level description; assignment-space exploration approach; concurrent data-path synthesis; floorplan synthesis; geometrical design rules; performance-driven datapath synthesis; pseudo-branch-and-bound assignment space exploration; Clocks; Delay; High level synthesis; Information science; Scheduling; Signal design; Space exploration; Very large scale integration; Voltage; Wires;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Design, 2000. Proceedings. 2000 International Conference on
  • Conference_Location
    Austin, TX
  • ISSN
    1063-6404
  • Print_ISBN
    0-7695-0801-4
  • Type

    conf

  • DOI
    10.1109/ICCD.2000.878310
  • Filename
    878310