An optimal block terminal assignment algorithm for VLSI data path allocation

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E80-A, Issue 3, 1997, Pages 564-566

  Yamada, Shoichiro ^a  

^a Osaka Prefecture University   (Japan)

Author keywords

Block terminal assignment; Data path allocation; High level synthesis; Integer linear programming

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT; INTEGER PROGRAMMING; LINEAR PROGRAMMING; RESOURCE ALLOCATION; VLSI CIRCUITS;

BLOCK TERMINAL ASSIGNMENT; DATA PATH ALLOCATION; HIGH LEVEL SYNTHESIS;

ALGORITHMS;

EID: 0031099129     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (4)

1. M. Rim, R. Jain, and R.D. Leone, "Optimal allocation and binding in high-level synthesis," Proc. 29th Design Automation Conf., pp. 120-123, 1992.
2. T. Kim and C.L. Liu, "Utilization of multiport memories in data path synthesis," Proc. 30th Design Automation Conf., pp.298-302, 1993.
3. B.M. Pangrle, "On the complexity of connectivity binding," IEEE Trans. Comput.-Aided Des. Integrated Circuits & Syst. vol.10, pp. 1460-1465, Nov. 1991.
4. "LINDO: Linear Interactive Discrete Optimizer," Scientific, Redwood City, ÇA, I982.