LEAP: Learning guided Quality Cut selection for faster Technology Mapping

Technology mapping of the logic synthesis tool ABC transforms homogeneous Boolean circuit representations (e.g., and-inverter graphs, majority-inverter graphs etc.) into Application-Specific Integrated Circuit (ASIC) targets using a cut-based Boolean matching algorithm. This entails exposing numerous k-feasible cuts to the mapping algorithm to identify an optimal match of supergate (combination of standard cells) that minimizes the overall delay without much area overhead. However, this process incurs significant timing overhead due to the need to evaluate boolean matching across an exponentially large number of cuts. We introduce LEAP: a novel machine learning-assisted cut sampling strategy that identifies and prioritizes high-quality cuts (based on delay) while filtering out low-quality ones for each node. Our extensive experimentation demonstrates that LEAP reduces the number of cuts exposed to the mapper by over 51% compared to the tool ABC, resulting in a 2% improvement in delay without incurring any area penalty. In addition, LEAP uses 35% fewer cuts with respect to the state-of-the-art SLAP tool with superior area-delay product in most cases.

Authors

Institutions

Publication Details

Published
2024-10-27
DOI
https://doi.org/10.1145/3676536.3676797
Citations
1
Primary Topic
Intellectual Property and Patents
Type
article
Field-Weighted Citation Impact
0.73
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

LEAP: Learning guided Quality Cut selection for faster Technology Mapping

Chandan Karfa, Animesh Basak Chowdhury, Sukanta Bhattacharjee, Chandrabhusan Reddy Chigarapally et al.
1 citations
Intellectual Property and Patents
0.73
article

LEAP: Learning guided Quality Cut selection for faster Technology Mapping

Chandan Karfa, Animesh Basak Chowdhury, Sukanta Bhattacharjee, Chandrabhusan Reddy Chigarapally, Harshwardhan Nitin Bhakkad
article en
1 citations

Abstract

Technology mapping of the logic synthesis tool ABC transforms homogeneous Boolean circuit representations (e.g., and-inverter graphs, majority-inverter graphs etc.) into Application-Specific Integrated Circuit (ASIC) targets using a cut-based Boolean matching algorithm. This entails exposing numerous k-feasible cuts to the mapping algorithm to identify an optimal match of supergate (combination of standard cells) that minimizes the overall delay without much area overhead. However, this process incurs significant timing overhead due to the need to evaluate boolean matching across an exponentially large number of cuts. We introduce LEAP: a novel machine learning-assisted cut sampling strategy that identifies and prioritizes high-quality cuts (based on delay) while filtering out low-quality ones for each node. Our extensive experimentation demonstrates that LEAP reduces the number of cuts exposed to the mapper by over 51% compared to the tool ABC, resulting in a 2% improvement in delay without incurring any area penalty. In addition, LEAP uses 35% fewer cuts with respect to the state-of-the-art SLAP tool with superior area-delay product in most cases.

Indian Institute of Technology Guwahati (IN), New York University (US)
Openalex Percentile: Top 19%
Intellectual Property and Patents
0.73
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.