Core Concepts
E-Syn proposes using e-graph rewriting in logic synthesis to explore a wider design space and incorporate technology-aware cost functions for better optimization.
Abstract
The paper introduces E-Syn, a novel logic optimization method that leverages e-graphs for combinational logic rewriting. It addresses the limitations of existing approaches by exploring a diverse set of equivalent Boolean representations and allowing technology-aware cost functions. The proposed method achieves significant improvements in delay-oriented and area-oriented synthesis compared to traditional AIG-based logic synthesis flows. The paper also presents a detailed framework of E-Syn, including rewriting rules, extraction methods, regression models, and integration with existing synthesis flows. Experimental results demonstrate the effectiveness of E-Syn in reaching a wider design space and outperforming traditional logic synthesis approaches.
Abstract:
Logic synthesis is crucial in digital design flow.
Existing multi-level logic optimization algorithms have limitations.
E-Syn proposes using e-graphs for efficient logic rewriting.
Achieves significant improvements in delay and area optimizations.
Introduction:
Logic synthesis influences Quality of Results (QoR).
Technology-independent optimization followed by mapping.
ABC framework commonly used for And-Inverter Graph (AIG) representation.
Challenges include local greedy decisions and technology-independent metrics.
E-Graph Rewriting for Logic Synthesis:
Utilizes e-graph to represent equivalent Boolean functions efficiently.
Clusters equivalent classes into e-classes for compact representation.
Uses equality saturation technique with Boolean algebra rules for rewriting.
Extraction:
Traverses e-graph to select optimal logic form based on cost model.
Regression model predicts area and delay costs from AST features.
Experiment Result and Discussion:
Pool extraction method improves efficiency using technology-aware cost models.
Comparison shows E-Syn outperforms ABC flow in delay, area, and balanced optimizations.
Conclusion:
E-Syn extends e-graph optimization to bit-level logic rewriting, achieving wider design space exploration with technology-aware cost functions.
Stats
Experiments show our proposed approach achieves on average 15.29% delay saving in delay-oriented synthesis and 6.42% area saving for area-oriented synthesis.