An Optimal Block Terminal Assignment Algorithm for VLSI Data Path Allocation
Summary :
This paper presents an efficient optimal block terminal assignment algorithm based on the integer programming for a data path synthesis. The problem is to assign buses to commutable terminals on functional units such that the number of buses is minimum, when the scheduling and allocation of operations and registers have been done. Three methods are used in the algorithm to decrease the amount of computation.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E80-A No.3 pp.564-566
- Publication Date
- 1997/03/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section LETTER (Special Section of Selected Papers from the 9th Karuizawa Workshop on Circuits and Systems)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Shoichiro YAMADA, "An Optimal Block Terminal Assignment Algorithm for VLSI Data Path Allocation" in IEICE TRANSACTIONS on Fundamentals,
vol. E80-A, no. 3, pp. 564-566, March 1997, doi: .
Abstract: This paper presents an efficient optimal block terminal assignment algorithm based on the integer programming for a data path synthesis. The problem is to assign buses to commutable terminals on functional units such that the number of buses is minimum, when the scheduling and allocation of operations and registers have been done. Three methods are used in the algorithm to decrease the amount of computation.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e80-a_3_564/_p
Copy
@ARTICLE{e80-a_3_564,
author={Shoichiro YAMADA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Optimal Block Terminal Assignment Algorithm for VLSI Data Path Allocation},
year={1997},
volume={E80-A},
number={3},
pages={564-566},
abstract={This paper presents an efficient optimal block terminal assignment algorithm based on the integer programming for a data path synthesis. The problem is to assign buses to commutable terminals on functional units such that the number of buses is minimum, when the scheduling and allocation of operations and registers have been done. Three methods are used in the algorithm to decrease the amount of computation.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - An Optimal Block Terminal Assignment Algorithm for VLSI Data Path Allocation
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 564
EP - 566
AU - Shoichiro YAMADA
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E80-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 1997
AB - This paper presents an efficient optimal block terminal assignment algorithm based on the integer programming for a data path synthesis. The problem is to assign buses to commutable terminals on functional units such that the number of buses is minimum, when the scheduling and allocation of operations and registers have been done. Three methods are used in the algorithm to decrease the amount of computation.
ER -
English
