Presentation
EDGE: DBMS-Empowered Boolean Decomposition for GIG Synthesis
DescriptionBoolean decomposition is a powerful technique in logic synthesis that breaks down Boolean functions into simpler components. Decomposition-based logic synthesis produces high-quality results and is effective with small-window optimization methods in Gate-Inverter Graphs (GIG). However, the efficiency limitations of current methods have restricted their potential in handling large and complex logic. To address this challenge, we propose a framework, EDGE, which leverages modern database techniques to accelerate Boolean decomposition, achieving better synthesis results while maintaining high efficiency. Experimental results demonstrate a runtime speedup of up to 21× and an overall reduction in node count of at least 15% compared to state-of-the-art synthesis methods.
Event Type
Research Manuscript
TimeTuesday, June 244:00pm - 4:15pm PDT
Location3006, Level 3
EDA
EDA5: RTL/Logic Level and High-level Synthesis