data path synthesis; handling global time; global resource
This paper presents an algorithm and its implementation for performing scheduling and operator allocation for data path synthesis. The main advantage of this approach is that it is capable of handling global time constraint as compered to earlier system  which expected the designer to artificially imposes a time constraint on the individual blocks. This is achieved by judiciously distributing the time available over various blocks to reduce the globle resource to requirements. Another feature of over approach is that it is capable of handling a library which may have operators with different speeds for the same operation . It is proposed to integrate this scheme in the IDEA system.