A Novel Basis for Logic Rewriting

Given a set of logic primitives and a Boolean function, <i>exact synthesis</i> finds the optimum representation (e.g., depth or size) of the function in terms of the primitives. Due to its high computational complexity, the use of exact synthesis is limited to small networks. Some logic rewriting algorithms use exact synthesis to replace small subnetworks by their optimum representations. However, conventional approaches have two major drawbacks. First, their scalability is limited, as Boolean functions are enumerated to precompute their optimum representations. Second, the strategies used to replace subnetworks are not satisfactory. We show how the use of exact synthesis for logic rewriting can be improved. To this end, we propose a novel method that includes various improvements over conventional approaches: (i) we improve the subnetwork selection strategy, (ii) we show how enumeration can be avoided, allowing our method to scale to larger subnetworks, and (iii) we introduce <i>XOR Majority Graphs</i> (XMGs) as compact logic representations that make exact synthesis more efficient. We show a 45.8% geometric mean reduction (taken over size, depth, and switching activity), a 6.5% size reduction, and depth · size reductions of 8.6%, compared to the academic state-of-the-art. Finally, we outperform 3 over 9 of the best known size results for the EPFL benchmark suite, reducing size by up to 11.5% and depth up to 46.7%.

Published in:
Proceedings of the 22nd Asia and South Pacific Design Automation Conference (ASP-DAC)
Presented at:
22nd Asia and South Pacific Design Automation Conference (ASP-DAC), Chiba, Japan, January 16-19, 2017
New York, Ieee

Note: The status of this file is: Anyone

 Record created 2017-01-10, last modified 2020-04-20

Download fulltext

Rate this document:

Rate this document:
(Not yet reviewed)