ULSB: a fast scheduling and binding algorithm for unrestricted libraries inside a RT space exploration strategy

This paper presents a method for solving scheduling problem in high-level synthesis. The main advantage of this method over those proposed up to now, lies in its capacity to handle unrestricted libraries. A library of this kind includes combinational and sequential multi-cycle functional units, multi-functional operational units, pipeline modules as well as different execution and different latency times for the same operation type in different modules. The computing time of this algorithm is quite low and gives very good results, so it has powerful applications in RT space exploration. The tool FIRES (Fast Intelligent RT Exploration System) is also presented