This paper proposes a behavioral level partitioning method for efficient behavioral synthesis from a large sequential program consisting of a set of functions. Our method optimally determines functions to be inlined into the main module and the other functions to be synthesized into sub modules in such a way that the overall datapath is minimized while the complexity of individual modules is lower than a certain level. The partitioning problem is formulated as an integer programming problem. Experimental results show the effectiveness of the proposed method.
Also, we presented a method which minimizes the overall datapath area while diminishing the complexity of the controller in individual modules REF .
Function-Level Partitioning of Sequential Programs for Efficient Behavioral Synthesis
IEICE Transactions
IEICE Transactions
Computer Science