A resynthesis approach for network optimization

1 January 1991

conference paper
Published by Association for Computing Machinery (ACM)

p. 458-463
https://doi.org/10.1145/127601.127712

Abstract

We resent a new al orithm RENO (Resynthesis for { i! Networ Optimization) or the optimization of multi-level combinational networks. In RENO, a given network is minimized for area by optimally resynthesizing each gate, using other existing gates in the network. The resynthesis process is based on a covering-set algorithm, which enables us to resynthesize usin complex gates instead of k only simple gates (e.g., NA D and NOR), thereby exploring more reconfiguration ossibilities. Due to the l? reconfiguration ability of the R NO algorithm, networks optimized by RENO have good ~ality even if no network don’t-care is used. The RE O algorithm has been implemented in both cube and shared-OBDD data strttcttrres. Experimental results obtained by RENO for benchmark functions and comparison with the optimization algorithm used in MIS 2.2 show that RENO is very effective for multi-level network optimization.

Keywords

This publication has 0 references indexed in Scilit: