A new applicative design language is proposed for developing generators of data-path modules from hardware algorithms. The language includes a set of primitives that represent placement operations, parameterized cells, routing patterns and a set of transformation rules specifying modifications of the module topology without changing its functionality. Using the language, a hardware algorithm designer can easily define both the topological and geometrical specifications of module generation directly at the functional level without engaged in the layout details. A sketch of the language and an example of module design with the language is presented.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Vasily G. MOSHNYAGA, Keikichi TAMARU, Hiroto YASUURA, "A Language for Designing Module Generators" in IEICE TRANSACTIONS on Information,
vol. E76-D, no. 9, pp. 1066-1074, September 1993, doi: .
Abstract: A new applicative design language is proposed for developing generators of data-path modules from hardware algorithms. The language includes a set of primitives that represent placement operations, parameterized cells, routing patterns and a set of transformation rules specifying modifications of the module topology without changing its functionality. Using the language, a hardware algorithm designer can easily define both the topological and geometrical specifications of module generation directly at the functional level without engaged in the layout details. A sketch of the language and an example of module design with the language is presented.
URL: https://global.ieice.org/en_transactions/information/10.1587/e76-d_9_1066/_p
Copy
@ARTICLE{e76-d_9_1066,
author={Vasily G. MOSHNYAGA, Keikichi TAMARU, Hiroto YASUURA, },
journal={IEICE TRANSACTIONS on Information},
title={A Language for Designing Module Generators},
year={1993},
volume={E76-D},
number={9},
pages={1066-1074},
abstract={A new applicative design language is proposed for developing generators of data-path modules from hardware algorithms. The language includes a set of primitives that represent placement operations, parameterized cells, routing patterns and a set of transformation rules specifying modifications of the module topology without changing its functionality. Using the language, a hardware algorithm designer can easily define both the topological and geometrical specifications of module generation directly at the functional level without engaged in the layout details. A sketch of the language and an example of module design with the language is presented.},
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - A Language for Designing Module Generators
T2 - IEICE TRANSACTIONS on Information
SP - 1066
EP - 1074
AU - Vasily G. MOSHNYAGA
AU - Keikichi TAMARU
AU - Hiroto YASUURA
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E76-D
IS - 9
JA - IEICE TRANSACTIONS on Information
Y1 - September 1993
AB - A new applicative design language is proposed for developing generators of data-path modules from hardware algorithms. The language includes a set of primitives that represent placement operations, parameterized cells, routing patterns and a set of transformation rules specifying modifications of the module topology without changing its functionality. Using the language, a hardware algorithm designer can easily define both the topological and geometrical specifications of module generation directly at the functional level without engaged in the layout details. A sketch of the language and an example of module design with the language is presented.
ER -