Maximal performance of pipelined circuits under hardware constraints

Abstract

The performance of pipelined designs is measured basically by three values: the clock cycle length, the initiation interval and the iteration time. In this paper we present a new technique for computing the maximal performance of pipelined implementation. Given a data flow graph specification and a set of resources, we derive lower bounds of the initiation interval and the iteration time achievable by any pipelined implementation.