Retiming for DSM with area-delay trade-offs and delay constraints
Tabbara, A.
Brayton, R.K.
Newton, A.R.
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA;
This paper appears in: Design Automation Conference, 1999. Proceedings. 36th
Publication Date: 1999
On page(s): 725-730
Meeting Date: 06/21/1999 - 06/25/1999
Location: New Orleans, LA, USA
ISBN: 1-58113-092-9
References Cited: 11
INSPEC Accession Number: 6496059
Digital Object Identifier: 10.1109/DAC.1999.782053
Current Version Published: 2002-08-06
Abstract
The concept of improving the timing behavior of a circuit by
relocating registers is called retiming and was first presented by
Leiserson and Saxe [1991]. They showed that the problem of determining
an equivalent minimum area (total number of registers) circuit is
polynomial-time solvable. In this work we show how this approach can be
reapplied in the DSM domain when area-delay trade-offs and delay
constraints are considered. The main result is that the concavity of the
tradeoff function allows for a casting of this DSM problem into a
classical minimum area retiming problem whose solution is polynomial
time solvable
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
