Preprint

E-ALS: Approximation-Potential-Aware E-Graph Rewriting for Approximate Logic Synthesis

Bin Sun Jia-Nan Mu Jia-Xi Zhang Ren-Gang Zhang Zhi-Teng Chao J. Ye Hua-Wei Li

Sep 2026 · 0 citations · 32 references

Computer Science

TL;DR

E-ALS is proposed, an e-graph-based framework for approximation-aware structural search that combines Function-Reduced Saturation, an ALS-coupled surrogate, search-based extraction, and budget-guided refinement to identify approximation-friendly equivalent structures.

Abstract

Approximate logic synthesis (ALS) improves circuit power, performance, and area by trading exact correctness for bounded functional error. However, existing structural ALS methods largely overlook structural bias: even functionally equivalent netlists can expose markedly different approximation opportunities and lead to substantially different outcomes under the same downstream ALS flow. Our experiments show that this effect can induce final area gaps of up to 42.77%. To unlock this opportunity, we propose E-ALS, an e-graph-based framework for approximation-aware structural search. E-ALS combines Function-Reduced Saturation, an ALS-coupled surrogate, search-based extraction, and budget-guided refinement to identify approximation-friendly equivalent structures. Experiments on well-established arithmetic and logic benchmarks show that E-ALS achieves additional area reductions of 3.2 and 7.0 percentage points under maximum Hamming-Distance and Error-Distance constraints, respectively. Code is available in https://github.com/ZenuSunB/Ecompile.git.

DOI arXiv Semantic Scholar

View source

Similar papers

Preprint Sep 2026

Integrating Approximate Logic Synthesis into Approximate High-Level Synthesis

Approximate high-level synthesis (HLS) and approximate logic synthesis (ALS) are two techniques for generating approximate circuits. They operate at different granularities. Approximate HLS typically modifies instructions in a control and data flow graph, whereas ALS modifies gates and interconnects in a gate-level net...

Jian Shi, Rui-Cheng Dai, Chang Meng et al. · 0 citations

Cedar: Learning to Optimize RTL via Accumulating Verified Rewrite Rules

Unknown authors · 0 citations

#artificial intelligence Preprint Sep 2026

LevelSyn: Physical-Aware Logic Synthesis via Level-Asynchronous Graph Neural Networks

LevelSyn is a novel physical-aware logic synthesis framework that integrates hierarchical representation learning with a wirelength-driven optimization engine that significantly outperforms state-of-the-art methods on the EPFL benchmark suite.

Jing-Yi Zhou, Zhengyuan Shi, Zi-Yang Zheng et al. · 0 citations

Randomized Transduction for High-Effort Logic Synthesis

A novel variation of high-effort logic synthesis called transduction is presented, which performs transformation and reduction using don’t-cares to restructure the circuit.

Yukio Miyasaka, Alan Mishchenko, John Wawrzynek et al. · 0 citations

#artificial intelligence Preprint Sep 2026

PerfReasoning: How Well Do LLMs Reason on Hardware Performance?

PerfReasoning is introduced, a benchmark that evaluates LLMs both as direct performance reasoners and as generators of analytical performance-model code, exposing the gap between plausible architectural reasoning and reliable performance-model construction.

Da Zhao, K. Sankaralingam, Christos Kozyrakis et al. · 0 citations

Preprint Aug 2026

SYNTLOG: FSM Benchmarks Evaluation for FPGA

We introduce a curated benchmark collection of \num{101} FSM descriptions organized into five size classes (\emph{small}, \emph{medium}, \emph{large}, \emph{huge}, \emph{super-huge}), spanning tens to thousands of states and up to hundreds of inputs and outputs. Using these benchmarks we compare an architecture-indepen...

S. Baranov, D. Gorodecky · 0 citations