High-Level Synthesis Using Given Datapath Information

Toshiaki MIYAZAKI; Mitsuo IKEDA

High-Level Synthesis Using Given Datapath Information

Toshiaki MIYAZAKI, Mitsuo IKEDA

Full Text Views

0

Cite this

Summary :

We propose a high-level synthesis method that uses data path information given by a designer. The main purpose of this method is to generate a control unit, one of the most difficult aspects of hardware design. In general, designers can specify data paths easily. Therefore, we believe that basing a method on specified data path information is the best way to synthesize hardware that more closely satisfies the designer's requirements. Moreover, a datapath-constrained scheduling algorithm can perform both "scheduling" and "resource allocation" at the same time. In particular, the resource allocation explicitly decides used paths as well as functional modules in each execution state. This cannot be done with previously reported algorithms.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E76-A No.10 pp.1617-1625

Publication Date: 1993/10/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on VLSI Design and CAD Algorithms)

Category

Cite this

Copy

Toshiaki MIYAZAKI, Mitsuo IKEDA, "High-Level Synthesis Using Given Datapath Information" in IEICE TRANSACTIONS on Fundamentals, vol. E76-A, no. 10, pp. 1617-1625, October 1993, doi: .
Abstract: We propose a high-level synthesis method that uses data path information given by a designer. The main purpose of this method is to generate a control unit, one of the most difficult aspects of hardware design. In general, designers can specify data paths easily. Therefore, we believe that basing a method on specified data path information is the best way to synthesize hardware that more closely satisfies the designer's requirements. Moreover, a datapath-constrained scheduling algorithm can perform both "scheduling" and "resource allocation" at the same time. In particular, the resource allocation explicitly decides used paths as well as functional modules in each execution state. This cannot be done with previously reported algorithms.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e76-a_10_1617/_p

Copy

@ARTICLE{e76-a_10_1617,
author={Toshiaki MIYAZAKI, Mitsuo IKEDA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={High-Level Synthesis Using Given Datapath Information},
year={1993},
volume={E76-A},
number={10},
pages={1617-1625},
abstract={We propose a high-level synthesis method that uses data path information given by a designer. The main purpose of this method is to generate a control unit, one of the most difficult aspects of hardware design. In general, designers can specify data paths easily. Therefore, we believe that basing a method on specified data path information is the best way to synthesize hardware that more closely satisfies the designer's requirements. Moreover, a datapath-constrained scheduling algorithm can perform both "scheduling" and "resource allocation" at the same time. In particular, the resource allocation explicitly decides used paths as well as functional modules in each execution state. This cannot be done with previously reported algorithms.},
keywords={},
doi={},
ISSN={},
month={October},}

Copy

TY - JOUR
TI - High-Level Synthesis Using Given Datapath Information
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1617
EP - 1625
AU - Toshiaki MIYAZAKI
AU - Mitsuo IKEDA
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E76-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 1993
AB - We propose a high-level synthesis method that uses data path information given by a designer. The main purpose of this method is to generate a control unit, one of the most difficult aspects of hardware design. In general, designers can specify data paths easily. Therefore, we believe that basing a method on specified data path information is the best way to synthesize hardware that more closely satisfies the designer's requirements. Moreover, a datapath-constrained scheduling algorithm can perform both "scheduling" and "resource allocation" at the same time. In particular, the resource allocation explicitly decides used paths as well as functional modules in each execution state. This cannot be done with previously reported algorithms.
ER -