Maple: A simultaneous technology mapping, placement, and global routing algorithm for field-programmable gate arrays

Nozomu Togawa, Masao Sato, Tatsuo Ohtsuki

    Research output: Contribution to journalArticle

    Abstract

    Technology mapping algorithms for LUT (Look Up Table) based FPGAs have been proposed to transfer a Boolean network into logic-blocks. However, since those algorithms take no layout information into account, they do not always lead to excellent results. In this paper, a simultaneous technology mapping, placement and global routing algorithm for FPGAs, Maple, is presented. Maple is an extended version of a simultaneous placement and global routing algorithm for FPGAs, which is based on recursive partition of layout regions and block sets. Maple inherits its basic process and executes the technology mapping simultaneously in each recursive process. Therefore, the mapping can be done with the placement and global routing information. Experimental results for some benchmark circuits demonstrate its efficiency and effectiveness.

    Original languageEnglish
    Pages (from-to)2028-2038
    Number of pages11
    JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    VolumeE77-A
    Issue number12
    Publication statusPublished - 1994 Dec

    Fingerprint

    Maple
    Routing algorithms
    Routing Algorithm
    Field Programmable Gate Array
    Placement
    Field programmable gate arrays (FPGA)
    Layout
    Boolean Networks
    Look-up Table
    Routing
    Partition
    Logic
    Benchmark
    Networks (circuits)
    Experimental Results
    Demonstrate

    ASJC Scopus subject areas

    • Hardware and Architecture
    • Information Systems
    • Electrical and Electronic Engineering

    Cite this

    @article{5c85ca4ea259417484b656bc01f87bf5,
    title = "Maple: A simultaneous technology mapping, placement, and global routing algorithm for field-programmable gate arrays",
    abstract = "Technology mapping algorithms for LUT (Look Up Table) based FPGAs have been proposed to transfer a Boolean network into logic-blocks. However, since those algorithms take no layout information into account, they do not always lead to excellent results. In this paper, a simultaneous technology mapping, placement and global routing algorithm for FPGAs, Maple, is presented. Maple is an extended version of a simultaneous placement and global routing algorithm for FPGAs, which is based on recursive partition of layout regions and block sets. Maple inherits its basic process and executes the technology mapping simultaneously in each recursive process. Therefore, the mapping can be done with the placement and global routing information. Experimental results for some benchmark circuits demonstrate its efficiency and effectiveness.",
    author = "Nozomu Togawa and Masao Sato and Tatsuo Ohtsuki",
    year = "1994",
    month = "12",
    language = "English",
    volume = "E77-A",
    pages = "2028--2038",
    journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
    issn = "0916-8508",
    publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
    number = "12",

    }

    TY - JOUR

    T1 - Maple

    T2 - A simultaneous technology mapping, placement, and global routing algorithm for field-programmable gate arrays

    AU - Togawa, Nozomu

    AU - Sato, Masao

    AU - Ohtsuki, Tatsuo

    PY - 1994/12

    Y1 - 1994/12

    N2 - Technology mapping algorithms for LUT (Look Up Table) based FPGAs have been proposed to transfer a Boolean network into logic-blocks. However, since those algorithms take no layout information into account, they do not always lead to excellent results. In this paper, a simultaneous technology mapping, placement and global routing algorithm for FPGAs, Maple, is presented. Maple is an extended version of a simultaneous placement and global routing algorithm for FPGAs, which is based on recursive partition of layout regions and block sets. Maple inherits its basic process and executes the technology mapping simultaneously in each recursive process. Therefore, the mapping can be done with the placement and global routing information. Experimental results for some benchmark circuits demonstrate its efficiency and effectiveness.

    AB - Technology mapping algorithms for LUT (Look Up Table) based FPGAs have been proposed to transfer a Boolean network into logic-blocks. However, since those algorithms take no layout information into account, they do not always lead to excellent results. In this paper, a simultaneous technology mapping, placement and global routing algorithm for FPGAs, Maple, is presented. Maple is an extended version of a simultaneous placement and global routing algorithm for FPGAs, which is based on recursive partition of layout regions and block sets. Maple inherits its basic process and executes the technology mapping simultaneously in each recursive process. Therefore, the mapping can be done with the placement and global routing information. Experimental results for some benchmark circuits demonstrate its efficiency and effectiveness.

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

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

    M3 - Article

    AN - SCOPUS:0028739733

    VL - E77-A

    SP - 2028

    EP - 2038

    JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

    JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

    SN - 0916-8508

    IS - 12

    ER -