ELF: Efficient Logic Synthesis by Pruning Redundancy in Refactoring

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Tsaras, Dimitris, Li, Xing, Chen, Lei, Xie, Zhiyao, Yuan, Mingxuan
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866916891341094912
author Tsaras, Dimitris
Li, Xing
Chen, Lei
Xie, Zhiyao
Yuan, Mingxuan
author_facet Tsaras, Dimitris
Li, Xing
Chen, Lei
Xie, Zhiyao
Yuan, Mingxuan
contents In electronic design automation, logic optimization operators play a crucial role in minimizing the gate count of logic circuits. However, their computation demands are high. Operators such as refactor conventionally form iterative cuts for each node, striving for a more compact representation - a task which often fails 98% on average. Prior research has sought to mitigate computational cost through parallelization. In contrast, our approach leverages a classifier to prune unsuccessful cuts preemptively, thus eliminating unnecessary resynthesis operations. Experiments on the refactor operator using the EPFL benchmark suite and 10 large industrial designs demonstrate that this technique can speedup logic optimization by 3.9x on average compared with the state-of-the-art ABC implementation.
format Preprint
id arxiv_https___arxiv_org_abs_2508_08073
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle ELF: Efficient Logic Synthesis by Pruning Redundancy in Refactoring
Tsaras, Dimitris
Li, Xing
Chen, Lei
Xie, Zhiyao
Yuan, Mingxuan
Machine Learning
Hardware Architecture
Emerging Technologies
In electronic design automation, logic optimization operators play a crucial role in minimizing the gate count of logic circuits. However, their computation demands are high. Operators such as refactor conventionally form iterative cuts for each node, striving for a more compact representation - a task which often fails 98% on average. Prior research has sought to mitigate computational cost through parallelization. In contrast, our approach leverages a classifier to prune unsuccessful cuts preemptively, thus eliminating unnecessary resynthesis operations. Experiments on the refactor operator using the EPFL benchmark suite and 10 large industrial designs demonstrate that this technique can speedup logic optimization by 3.9x on average compared with the state-of-the-art ABC implementation.
title ELF: Efficient Logic Synthesis by Pruning Redundancy in Refactoring
topic Machine Learning
Hardware Architecture
Emerging Technologies
url https://arxiv.org/abs/2508.08073