TY - GEN
T1 - Optimal allocation and binding in high-level synthesis
AU - Rim, Minjoong
AU - Jain, Rajiv
AU - De Leone, Renato
PY - 1992
Y1 - 1992
N2 - In this paper, we 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. This is the first time that 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.
AB - In this paper, we 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. This is the first time that 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.
UR - http://www.scopus.com/inward/record.url?scp=0026980608&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0026980608
SN - 0818628227
T3 - Proceedings - Design Automation Conference
SP - 120
EP - 123
BT - Proceedings - Design Automation Conference
PB - Publ by IEEE
T2 - Proceedings of the 29th ACM/IEEE Design Automation Conference
Y2 - 8 June 1992 through 12 June 1992
ER -