A Scheduling Method Using Boolean Equations in High-Level Synthesis

Toshiaki MIYAZAKI  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E75-A   No.12   pp.1728-1731
Publication Date: 1992/12/25
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section LETTER (Special Section on the 1992 IEICE Fall Conference)
integer linear programming,  BDD,  data path,  

Full Text: PDF(332.3KB)>>
Buy this Article

This paper describes two algorithms based on Boolean formulations aimed at solving scheduling, the main subtask of data path synthesis. Using the first algorithm, all possible scheduling solutions can be obtained under a time constraint, something that cannot be accomplished with other available systems. The second algorithm produces feasible solutions without increasing the complexity of the problem. The effectiveness of the algorithms is confirmed through experimental studies.