DocumentCode
1088093
Title
Optimal and heuristic algorithms for solving the binding problem
Author
Rim, Minjoong ; Mujumdar, Ashutosh ; Jain, Rajiv ; De Leone, Renato
Author_Institution
Dept. of Electr. & Comput. Eng., Wisconsin Univ., Madison, WI, USA
Volume
2
Issue
2
fYear
1994
fDate
6/1/1994 12:00:00 AM
Firstpage
211
Lastpage
225
Abstract
In this paper we present an optimal and a heuristic approach to solve the binding problem which occurs in high-level synthesis of digital systems. The optimal approach is based on an integer linear programming formulation. Given that such an approach is not practical for large problems, we then derive a heuristic from the ILP formulation which produces very good solutions in order of seconds. The heuristic is based on a network flow model and also considers floorplanning during the design process to minimize the interconnection area.<>
Keywords
VLSI; circuit layout CAD; integer programming; linear programming; logic CAD; binding problem; design process; digital systems; floorplanning; heuristic algorithms; high-level synthesis; integer linear programming; interconnection area minimisation; network flow model; optimal algorithms; Area measurement; Delay; Digital systems; Heuristic algorithms; Integer linear programming; Multiplexing; Network synthesis; Process design; Registers; Wires;
fLanguage
English
Journal_Title
Very Large Scale Integration (VLSI) Systems, IEEE Transactions on
Publisher
ieee
ISSN
1063-8210
Type
jour
DOI
10.1109/92.285747
Filename
285747
Link To Document