A novel integrated scheduling and allocation algorithm for data path synthesis

Proposes a novel integrated scheduling and allocation algorithm suitable for automatic data path synthesis. The algorithm is based on computation of an accurate lower bound on the cost of functional units. The algorithm produces optimal schedules in most cases.<
>