Design Space Exploration of Multi-output Logic Function Approximations
Approximate Computing has emerged as a design paradigm that allows to decrease hardware costs by reducing the accuracy of the computation for applications that are robust against such errors. In Boolean logic approximation, the number of terms and literals of a logic function can be reduced by allow...
Uloženo v:
| Vydáno v: | 2018 IEEE/ACM International Conference on Computer-Aided Design (ICCAD) s. 1 - 8 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
ACM
01.11.2018
|
| Témata: | |
| ISSN: | 1558-2434 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Approximate Computing has emerged as a design paradigm that allows to decrease hardware costs by reducing the accuracy of the computation for applications that are robust against such errors. In Boolean logic approximation, the number of terms and literals of a logic function can be reduced by allowing to produce erroneous outputs for some input combinations. This paper proposes a novel methodology for the approximation of multi-output logic functions. Related work on multi-output logic approximation minimizes each output function separately. In this paper, we show that thereby a huge optimization potential is lost. As a remedy, our methodology considers the effect on all output functions when introducing errors thus exploiting the cross-function minimization potential. Moreover, our approach is integrated into a design space exploration technique to obtain not only a single solution but a Pareto-set of designs with different trade-offs between hardware costs (terms and literals) and error (number of minterms that have been falsified). Experimental results show our technique is very efficient in exploring Pareto-optimal fronts. For some benchmarks, the number of terms could be reduced from an accurate function implementation by up to 15% and literals by up to 19% with degrees of inaccuracy around 0.1% w.r.t. accurate designs. Moreover, we show that the Pareto-fronts obtained by our methodology dominate the results obtained when applying related work. |
|---|---|
| AbstractList | Approximate Computing has emerged as a design paradigm that allows to decrease hardware costs by reducing the accuracy of the computation for applications that are robust against such errors. In Boolean logic approximation, the number of terms and literals of a logic function can be reduced by allowing to produce erroneous outputs for some input combinations. This paper proposes a novel methodology for the approximation of multi-output logic functions. Related work on multi-output logic approximation minimizes each output function separately. In this paper, we show that thereby a huge optimization potential is lost. As a remedy, our methodology considers the effect on all output functions when introducing errors thus exploiting the cross-function minimization potential. Moreover, our approach is integrated into a design space exploration technique to obtain not only a single solution but a Pareto-set of designs with different trade-offs between hardware costs (terms and literals) and error (number of minterms that have been falsified). Experimental results show our technique is very efficient in exploring Pareto-optimal fronts. For some benchmarks, the number of terms could be reduced from an accurate function implementation by up to 15% and literals by up to 19% with degrees of inaccuracy around 0.1% w.r.t. accurate designs. Moreover, we show that the Pareto-fronts obtained by our methodology dominate the results obtained when applying related work. |
| Author | Wildermann, Stefan Teich, Jurgen Echavarria, Jorge |
| Author_xml | – sequence: 1 givenname: Jorge surname: Echavarria fullname: Echavarria, Jorge organization: Department of Computer Science, Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), Erlangen, 91058, Germany – sequence: 2 givenname: Stefan surname: Wildermann fullname: Wildermann, Stefan organization: Department of Computer Science, Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), Erlangen, 91058, Germany – sequence: 3 givenname: Jurgen surname: Teich fullname: Teich, Jurgen organization: Department of Computer Science, Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), Erlangen, 91058, Germany |
| BookMark | eNotjctOwzAURA0CibZ0zYKNfyDFrxvby6o0gJSqi7KvHMeujEJs5SGVvycKrI40ZzSzRHdtbB1CT5RsKBXwwpkgMofNTA03aDmlhIMGIm_RggKojAkuHtC6778IIUxJOukFKl5dHy4tPiVjHd5fUxM7M4TY4ujxYWyGkMVxSOOAy3gJFhdja2e9TamL1_A9l_tHdO9N07v1P1foVOw_d-9ZeXz72G3LzDAhh8xoyQwRVnHNreC14cAlCGFEZXlua228B2Y9oRXImliovWVQWW2Ik4qv0PPfanDOnVM3vXc_ZwVKylzxX5g_TPc |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1145/3240765.3240795 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEL IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEL url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISBN | 1450359507 9781450359504 |
| EISSN | 1558-2434 |
| EndPage | 8 |
| ExternalDocumentID | 8587768 |
| Genre | orig-research |
| GroupedDBID | 123 6IE 6IF 6IH 6IL 6IN AAWTH ABLEC ADZIZ ALMA_UNASSIGNED_HOLDINGS APO BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO FEDTE IEGSK IJVOP M43 OCL RIE RIL RIO |
| ID | FETCH-LOGICAL-a247t-a972a04c8393c43da3537544a4bc36cd9aff52cf01b57d0c5dfc25bc9a0e783 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 10 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000494640800052&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:56:49 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a247t-a972a04c8393c43da3537544a4bc36cd9aff52cf01b57d0c5dfc25bc9a0e783 |
| PageCount | 8 |
| ParticipantIDs | ieee_primary_8587768 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-Nov. |
| PublicationDateYYYYMMDD | 2018-11-01 |
| PublicationDate_xml | – month: 11 year: 2018 text: 2018-Nov. |
| PublicationDecade | 2010 |
| PublicationTitle | 2018 IEEE/ACM International Conference on Computer-Aided Design (ICCAD) |
| PublicationTitleAbbrev | ICCAD |
| PublicationYear | 2018 |
| Publisher | ACM |
| Publisher_xml | – name: ACM |
| SSID | ssj0002871359 ssj0020286 |
| Score | 2.1408956 |
| Snippet | Approximate Computing has emerged as a design paradigm that allows to decrease hardware costs by reducing the accuracy of the computation for applications that... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Approximate computing Design Space Exploration Hardware Logic functions Logic Simplification Minimization Optimization Space exploration |
| Title | Design Space Exploration of Multi-output Logic Function Approximations |
| URI | https://ieeexplore.ieee.org/document/8587768 |
| WOSCitedRecordID | wos000494640800052&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV05T8MwFH5qEQMsHC3ilgdG0uaw43hEQMSAqkpFqFtlP9tSl6ZqE8TPx3ai0oGFyddiPQ_v8Pu-D-BBu8Q4ja2KpJa-WsXySCBPI2UtxxhNmoRuws93PpkU87mY9uBxh4UxxoTmMzPy0_CXrytsfKlsXLCCu_C4D303tFitXT3FR_6Zd81dsuU28o7KJ6Fs7HnneM5GYfRiEntaKsGVlCf_u8QpDH8xeWS68zZn0DOrczjeoxMcQPkS2jHIzOXBhrTddcHwpLIkIG2jqqnXTU28wjKS0vm0cPzkicW_ly2KcTuEWfn68fwWdToJkUwpryMpeCpjii7WyZBmWmbMC9tSSRVmOWohrWUp2jhRjOsYmbaYMoVCxoYX2QUcrKqVuQTC0QhutBGWGc9bpmgRyzzxa-USs-QKBt4ei3VLhLHoTHH99_YNHLnoomiBe7dwUG8acweH-FUvt5v78Ho_cYCbhA |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV05T8MwFH4qBQlYOArixgMjaXPYcTIiICqiVJVaoW6V82xLXZqqTRA_H9uJSgcWJl-Do-fhHXnf9wE8SJMYh77OPSGFrVax2EuRh16uNUcfVRi4bsLPAR8Ok-k0HbXgcYOFUUq55jPVtVP3L18WWNlSWS9hCTfh8Q7sMmpuqNFam4qKjf0j65ybdMtsxA2ZT0BZzzLP8Zh13WjlJLbUVJwzyY7-9xnHcPaLyiOjjb85gZZanMLhFqFgB7IX15BBxiYTVqTur3OmJ4UmDmvrFVW5rEpiNZaRZMarueMnSy3-Pa9xjOszGGevk-e-1ygleCKkvPREykPhUzTRToQ0kiJiVtqWCppjFKNMhdYsRO0HOePSRyY1hizHVPiKJ9E5tBfFQl0A4ahSrqRKNVOWuSyniS_iwK5zk5oFl9Cx9pgtayqMWWOKq7-372G_P_kYzAZvw_drODCxRlLD-G6gXa4qdQt7-FXO16s795I_uOCeyw |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=proceeding&rft.title=2018+IEEE%2FACM+International+Conference+on+Computer-Aided+Design+%28ICCAD%29&rft.atitle=Design+Space+Exploration+of+Multi-output+Logic+Function+Approximations&rft.au=Echavarria%2C+Jorge&rft.au=Wildermann%2C+Stefan&rft.au=Teich%2C+Jurgen&rft.date=2018-11-01&rft.pub=ACM&rft.eissn=1558-2434&rft.spage=1&rft.epage=8&rft_id=info:doi/10.1145%2F3240765.3240795&rft.externalDocID=8587768 |