Sahith Guturu, Anil Kumar Uppugunduru, S. Thota, Syed Ershad Ahmed
{"title":"Power-Efficient MLOA for error resilient applications","authors":"Sahith Guturu, Anil Kumar Uppugunduru, S. Thota, Syed Ershad Ahmed","doi":"10.1109/iSES52644.2021.00029","DOIUrl":null,"url":null,"abstract":"Approximate Computing is a paradigm shift to meet the future demands of compute-intensive tasks such as media processing, data mining, and recognition. These applications can tolerate errors up to a specific limit. In such applications, addition is one unit that is power-hungry by approximating the adder savings in area, power, and delay can be achieved. This paper presents a technique of approximating the least significant portion in an adder while improvement in accuracy is achieved using OR-based logic. This results in a reduction of area and power without significant compromise in accuracy. Based on the approximation region, we propose three designs with a tradeoff in computation complexity and accuracy. The results prove the efficacy of the proposed designs and an improvement up to 51.39%, improvement in power w.r.t existing designs.","PeriodicalId":293167,"journal":{"name":"2021 IEEE International Symposium on Smart Electronic Systems (iSES) (Formerly iNiS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Symposium on Smart Electronic Systems (iSES) (Formerly iNiS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iSES52644.2021.00029","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Approximate Computing is a paradigm shift to meet the future demands of compute-intensive tasks such as media processing, data mining, and recognition. These applications can tolerate errors up to a specific limit. In such applications, addition is one unit that is power-hungry by approximating the adder savings in area, power, and delay can be achieved. This paper presents a technique of approximating the least significant portion in an adder while improvement in accuracy is achieved using OR-based logic. This results in a reduction of area and power without significant compromise in accuracy. Based on the approximation region, we propose three designs with a tradeoff in computation complexity and accuracy. The results prove the efficacy of the proposed designs and an improvement up to 51.39%, improvement in power w.r.t existing designs.