An Integrated and Accelerated ILP Solution for Scheduling, Module Allocation, and Binding in Datapath Synthesis

We present an optimum and integrated solution to the problems of scheduling, allocation, and binding using an integer linear program (UP) that minimizes a weighted sum of module area and total ezecution time under very general assumptions of module capability. Two important eztensions are the use of pipelined functional units and operator chaining. The version of the ILP presented accelerates the solution in various ways.