A Mathematical Formulation of Allocation and Floorplanning Problem in VLSI Data Path Synthesis
Summary :
This paper presents a mathematical formulation of a data path allocation and floorplanning problem using the mixed integer linear programming, and shows some experimental results. We assume that a data flow graph and the scheduled result are given in advance. The chip area and total wire length are used for the quality measures of the solution for the problem. This method is applied to some examples, and compared with the other method reported previously in the points of the solution and computation time.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E77-A No.6 pp.1043-1049
- Publication Date
- 1994/06/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Computer Aided Design (CAD)
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, "A Mathematical Formulation of Allocation and Floorplanning Problem in VLSI Data Path Synthesis" in IEICE TRANSACTIONS on Fundamentals,
vol. E77-A, no. 6, pp. 1043-1049, June 1994, doi: .
Abstract: This paper presents a mathematical formulation of a data path allocation and floorplanning problem using the mixed integer linear programming, and shows some experimental results. We assume that a data flow graph and the scheduled result are given in advance. The chip area and total wire length are used for the quality measures of the solution for the problem. This method is applied to some examples, and compared with the other method reported previously in the points of the solution and computation time.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e77-a_6_1043/_p
Copy
@ARTICLE{e77-a_6_1043,
author={Shoichiro YAMADA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Mathematical Formulation of Allocation and Floorplanning Problem in VLSI Data Path Synthesis},
year={1994},
volume={E77-A},
number={6},
pages={1043-1049},
abstract={This paper presents a mathematical formulation of a data path allocation and floorplanning problem using the mixed integer linear programming, and shows some experimental results. We assume that a data flow graph and the scheduled result are given in advance. The chip area and total wire length are used for the quality measures of the solution for the problem. This method is applied to some examples, and compared with the other method reported previously in the points of the solution and computation time.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - A Mathematical Formulation of Allocation and Floorplanning Problem in VLSI Data Path Synthesis
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1043
EP - 1049
AU - Shoichiro YAMADA
PY - 1994
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E77-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 1994
AB - This paper presents a mathematical formulation of a data path allocation and floorplanning problem using the mixed integer linear programming, and shows some experimental results. We assume that a data flow graph and the scheduled result are given in advance. The chip area and total wire length are used for the quality measures of the solution for the problem. This method is applied to some examples, and compared with the other method reported previously in the points of the solution and computation time.
ER -
English
