Conditional and unconditional hardware sharing in pipelinesynthesis

摘要

This paper addresses the following problem: given a set ofnfunctional units and a data introduction interval, find a pipelinednschedule for the given behavioral description (which may containnconditionals) that minimizes the number of pipeline stages. The approachntaken to solve this problem is to do conditional and unconditionalnhardware sharing simultaneously while scheduling. A two-phase algorithmnis used. The first phase tries to find a feasible solution (if itnexists), while the second phase improves the initial solution bynreducing the number of pipeline stages and the number of pipelinenregisters. The fast heuristics used to do this have been found to givenexcellent results