New pipeline scheduling algorithm that considers control complexity

This paper presents a new scheduling algorithm that considers the control c omplexity while synthesizing the pipelined datapaths. Previous approaches, such as Sehwa,. ignore the control space and cannot guarantee finding the o ptimal solution after overall high-level synthesis has been done. The propo sed algorithm can handle conditional branches not only for resource sharing but also for control complexity. Experimental results show that this appro ach carl produce more area-efficient designs.