A depth-constrained technology mapping algorithm for logic-blocks composed of tree-structured LUTs

Nozomu Togawa, Koji Ara, Masao Yanagisawa, Tatsuo Ohtsuki

    Research output: Contribution to journalArticle

    1 Citation (Scopus)

    Abstract

    This paper proposes a fast depth-constrained technology mapping algorithm for logic-blocks composed of tree-structured lookup tables. First, we propose a technology mapping algorithm which minimizes the number of logic-blocks if an input Boolean network is a tree. Second, we propose a technology mapping algorithm which minimizes logic depth for any input Boolean network. Finally, we combine those two technology mapping algorithms and propose an algorithm which realizes technology mapping whose depth is bounded by a given upper bound d c. Experimental results demonstrate the effectiveness and efficiency of the proposed algorithm.

    Original languageEnglish
    Pages (from-to)473-481
    Number of pages9
    JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    VolumeE82-A
    Issue number3
    Publication statusPublished - 1999

    Fingerprint

    Logic
    Boolean Networks
    Minimise
    Table lookup
    Look-up Table
    Upper bound
    Experimental Results
    Demonstrate

    Keywords

    • Logic depth
    • Logic-block
    • Lookup table
    • Technology mapping

    ASJC Scopus subject areas

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

    Cite this

    @article{1c6d9ce37d5642b5ad0a1d021016f670,
    title = "A depth-constrained technology mapping algorithm for logic-blocks composed of tree-structured LUTs",
    abstract = "This paper proposes a fast depth-constrained technology mapping algorithm for logic-blocks composed of tree-structured lookup tables. First, we propose a technology mapping algorithm which minimizes the number of logic-blocks if an input Boolean network is a tree. Second, we propose a technology mapping algorithm which minimizes logic depth for any input Boolean network. Finally, we combine those two technology mapping algorithms and propose an algorithm which realizes technology mapping whose depth is bounded by a given upper bound d c. Experimental results demonstrate the effectiveness and efficiency of the proposed algorithm.",
    keywords = "Logic depth, Logic-block, Lookup table, Technology mapping",
    author = "Nozomu Togawa and Koji Ara and Masao Yanagisawa and Tatsuo Ohtsuki",
    year = "1999",
    language = "English",
    volume = "E82-A",
    pages = "473--481",
    journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
    issn = "0916-8508",
    publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
    number = "3",

    }

    TY - JOUR

    T1 - A depth-constrained technology mapping algorithm for logic-blocks composed of tree-structured LUTs

    AU - Togawa, Nozomu

    AU - Ara, Koji

    AU - Yanagisawa, Masao

    AU - Ohtsuki, Tatsuo

    PY - 1999

    Y1 - 1999

    N2 - This paper proposes a fast depth-constrained technology mapping algorithm for logic-blocks composed of tree-structured lookup tables. First, we propose a technology mapping algorithm which minimizes the number of logic-blocks if an input Boolean network is a tree. Second, we propose a technology mapping algorithm which minimizes logic depth for any input Boolean network. Finally, we combine those two technology mapping algorithms and propose an algorithm which realizes technology mapping whose depth is bounded by a given upper bound d c. Experimental results demonstrate the effectiveness and efficiency of the proposed algorithm.

    AB - This paper proposes a fast depth-constrained technology mapping algorithm for logic-blocks composed of tree-structured lookup tables. First, we propose a technology mapping algorithm which minimizes the number of logic-blocks if an input Boolean network is a tree. Second, we propose a technology mapping algorithm which minimizes logic depth for any input Boolean network. Finally, we combine those two technology mapping algorithms and propose an algorithm which realizes technology mapping whose depth is bounded by a given upper bound d c. Experimental results demonstrate the effectiveness and efficiency of the proposed algorithm.

    KW - Logic depth

    KW - Logic-block

    KW - Lookup table

    KW - Technology mapping

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

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

    M3 - Article

    VL - E82-A

    SP - 473

    EP - 481

    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 - 3

    ER -