Sciweavers

Share
FPGA
2009
ACM

Scalable don't-care-based logic optimization and resynthesis

9 years 1 months ago
Scalable don't-care-based logic optimization and resynthesis
We describe an optimization method for combinational and sequential logic networks, with emphasis on scalability and the scope of optimization. The proposed resynthesis (a) is capable of substantial logic restructuring, (b) is customizable to solve a variety of optimization tasks, and (c) has reasonable runtime on industrial designs. The approach uses don’t cares computed for a window surrounding a node and can take into account external don’t cares (e.g. unreachable states). It uses a SAT solver and interpolation to find a new representation for a node. This representation can be in terms of inputs from other nodes in the window thus effecting Boolean re-substitution. Experimental results on 6-input LUT networks after high effort synthesis show substantial reductions in area and delay. When applied to 20 large academic benchmarks, the LUT count and logic level is reduced by 45.0% and 12.2%, respectively. The longest runtime for synthesis and mapping is about two minutes. When app...
Alan Mishchenko, Robert K. Brayton, Jie-Hong Rolan
Added 19 May 2010
Updated 19 May 2010
Type Conference
Year 2009
Where FPGA
Authors Alan Mishchenko, Robert K. Brayton, Jie-Hong Roland Jiang, Stephen Jang
Comments (0)
books