Computing lower bounds on functional units before scheduling

Presents a new algorithm for computing lower bounds on the number of functional units (FUs) required to schedule a data flow graph in a specified number of control steps. We use a formal approach to compute the bounds that can be proven to be tighter than those produced by existing methods, and that considers the interdependencies of the bounds on the different FU-types. This quick, yet accurate estimation of the number of FUs is used to generate resource constraints for a design, and thus reduce the design space.<
>