Constraint improvements for MILP-based hardware synthesis

This paper describes work which improves the performance of MILP-based hardware synthesis by tightening the constraint system. Two improvements are described. The first estimates the minimum time that a value can usefully exist and adds constraints which express this. The second reformulates scheduling constraints which prevent component usage conflicts to better match a novel LP-based branch-and-bound algorithm.