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

    12 Citations (Scopus)

    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)156-163
    Number of pages8
    JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
    Publication statusPublished - 1994

    Fingerprint

    Routing algorithms
    Field programmable gate arrays (FPGA)
    Networks (circuits)

    ASJC Scopus subject areas

    • Computational Theory and Mathematics
    • Computer Science Applications
    • Hardware and Architecture
    • Electrical and Electronic Engineering

    Cite this

    @article{23b7dd4f7f79494389876ed85fc65fe3,
    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",
    language = "English",
    pages = "156--163",
    journal = "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems",
    issn = "0278-0070",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",

    }

    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

    Y1 - 1994

    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=0028697847&partnerID=8YFLogxK

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

    M3 - Article

    AN - SCOPUS:0028697847

    SP - 156

    EP - 163

    JO - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

    JF - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

    SN - 0278-0070

    ER -