{"title":"Inexact computing with approximate adder application","authors":"Christopher I. Allen, D. Langley, J. Lyke","doi":"10.1109/NAECON.2014.7045768","DOIUrl":null,"url":null,"abstract":"This paper presents an analysis of an inexact N-bit ripple carry adder architecture. Results show that a 30 percent power reduction is achieved for several approximate adders while maintaining a root-mean square error of 16 percent.","PeriodicalId":318539,"journal":{"name":"NAECON 2014 - IEEE National Aerospace and Electronics Conference","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"NAECON 2014 - IEEE National Aerospace and Electronics Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAECON.2014.7045768","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
This paper presents an analysis of an inexact N-bit ripple carry adder architecture. Results show that a 30 percent power reduction is achieved for several approximate adders while maintaining a root-mean square error of 16 percent.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
