AccALS: Accelerating Approximate Logic Synthesis by Selection of Multiple Local Approximate Changes
Xuan Wang, Sijun Tao, Jingjing Zhu, Yiyu Shi, Weikang Qian
摘要
Approximate computing is an energy-efficient computing paradigm for error-tolerant applications. To automatically synthesize approximate circuits, many iterative approximate logic synthesis (ALS) methods have been proposed. However, most of them do not consider applying multiple local approximate changes (LACs) in a single round, which can lead to a much shorter runtime. In this paper, we propose AccALS, a novel framework for Accelerating iterative ALS flows, based on simultaneous selection of multiple LACs in a single round. When selecting multiple LACs, there may exist conflicts among them. One important component of AccALS is a novel method to solve the conflicts. Another is an efficient measure for the mutual influence between two LACs. With its help, the problem of selecting multiple LACs is transformed into a maximum independent set problem to solve. The experimental results showed that compared to a state-of-the-art method, AccALS accelerates by up to 24.6× with a negligible circuit quality loss.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
相关 Paper
- SEALS: sensitivity-driven efficient approximate logic synthesisChang Meng, Xuan Wang, Jiajun Sun, Sijun Tao 等DAC 2022 · 被引用 11 次
- Rank-based Multi-objective Approximate Logic Synthesis via Monte Carlo Tree SearchYuyang Ye, Xiangfei Hu, Yuchen Liu, Peng Xu 等DAC 2025 · 被引用 1 次
- ALSRAC: Approximate Logic Synthesis by Resubstitution with Approximate Care SetChang Meng, Weikang Qian, Alan MishchenkoDAC 2020 · 被引用 38 次
- SAS - A Framework for Symmetry-based Approximate SynthesisNiklas Jungnitz, Oliver KeszöczeDAC 2024
- ADVISOR: Approximate Computing-frienDly High-LeVel Synthesis DesIgn Space ExplORerBaharealsadat Parchamdar, Benjamin Carrión SchäferDAC 2025 · 被引用 1 次
