Presentation
Lightweight Structural Choices Operator for Technology Mapping
DescriptionTechnology mapping quality heavily depends on the subject graph structure. To overcome structural biases, operators construct choice nodes to enable mappings with improved node and level counts. Nevertheless, state-of-the-art structural choice operators scale poorly with graph size.
We present the lightweight structural choices (LCH) operator that incorporates equivalencies by processing only subparts of the graph.
We propose multiple heuristics that rely on specific node extraction orders and subpart sizes to extract non-overlapping components.
Compared to state-of-the-art methods on EPFL circuits, LCH is 14x faster enduring a small sacrifice in node count (10%) while improving level reduction by up to 6%.
We present the lightweight structural choices (LCH) operator that incorporates equivalencies by processing only subparts of the graph.
We propose multiple heuristics that rely on specific node extraction orders and subpart sizes to extract non-overlapping components.
Compared to state-of-the-art methods on EPFL circuits, LCH is 14x faster enduring a small sacrifice in node count (10%) while improving level reduction by up to 6%.
Event Type
Research Manuscript
TimeThursday, July 13th1:55pm - 2:10pm PDT
Location3002, 3rd Floor
EDA
RTL/Logic Level and High-level Synthesis