Data Path Synthesis With Global Time Constraint
Prashant Nedungadi, S. Balakrishnan, Alok Kumar · 2005
This paper presents an algorithm and its implementation for pe~orming 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 compared to earlier systems[I] which expected the designer to artificially impose a time constraint on the individual blocks. This is achieved by judiciously distributing the time available over various blocks to reduce the global resource requirements. Another feature of our 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 IDEAS system[2J.