Simultaneous placement and global routing algorithm for FPGAs with power optimization

Nozomu Togawa, Kaoru Ukai, Masao Yanagisawa, Tatsuo Ohtsuki

    研究成果: Chapter

    3 引用 (Scopus)

    抄録

    This paper proposes a simultaneous placement and global routing algorithm for FPGAs with power optimization. The algorithm is based on hierarchical bipartitioning of layout regions and sets of logic-blocks. When bipartitioning a layout region, pseudo-blocks are introduced to preserve connections if there exist connections between bipartitioned logic-block sets. A global route is represented by a sequence of pseudo-blocks. Since pseudo-blocks and logic-blocks can be dealt with equally, placement and global routing are processed simultaneously. The algorithm gives weights to the nets with high switching probabilities and assigns the blocks connected by weighted nets to the same region. Thus their length is shortened and the power consumption of a whole circuit can be reduced. The experimental results demonstrate the effectiveness and efficiency of the algorithm.

    元の言語English
    ホスト出版物のタイトルIEEE Asia-Pacific Conference on Circuits and Systems - Proceedings
    出版場所Piscataway, NJ, United States
    出版者IEEE
    ページ125-128
    ページ数4
    ISBN(印刷物)0780351460
    出版物ステータスPublished - 1998
    イベントProceedings of the 1998 IEEE Asia-Pacific Conference on Circuits and Systems - Microelectronics and Integrating Systems (IEEE APCCAS-98) - Chiangmai, Thailand
    継続期間: 1998 11 241998 11 27

    Other

    OtherProceedings of the 1998 IEEE Asia-Pacific Conference on Circuits and Systems - Microelectronics and Integrating Systems (IEEE APCCAS-98)
    Chiangmai, Thailand
    期間98/11/2498/11/27

    Fingerprint

    Routing algorithms
    Field programmable gate arrays (FPGA)
    Electric power utilization
    Networks (circuits)

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering

    これを引用

    Togawa, N., Ukai, K., Yanagisawa, M., & Ohtsuki, T. (1998). Simultaneous placement and global routing algorithm for FPGAs with power optimization. : IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings (pp. 125-128). Piscataway, NJ, United States: IEEE.

    Simultaneous placement and global routing algorithm for FPGAs with power optimization. / Togawa, Nozomu; Ukai, Kaoru; Yanagisawa, Masao; Ohtsuki, Tatsuo.

    IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings. Piscataway, NJ, United States : IEEE, 1998. p. 125-128.

    研究成果: Chapter

    Togawa, N, Ukai, K, Yanagisawa, M & Ohtsuki, T 1998, Simultaneous placement and global routing algorithm for FPGAs with power optimization. : IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings. IEEE, Piscataway, NJ, United States, pp. 125-128, Proceedings of the 1998 IEEE Asia-Pacific Conference on Circuits and Systems - Microelectronics and Integrating Systems (IEEE APCCAS-98), Chiangmai, Thailand, 98/11/24.
    Togawa N, Ukai K, Yanagisawa M, Ohtsuki T. Simultaneous placement and global routing algorithm for FPGAs with power optimization. : IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings. Piscataway, NJ, United States: IEEE. 1998. p. 125-128
    Togawa, Nozomu ; Ukai, Kaoru ; Yanagisawa, Masao ; Ohtsuki, Tatsuo. / Simultaneous placement and global routing algorithm for FPGAs with power optimization. IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings. Piscataway, NJ, United States : IEEE, 1998. pp. 125-128
    @inbook{65fb64f164094011b32782dc5f574423,
    title = "Simultaneous placement and global routing algorithm for FPGAs with power optimization",
    abstract = "This paper proposes a simultaneous placement and global routing algorithm for FPGAs with power optimization. The algorithm is based on hierarchical bipartitioning of layout regions and sets of logic-blocks. When bipartitioning a layout region, pseudo-blocks are introduced to preserve connections if there exist connections between bipartitioned logic-block sets. A global route is represented by a sequence of pseudo-blocks. Since pseudo-blocks and logic-blocks can be dealt with equally, placement and global routing are processed simultaneously. The algorithm gives weights to the nets with high switching probabilities and assigns the blocks connected by weighted nets to the same region. Thus their length is shortened and the power consumption of a whole circuit can be reduced. The experimental results demonstrate the effectiveness and efficiency of the algorithm.",
    author = "Nozomu Togawa and Kaoru Ukai and Masao Yanagisawa and Tatsuo Ohtsuki",
    year = "1998",
    language = "English",
    isbn = "0780351460",
    pages = "125--128",
    booktitle = "IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings",
    publisher = "IEEE",

    }

    TY - CHAP

    T1 - Simultaneous placement and global routing algorithm for FPGAs with power optimization

    AU - Togawa, Nozomu

    AU - Ukai, Kaoru

    AU - Yanagisawa, Masao

    AU - Ohtsuki, Tatsuo

    PY - 1998

    Y1 - 1998

    N2 - This paper proposes a simultaneous placement and global routing algorithm for FPGAs with power optimization. The algorithm is based on hierarchical bipartitioning of layout regions and sets of logic-blocks. When bipartitioning a layout region, pseudo-blocks are introduced to preserve connections if there exist connections between bipartitioned logic-block sets. A global route is represented by a sequence of pseudo-blocks. Since pseudo-blocks and logic-blocks can be dealt with equally, placement and global routing are processed simultaneously. The algorithm gives weights to the nets with high switching probabilities and assigns the blocks connected by weighted nets to the same region. Thus their length is shortened and the power consumption of a whole circuit can be reduced. The experimental results demonstrate the effectiveness and efficiency of the algorithm.

    AB - This paper proposes a simultaneous placement and global routing algorithm for FPGAs with power optimization. The algorithm is based on hierarchical bipartitioning of layout regions and sets of logic-blocks. When bipartitioning a layout region, pseudo-blocks are introduced to preserve connections if there exist connections between bipartitioned logic-block sets. A global route is represented by a sequence of pseudo-blocks. Since pseudo-blocks and logic-blocks can be dealt with equally, placement and global routing are processed simultaneously. The algorithm gives weights to the nets with high switching probabilities and assigns the blocks connected by weighted nets to the same region. Thus their length is shortened and the power consumption of a whole circuit can be reduced. The experimental results demonstrate the effectiveness and efficiency of the algorithm.

    UR - http://www.scopus.com/inward/record.url?scp=0032218438&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0032218438&partnerID=8YFLogxK

    M3 - Chapter

    AN - SCOPUS:0032218438

    SN - 0780351460

    SP - 125

    EP - 128

    BT - IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings

    PB - IEEE

    CY - Piscataway, NJ, United States

    ER -