Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Lower Bounds on the Iteration Time and the Initiation Interval of Functional Pipelining and Loop Folding
 

Summary: 1
Lower Bounds on the Iteration Time and the Initiation Interval of
Functional Pipelining and Loop Folding
Abstract--The performance of pipelined datapath implementations is measured basically by
three parameters: the clock cycle length, the initiation interval between successive iterations
(inverse of the throughput) and the iteration time (turn-around time). In this paper we
present a new method for computing performance bounds of pipelined implementations:
· Given an iterative behavior, a set of resource constraints and a target initiation interval,
we derive a lower bound on the iteration time achievable by any pipelined
implementation.
· Given an iterative behavior and a set of resource constraints, we derive a lower bound
on the initiation interval achievable by any pipelined implementation.
The method has a low complexity and it handles behavioral specifications containing loop
statements with inter-iteration data dependency and timing constrains.
1. Introduction
High level synthesis refers to the design process which transforms a behavioral specification of a
digital system into a register transfer level (RTL) structure. Two fundamental steps in high level
synthesis are scheduling and allocation. Scheduling assigns circuit operations to control steps
under resource constraints (e.g. functional units, registers and buses) and/or performance
constraint, while allocation assigns operations and data transfers to resources to realize the

  

Source: Aboulhamid, El Mostapha - Département d'Informatique et recherche opérationnelle, Université de Montréal

 

Collections: Engineering