Fast scheduling and allocation algorithms for entropy CODEC

Katsuharu Suzuki, Nozomu Togawa, Masao Sato, Tatsuo Ohtsuki

    Research output: Contribution to journalArticle

    Abstract

    Entropy coding/decoding are implemented on FPGAs as a fast and flexible system in which high-level synthesis technologies are key issues. In this paper, we propose scheduling and allocation algorithms for behavioral descriptions of entropy CODEC. The scheduling algorithm employs a control-flow graph as input and finds a solution with minimal hardware cost and execution time by merging nodes in the control-flow graph. The allocation algorithm assigns operations to operators with various bit lengths. As a result, register-transfer level descriptions are efficiently obtained from behavioral descriptions of entropy CODEC with complicated control flow and variable bit lengths. Experimental results demonstrate that our algorithms synthesize the same circuits as manually designed within one second.

    Original languageEnglish
    Pages (from-to)982-992
    Number of pages11
    JournalIEICE Transactions on Information and Systems
    VolumeE80-D
    Issue number10
    Publication statusPublished - 1997

    Fingerprint

    Flow graphs
    Entropy
    Scheduling
    Scheduling algorithms
    Merging
    Flow control
    Decoding
    Field programmable gate arrays (FPGA)
    Mathematical operators
    Hardware
    Networks (circuits)
    Costs
    High level synthesis

    Keywords

    • Allocation
    • Control-flow graph
    • Entropy CODEC
    • Scheduling

    ASJC Scopus subject areas

    • Information Systems
    • Computer Graphics and Computer-Aided Design
    • Software

    Cite this

    Fast scheduling and allocation algorithms for entropy CODEC. / Suzuki, Katsuharu; Togawa, Nozomu; Sato, Masao; Ohtsuki, Tatsuo.

    In: IEICE Transactions on Information and Systems, Vol. E80-D, No. 10, 1997, p. 982-992.

    Research output: Contribution to journalArticle

    Suzuki, Katsuharu ; Togawa, Nozomu ; Sato, Masao ; Ohtsuki, Tatsuo. / Fast scheduling and allocation algorithms for entropy CODEC. In: IEICE Transactions on Information and Systems. 1997 ; Vol. E80-D, No. 10. pp. 982-992.
    @article{f637510aa799408586e596a02c094edf,
    title = "Fast scheduling and allocation algorithms for entropy CODEC",
    abstract = "Entropy coding/decoding are implemented on FPGAs as a fast and flexible system in which high-level synthesis technologies are key issues. In this paper, we propose scheduling and allocation algorithms for behavioral descriptions of entropy CODEC. The scheduling algorithm employs a control-flow graph as input and finds a solution with minimal hardware cost and execution time by merging nodes in the control-flow graph. The allocation algorithm assigns operations to operators with various bit lengths. As a result, register-transfer level descriptions are efficiently obtained from behavioral descriptions of entropy CODEC with complicated control flow and variable bit lengths. Experimental results demonstrate that our algorithms synthesize the same circuits as manually designed within one second.",
    keywords = "Allocation, Control-flow graph, Entropy CODEC, Scheduling",
    author = "Katsuharu Suzuki and Nozomu Togawa and Masao Sato and Tatsuo Ohtsuki",
    year = "1997",
    language = "English",
    volume = "E80-D",
    pages = "982--992",
    journal = "IEICE Transactions on Information and Systems",
    issn = "0916-8532",
    publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
    number = "10",

    }

    TY - JOUR

    T1 - Fast scheduling and allocation algorithms for entropy CODEC

    AU - Suzuki, Katsuharu

    AU - Togawa, Nozomu

    AU - Sato, Masao

    AU - Ohtsuki, Tatsuo

    PY - 1997

    Y1 - 1997

    N2 - Entropy coding/decoding are implemented on FPGAs as a fast and flexible system in which high-level synthesis technologies are key issues. In this paper, we propose scheduling and allocation algorithms for behavioral descriptions of entropy CODEC. The scheduling algorithm employs a control-flow graph as input and finds a solution with minimal hardware cost and execution time by merging nodes in the control-flow graph. The allocation algorithm assigns operations to operators with various bit lengths. As a result, register-transfer level descriptions are efficiently obtained from behavioral descriptions of entropy CODEC with complicated control flow and variable bit lengths. Experimental results demonstrate that our algorithms synthesize the same circuits as manually designed within one second.

    AB - Entropy coding/decoding are implemented on FPGAs as a fast and flexible system in which high-level synthesis technologies are key issues. In this paper, we propose scheduling and allocation algorithms for behavioral descriptions of entropy CODEC. The scheduling algorithm employs a control-flow graph as input and finds a solution with minimal hardware cost and execution time by merging nodes in the control-flow graph. The allocation algorithm assigns operations to operators with various bit lengths. As a result, register-transfer level descriptions are efficiently obtained from behavioral descriptions of entropy CODEC with complicated control flow and variable bit lengths. Experimental results demonstrate that our algorithms synthesize the same circuits as manually designed within one second.

    KW - Allocation

    KW - Control-flow graph

    KW - Entropy CODEC

    KW - Scheduling

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

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

    M3 - Article

    AN - SCOPUS:0031248267

    VL - E80-D

    SP - 982

    EP - 992

    JO - IEICE Transactions on Information and Systems

    JF - IEICE Transactions on Information and Systems

    SN - 0916-8532

    IS - 10

    ER -