Fast Minimum-Register Retiming via Binary Maximum-Flow
Hurst, Aaron P.
Mishchenko, Alan
Brayton, Robert K.
This paper appears in: Formal Methods in Computer Aided Design, 2007. FMCAD '07
Publication Date: 11-14 Nov. 2007
On page(s): 181-187
Location: Austin, TX, USA,
ISBN: 978-0-7695-3023-9
Digital Object Identifier: 10.1109/FAMCAD.2007.31
Current Version Published: 2007-12-12
Abstract
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one, which involves the minimum amount of register movement. Existing methods solve this problem as an instance of minimum-cost network flow, an asymptotically and practically more difficult problem than maximum flow. Furthermore, because all flows are unitary, the problem can be simplified to binary marking. Our algorithm has a worst-case bound of O(R^2 E), where R is the number of registers and E the number of pair-wise connections. We demonstrate on a set of circuits that our formulation is 5x faster than minimum-cost-based methods.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
