Efficient timing constraint derivation for optimally retiming high speed processing units

A. Werf, van der, J. Meerbergen, van, E.H.L. Aarts, W.F.J. Verhaegh, P.E.R. Lippens

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

6 Citations (Scopus)


Retiming, including pipelining, is applied to make the processing units (PUs) run at a required throughput rate with a minimum number of registers. In the first step, a timing analysis of a PU is performed which results in inequality constraints on the operations' retimings. The constraints, together with a cost function expressing the number of registers in a retimed PU, form an instance of an integer linear programming problem, which is solved to optimality in the second step. In this paper, we concentrate on the constraint derivation task. We present two new constraint derivation algorithms, one of which is more memory efficient and the other more run-time efficient. We show that the run-time efficient algorithm makes it possible to minimize the area of a huge standard cell network, possibly representing a complete IC, within acceptable run-time limits.
Original languageEnglish
Title of host publicationProceedings of the 7th International Symposium on High-Level Synthesis (Niagara-on-the-Lake ON, Canada, May 18-20, 1994)
PublisherInstitute of Electrical and Electronics Engineers
Number of pages6
ISBN (Print)0-8186-5785-5
Publication statusPublished - 1994


Dive into the research topics of 'Efficient timing constraint derivation for optimally retiming high speed processing units'. Together they form a unique fingerprint.

Cite this