Optimal allocation and binding in high-level synthesis

The authors present an integer linear program (ILP) formulation for the allocation and binding problem in high-level synthesis. Given a behavioral specification and a time-step schedule of operations, the formulation minimizes wiring and multiplexer areas. An ILP model for minimizing multiplexer and wiring areas has been mathematically formulated and optimally solved. The model handles chaining, multi-cycle operations, pipelined modules, conditional branches and trades off wiring area with resource area.<
>