Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3566097.3567890acmconferencesArticle/Chapter ViewAbstractPublication PagesaspdacConference Proceedingsconference-collections
research-article

Approximate Logic Synthesis by Genetic Algorithm with an Error Rate Guarantee

Published: 31 January 2023 Publication History

Abstract

Approximate computing is an emerging design technique for error-tolerant applications, which may improve circuit area, delay, or power consumption by trading off a circuit's correctness. In this paper, we propose a novel approximate logic synthesis approach based on genetic algorithm targeting at depth minimization with an error rate guarantee. We conduct experiments on a set of IWLS 2005 and MCNC benchmarks. The experimental results demonstrate that the depth can be reduced by up to 50%, and 22% on average under a 5% error rate constraint. As compared with the state-of-the-art method, our approach can achieve an average of 159% more depth reduction under the same 5% error rate constraint.

References

[1]
M. Barbareschi et al., "A Catalog-based AIG-Rewriting Approach to the Design of Approximate Components," IEEE Trans. Emerg. Topics Comput., 2022.
[2]
J. Echavarria et al., "Probabilistic Error Propagation through Approximated Boolean Networks," Proc. DAC, 2020, pp. 1--6.
[3]
C. M. Fiduccia et al., "A Linear-Time Heuristic for Improving Network Partitions," Proc. DAC, 1982, pp. 175--181.
[4]
J. Han et al., "Approximate Computing: An Emerging Paradigm for Energy-Efficient Design," Proc. ETS, 2013, pp. 1--6.
[5]
J. H. Holland, "Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence," MIT Press, 1992.
[6]
S. Karakatic et al., "Optimization of Combinational Logic Circuits with Genetic Programming," Elektronika ir Elektrotechnika, 2013.
[7]
B. W. Kernighan et al., "An Efficient Heuristic Procedure for Partitioning Graphs," The Bell System Technical Journal, 1970, pp. 291--307.
[8]
Y. Kim et al., "An Energy Efficient Approximate Adder with Carry Skip for Error Resilient Neuromorphic VLSI Systems," Proc. ICCAD, 2013, pp. 130--137.
[9]
P. Kulkarni et al., "Trading Accuracy for Power with an Underdesigned Multiplier Architecture," Proc. VLSID, 2011, pp. 346--351.
[10]
K. Y. Kyaw et al., "Low-Power High-Speed Multiplier for Error-Tolerant Application," Proc. EDSSC, 2010, pp. 1--4.
[11]
Y.-A Lai et al., "Efficient Synthesis of Approximate Threshold Logic Circuits with an Error Rate Guarantee," Proc. DATE, 2018, pp. 773--778.
[12]
J. Liang et al., "New Metrics for the Reliability of Approximate and Probabilistic Adders," IEEE Trans. Comput., 2013, pp. 1760--1771.
[13]
C. Liu et al., "A Low-Power, High-Performance Approximate Multiplier with Configurable Partial Error Recovery," Proc. DATE, 2014, pp. 1--4.
[14]
C. Meng et al., "ALSRAC: Approximate Logic Synthesis by Resubstitution with Approximate Care Set," Proc. DAC, 2020, pp. 1--6.
[15]
L. Hellerman, "A Catalog of Three-Variable Or-Invert and And-Invert Logical Circuits," IEEE Trans. Electron. Comput., 1963, pp. 198--223.
[16]
I. Scarabottolo et al., "Partition and Propagate: an Error Derivation Algorithm for the Design of Approximate Circuits," Proc. DAC, 2019, pp. 1--6.
[17]
S. Su et al., "Efficient Batch Statistical Error Estimation for Iterative Multi-level Approximate Logic Synthesis," Proc. DAC, 2018, pp. 1--6.
[18]
K. S. Tam et al., "An Efficient Approximate Node Merging with an Error Rate Guarantee," Proc. ASP-DAC, 2021, pp. 266--271.
[19]
Z. Vasicek et al., "Evolutionary Approach to Approximate Digital Circuits Design," IEEE Trans. Evol. Comput., 2015, pp. 432--444.
[20]
S. Venkataramani et al., "Substitute-and-Simplify: A Unified Design Paradigm for Approximate and Quality Configurable Circuits," Proc. DATE, 2013, pp. 1367--1372.
[21]
A. Wendler et al., "A fast BDD Minimization Framework for Approximate Computing," Proc. DATE, 2020, pp. 1372--1377.
[22]
S. Yang, "Logic Synthesis and Optimization Benchmarks," Microelectronics Center of North Carolina, Tech. Rep., 1991.
[23]
N. Zhu et al., "An Enhanced Low-Power High-Speed Adder for Error-Tolerant Application," Proc. ISIC, 2009, pp. 69--72.
[24]
Berkeley Logic Synthesis and Verification Group. ABC: A System for Sequential Synthesis and Verification [Online]. Available: http://www.eecs.berkeley.edu/~alanmi/abc
[25]
http://iwls.org/iwls2005/benchmarks.html

Cited By

View all
  • (2023)Feedback-Tuned Fuzzing for Accelerating Quality Verification of Approximate Computing Design2023 IEEE 29th International Symposium on On-Line Testing and Robust System Design (IOLTS)10.1109/IOLTS59296.2023.10224891(1-3)Online publication date: 3-Jul-2023

Index Terms

  1. Approximate Logic Synthesis by Genetic Algorithm with an Error Rate Guarantee
    Index terms have been assigned to the content through auto-classification.

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    ASPDAC '23: Proceedings of the 28th Asia and South Pacific Design Automation Conference
    January 2023
    807 pages
    ISBN:9781450397834
    DOI:10.1145/3566097
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    In-Cooperation

    • IPSJ
    • IEEE CAS
    • IEEE CEDA
    • IEICE

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 31 January 2023

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Research-article

    Conference

    ASPDAC '23
    Sponsor:

    Acceptance Rates

    ASPDAC '23 Paper Acceptance Rate 102 of 328 submissions, 31%;
    Overall Acceptance Rate 466 of 1,454 submissions, 32%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)35
    • Downloads (Last 6 weeks)5
    Reflects downloads up to 28 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Feedback-Tuned Fuzzing for Accelerating Quality Verification of Approximate Computing Design2023 IEEE 29th International Symposium on On-Line Testing and Robust System Design (IOLTS)10.1109/IOLTS59296.2023.10224891(1-3)Online publication date: 3-Jul-2023

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media