
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

A Mathematical Formulation of Allocation and Floorplanning Problem in VLSI Data Path Synthesis
Shoichiro YAMADA
Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Vol.E77A
No.6
pp.10431049 Publication Date: 1994/06/25
Online ISSN:
DOI:
Print ISSN: 09168508 Type of Manuscript: PAPER Category: Computer Aided Design (CAD) Keyword: highlevel synthesis, data path allocation, floorplanning, mixed integer linear programming,
Full Text: PDF>>
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.

