Design and evaluation of ultra‐fast 8‐bit approximate multipliers using novel multicolumn inexact compressors
Summary A multiplier, as a key component in many different applications, is a time‐consuming, energy‐intensive computation block. Approximate computing is a practical design paradigm that attempts to improve hardware efficacy while keeping computation quality satisfactory. A novel multicolumn 3,3:2...
Gespeichert in:
Veröffentlicht in: | International journal of circuit theory and applications 2023-07, Vol.51 (7), p.3454-3479 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 3479 |
---|---|
container_issue | 7 |
container_start_page | 3454 |
container_title | International journal of circuit theory and applications |
container_volume | 51 |
creator | Karimi, Fereshteh Faghih Mirzaee, Reza Fakeri‐Tabrizi, Ali Roohi, Arman |
description | Summary
A multiplier, as a key component in many different applications, is a time‐consuming, energy‐intensive computation block. Approximate computing is a practical design paradigm that attempts to improve hardware efficacy while keeping computation quality satisfactory. A novel multicolumn 3,3:2 inexact compressor is presented in this paper. It takes three partial products from two adjacent columns each for rapid partial product reduction. The proposed inexact compressor and its derivatives enable us to design a high‐speed approximate multiplier. Then, another ultra‐fast, high‐efficient approximate multiplier is achieved by utilizing a systematic truncation strategy. The proposed multipliers accumulate partial products in only two stages, one fewer stage than other approximate multipliers in the literature. Implementation results by the Synopsys Design Compiler and 45 nm technology node demonstrate nearly 11.11% higher speed for the second proposed design over the fastest existing approximate multiplier. Furthermore, the new approximate multipliers are applied to the image processing application of image sharpening, and their performance in this application is highly satisfactory. It is shown in this paper that the error pattern of an approximate multiplier, in addition to the mean error distance and error rate, has a direct effect on the outcomes of the image processing application. |
doi_str_mv | 10.1002/cta.3613 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2832591232</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2832591232</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2933-4c018dcd95581756c06c6909654fbae1ca1652b72afebebba1d4b8225b03296c3</originalsourceid><addsrcrecordid>eNp10MtKAzEUBuAgCtYq-AgBN26m5tLJJMtSr1BwU8HdkGQyJWWaTJNMbXc-gs_okzh13LrKIXycyw_ANUYTjBC500lOKMP0BIwwEkWGUPF-CkYICZ4Jztk5uIhxjRDihIoR2N6baFcOSldBs5NNJ5P1Dvoadk0K8vvzq5YxQd4XyiYo2zb4vd3IZOCmF7ZtrAkRdtG6FXR-Z5rhX_um2zhondlLnaD2mzaYGH2Il-Cslk00V3_vGLw9Piznz9ni9ellPltkmghKs6lGmFe6EnnOcZEzjZhmAgmWT2slDdYSs5yogsjaKKOUxNVUcUJyhSgRTNMxuBn69htvOxNTufZdcP3IknBKcoEJJb26HZQOPsZg6rIN_XnhUGJUHgMt-0DLY6A9zQb6YRtz-NeV8-Xs1_8A1EZ7KA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2832591232</pqid></control><display><type>article</type><title>Design and evaluation of ultra‐fast 8‐bit approximate multipliers using novel multicolumn inexact compressors</title><source>Wiley Journals</source><creator>Karimi, Fereshteh ; Faghih Mirzaee, Reza ; Fakeri‐Tabrizi, Ali ; Roohi, Arman</creator><creatorcontrib>Karimi, Fereshteh ; Faghih Mirzaee, Reza ; Fakeri‐Tabrizi, Ali ; Roohi, Arman</creatorcontrib><description>Summary
A multiplier, as a key component in many different applications, is a time‐consuming, energy‐intensive computation block. Approximate computing is a practical design paradigm that attempts to improve hardware efficacy while keeping computation quality satisfactory. A novel multicolumn 3,3:2 inexact compressor is presented in this paper. It takes three partial products from two adjacent columns each for rapid partial product reduction. The proposed inexact compressor and its derivatives enable us to design a high‐speed approximate multiplier. Then, another ultra‐fast, high‐efficient approximate multiplier is achieved by utilizing a systematic truncation strategy. The proposed multipliers accumulate partial products in only two stages, one fewer stage than other approximate multipliers in the literature. Implementation results by the Synopsys Design Compiler and 45 nm technology node demonstrate nearly 11.11% higher speed for the second proposed design over the fastest existing approximate multiplier. Furthermore, the new approximate multipliers are applied to the image processing application of image sharpening, and their performance in this application is highly satisfactory. It is shown in this paper that the error pattern of an approximate multiplier, in addition to the mean error distance and error rate, has a direct effect on the outcomes of the image processing application.</description><identifier>ISSN: 0098-9886</identifier><identifier>EISSN: 1097-007X</identifier><identifier>DOI: 10.1002/cta.3613</identifier><language>eng</language><publisher>Bognor Regis: Wiley Subscription Services, Inc</publisher><subject>approximate computing ; approximate multiplier ; Compressors ; computer arithmetic ; Errors ; Image processing ; image sharpening ; inexact compressor ; multicolumn compressor ; Multipliers</subject><ispartof>International journal of circuit theory and applications, 2023-07, Vol.51 (7), p.3454-3479</ispartof><rights>2023 John Wiley & Sons Ltd.</rights><rights>2023 John Wiley & Sons, Ltd.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2933-4c018dcd95581756c06c6909654fbae1ca1652b72afebebba1d4b8225b03296c3</citedby><cites>FETCH-LOGICAL-c2933-4c018dcd95581756c06c6909654fbae1ca1652b72afebebba1d4b8225b03296c3</cites><orcidid>0000-0002-0900-8768 ; 0000-0001-7175-0229</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fcta.3613$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fcta.3613$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,780,784,1417,27924,27925,45574,45575</link.rule.ids></links><search><creatorcontrib>Karimi, Fereshteh</creatorcontrib><creatorcontrib>Faghih Mirzaee, Reza</creatorcontrib><creatorcontrib>Fakeri‐Tabrizi, Ali</creatorcontrib><creatorcontrib>Roohi, Arman</creatorcontrib><title>Design and evaluation of ultra‐fast 8‐bit approximate multipliers using novel multicolumn inexact compressors</title><title>International journal of circuit theory and applications</title><description>Summary
A multiplier, as a key component in many different applications, is a time‐consuming, energy‐intensive computation block. Approximate computing is a practical design paradigm that attempts to improve hardware efficacy while keeping computation quality satisfactory. A novel multicolumn 3,3:2 inexact compressor is presented in this paper. It takes three partial products from two adjacent columns each for rapid partial product reduction. The proposed inexact compressor and its derivatives enable us to design a high‐speed approximate multiplier. Then, another ultra‐fast, high‐efficient approximate multiplier is achieved by utilizing a systematic truncation strategy. The proposed multipliers accumulate partial products in only two stages, one fewer stage than other approximate multipliers in the literature. Implementation results by the Synopsys Design Compiler and 45 nm technology node demonstrate nearly 11.11% higher speed for the second proposed design over the fastest existing approximate multiplier. Furthermore, the new approximate multipliers are applied to the image processing application of image sharpening, and their performance in this application is highly satisfactory. It is shown in this paper that the error pattern of an approximate multiplier, in addition to the mean error distance and error rate, has a direct effect on the outcomes of the image processing application.</description><subject>approximate computing</subject><subject>approximate multiplier</subject><subject>Compressors</subject><subject>computer arithmetic</subject><subject>Errors</subject><subject>Image processing</subject><subject>image sharpening</subject><subject>inexact compressor</subject><subject>multicolumn compressor</subject><subject>Multipliers</subject><issn>0098-9886</issn><issn>1097-007X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNp10MtKAzEUBuAgCtYq-AgBN26m5tLJJMtSr1BwU8HdkGQyJWWaTJNMbXc-gs_okzh13LrKIXycyw_ANUYTjBC500lOKMP0BIwwEkWGUPF-CkYICZ4Jztk5uIhxjRDihIoR2N6baFcOSldBs5NNJ5P1Dvoadk0K8vvzq5YxQd4XyiYo2zb4vd3IZOCmF7ZtrAkRdtG6FXR-Z5rhX_um2zhondlLnaD2mzaYGH2Il-Cslk00V3_vGLw9Piznz9ni9ellPltkmghKs6lGmFe6EnnOcZEzjZhmAgmWT2slDdYSs5yogsjaKKOUxNVUcUJyhSgRTNMxuBn69htvOxNTufZdcP3IknBKcoEJJb26HZQOPsZg6rIN_XnhUGJUHgMt-0DLY6A9zQb6YRtz-NeV8-Xs1_8A1EZ7KA</recordid><startdate>202307</startdate><enddate>202307</enddate><creator>Karimi, Fereshteh</creator><creator>Faghih Mirzaee, Reza</creator><creator>Fakeri‐Tabrizi, Ali</creator><creator>Roohi, Arman</creator><general>Wiley Subscription Services, Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><orcidid>https://orcid.org/0000-0002-0900-8768</orcidid><orcidid>https://orcid.org/0000-0001-7175-0229</orcidid></search><sort><creationdate>202307</creationdate><title>Design and evaluation of ultra‐fast 8‐bit approximate multipliers using novel multicolumn inexact compressors</title><author>Karimi, Fereshteh ; Faghih Mirzaee, Reza ; Fakeri‐Tabrizi, Ali ; Roohi, Arman</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2933-4c018dcd95581756c06c6909654fbae1ca1652b72afebebba1d4b8225b03296c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>approximate computing</topic><topic>approximate multiplier</topic><topic>Compressors</topic><topic>computer arithmetic</topic><topic>Errors</topic><topic>Image processing</topic><topic>image sharpening</topic><topic>inexact compressor</topic><topic>multicolumn compressor</topic><topic>Multipliers</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Karimi, Fereshteh</creatorcontrib><creatorcontrib>Faghih Mirzaee, Reza</creatorcontrib><creatorcontrib>Fakeri‐Tabrizi, Ali</creatorcontrib><creatorcontrib>Roohi, Arman</creatorcontrib><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>International journal of circuit theory and applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Karimi, Fereshteh</au><au>Faghih Mirzaee, Reza</au><au>Fakeri‐Tabrizi, Ali</au><au>Roohi, Arman</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Design and evaluation of ultra‐fast 8‐bit approximate multipliers using novel multicolumn inexact compressors</atitle><jtitle>International journal of circuit theory and applications</jtitle><date>2023-07</date><risdate>2023</risdate><volume>51</volume><issue>7</issue><spage>3454</spage><epage>3479</epage><pages>3454-3479</pages><issn>0098-9886</issn><eissn>1097-007X</eissn><abstract>Summary
A multiplier, as a key component in many different applications, is a time‐consuming, energy‐intensive computation block. Approximate computing is a practical design paradigm that attempts to improve hardware efficacy while keeping computation quality satisfactory. A novel multicolumn 3,3:2 inexact compressor is presented in this paper. It takes three partial products from two adjacent columns each for rapid partial product reduction. The proposed inexact compressor and its derivatives enable us to design a high‐speed approximate multiplier. Then, another ultra‐fast, high‐efficient approximate multiplier is achieved by utilizing a systematic truncation strategy. The proposed multipliers accumulate partial products in only two stages, one fewer stage than other approximate multipliers in the literature. Implementation results by the Synopsys Design Compiler and 45 nm technology node demonstrate nearly 11.11% higher speed for the second proposed design over the fastest existing approximate multiplier. Furthermore, the new approximate multipliers are applied to the image processing application of image sharpening, and their performance in this application is highly satisfactory. It is shown in this paper that the error pattern of an approximate multiplier, in addition to the mean error distance and error rate, has a direct effect on the outcomes of the image processing application.</abstract><cop>Bognor Regis</cop><pub>Wiley Subscription Services, Inc</pub><doi>10.1002/cta.3613</doi><tpages>26</tpages><orcidid>https://orcid.org/0000-0002-0900-8768</orcidid><orcidid>https://orcid.org/0000-0001-7175-0229</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0098-9886 |
ispartof | International journal of circuit theory and applications, 2023-07, Vol.51 (7), p.3454-3479 |
issn | 0098-9886 1097-007X |
language | eng |
recordid | cdi_proquest_journals_2832591232 |
source | Wiley Journals |
subjects | approximate computing approximate multiplier Compressors computer arithmetic Errors Image processing image sharpening inexact compressor multicolumn compressor Multipliers |
title | Design and evaluation of ultra‐fast 8‐bit approximate multipliers using novel multicolumn inexact compressors |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T08%3A45%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Design%20and%20evaluation%20of%20ultra%E2%80%90fast%208%E2%80%90bit%20approximate%20multipliers%20using%20novel%20multicolumn%20inexact%20compressors&rft.jtitle=International%20journal%20of%20circuit%20theory%20and%20applications&rft.au=Karimi,%20Fereshteh&rft.date=2023-07&rft.volume=51&rft.issue=7&rft.spage=3454&rft.epage=3479&rft.pages=3454-3479&rft.issn=0098-9886&rft.eissn=1097-007X&rft_id=info:doi/10.1002/cta.3613&rft_dat=%3Cproquest_cross%3E2832591232%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2832591232&rft_id=info:pmid/&rfr_iscdi=true |