Formal Methods for Exact Analysis of Approximate Circuits

dc.contributor.authorVašíček, Zdeněkcs
dc.coverage.issue1cs
dc.coverage.volume7cs
dc.date.issued2019-12-21cs
dc.description.abstractApproximate circuits are digital circuits that are intentionally designed in such a way that the specification is violated in terms of functionality in order to obtain some improvements in power consumption, performance or area, in comparison with fully functional circuits.&nbsp; To design the approximate circuits, the synthesis tools rely on the availability of a procedure checking, whether the synthesized circuits meet a specification and/or provides information about circuit quality.<br>Compared to the traditional circuit design flow, the nature of the approximate circuits involves replacing the strict functional equivalence checking with a more advanced approach that enables us to quantify or guarantee the degree of similarity. The most common technique is to employ a circuit simulator for analysing responses for all input vectors. This approach allows us to simultaneously perform checking and quality assessment, but the exhaustive enumeration of the input vectors is tractable only for a small number of inputs. To avoid excessive run-times, a subset of all possible input vectors is typically used for complex circuits.&nbsp;This causes us, however, to lose the ability to guarantee that the quality of the synthesized circuits is within an acceptable range given in the specification.&nbsp; The main goal of this paper is to show how to adopt formal methods such as binary decision diagrams and satisfiability solvers for exhaustive analysis of approximate circuits without explicit enumeration of all input vectors. We survey the methods for exact computation of the most important error parameters used in the context of approximate computing, propose improved algorithms and provide a detailed analysis of their performance.&nbsp; The methods are benchmarked on a large set of key approximate circuits consisting of nearly 2,000 unique arithmetic instances with 8-, 12-, 16-, and 32-bit operands which helps us to identify the best algorithm and method for computation of a desired error parameter.&nbsp;en
dc.description.abstractApproximate circuits are digital circuits that are intentionally designed in such a way that the specification is violated in terms of functionality in order to obtain some improvements in power consumption, performance or area, in comparison with fully functional circuits.&nbsp; To design the approximate circuits, the synthesis tools rely on the availability of a procedure checking, whether the synthesized circuits meet a specification and/or provides information about circuit quality.<br>Compared to the traditional circuit design flow, the nature of the approximate circuits involves replacing the strict functional equivalence checking with a more advanced approach that enables us to quantify or guarantee the degree of similarity. The most common technique is to employ a circuit simulator for analysing responses for all input vectors. This approach allows us to simultaneously perform checking and quality assessment, but the exhaustive enumeration of the input vectors is tractable only for a small number of inputs. To avoid excessive run-times, a subset of all possible input vectors is typically used for complex circuits.&nbsp;This causes us, however, to lose the ability to guarantee that the quality of the synthesized circuits is within an acceptable range given in the specification.&nbsp; The main goal of this paper is to show how to adopt formal methods such as binary decision diagrams and satisfiability solvers for exhaustive analysis of approximate circuits without explicit enumeration of all input vectors. We survey the methods for exact computation of the most important error parameters used in the context of approximate computing, propose improved algorithms and provide a detailed analysis of their performance.&nbsp; The methods are benchmarked on a large set of key approximate circuits consisting of nearly 2,000 unique arithmetic instances with 8-, 12-, 16-, and 32-bit operands which helps us to identify the best algorithm and method for computation of a desired error parameter.&nbsp;en
dc.formattextcs
dc.format.extent177309-177331cs
dc.format.mimetypeapplication/pdfcs
dc.identifier.citationIEEE Access. 2019, vol. 7, issue 1, p. 177309-177331.en
dc.identifier.doi10.1109/ACCESS.2019.2958605cs
dc.identifier.issn2169-3536cs
dc.identifier.orcid0000-0002-2279-5217cs
dc.identifier.other161468cs
dc.identifier.researcheridA-3655-2016cs
dc.identifier.scopus14034787400cs
dc.identifier.urihttp://hdl.handle.net/11012/184169
dc.language.isoencs
dc.relation.ispartofIEEE Accesscs
dc.relation.urihttps://www.fit.vut.cz/research/publication/12133/cs
dc.rightsCreative Commons Attribution 4.0 Internationalcs
dc.rights.accessopenAccesscs
dc.rights.sherpahttp://www.sherpa.ac.uk/romeo/issn/2169-3536/cs
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/cs
dc.subjectapproximate computingen
dc.subjectapproximate circuitsen
dc.subjectbinary decision diagramsen
dc.subjecterror metricsen
dc.subjecterror analysisen
dc.subjectformal methodsen
dc.subjectsatisfiability solversen
dc.subjectquality assessmenten
dc.subjectapproximate computing
dc.subjectapproximate circuits
dc.subjectbinary decision diagrams
dc.subjecterror metrics
dc.subjecterror analysis
dc.subjectformal methods
dc.subjectsatisfiability solvers
dc.subjectquality assessment
dc.titleFormal Methods for Exact Analysis of Approximate Circuitsen
dc.title.alternativeFormal Methods for Exact Analysis of Approximate Circuitsen
dc.type.driverarticleen
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen
sync.item.dbidVAV-161468en
sync.item.dbtypeVAVen
sync.item.insts2025.10.14 14:13:23en
sync.item.modts2025.10.14 09:34:06en
thesis.grantorVysoké učení technické v Brně. Fakulta informačních technologií. Ústav počítačových systémůcs

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
08930546.pdf
Size:
6.04 MB
Format:
Adobe Portable Document Format
Description:
08930546.pdf