Approximate Computing Through Bitwidth Optimization

dc.contributor.committeeMemberSchaefer, Benjamin Carrion
dc.contributor.committeeMemberNourani, Mehrdad
dc.contributor.committeeMemberMittal, Neeraj
dc.creatorNagarad Dasavandi Krishnamurthy, Vinay
dc.date.accessioned2019-04-29T02:09:04Z
dc.date.available2019-04-29T02:09:04Z
dc.date.created2018-12
dc.date.issued2018-12
dc.date.submittedDecember 2018
dc.date.updated2019-04-29T02:11:14Z
dc.description.abstractIn this thesis, we propose an approximate computing methodology based on bit width optimization that reduces the internal signal’s bit widths in behavioral descriptions for HLS, and in particular SystemC in order to trade-off area and delay vs. output error. This methodology is coupled with a novel Binary search strategy for selecting the bit widths of the aforementioned internal signals in order to obtain a trade-off of Pareto-optimal configurations. In order to prove the efficacy of the proposed methodology we have implemented this methodology and tested it on six benchmarks from S2CBench v.2.2. The proposed method is abbreviated as ACdesigns, which are the approximate computing designs with error less than Emax% (tolerable maximum error). These are the designs which are obtained after the bit width reduction. Since these designs use smaller bit widths than the original, they result in less area and delay. Also, the error, area and running time are all critical parameters to get ACdesigns. Thus, we study and prove experimentally that the strategy for bit width selection takes less running time than the brute force and will eventually lead to the optimal area vs. error Pareto-optimal designs. Finally, we prove that the implementation with the proposed method is on average 20.59% more area efficient compared to static methods used in commercial HLS Tools and results in better running time over brute force method.
dc.format.mimetypeapplication/pdf
dc.identifier.urihttps://hdl.handle.net/10735.1/6426
dc.language.isoen
dc.subjectApproximation theory
dc.subjectComputer systems
dc.subjectBinary system (Mathematics)
dc.titleApproximate Computing Through Bitwidth Optimization
dc.typeThesis
dc.type.materialtext
thesis.degree.departmentComputer Engineering
thesis.degree.grantorThe University of Texas at Dallas
thesis.degree.levelMasters
thesis.degree.nameMS

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
ETD-5608-010-NDKRISHNAMURTHY-9427.91.pdf
Size:
1.77 MB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 2 of 2
No Thumbnail Available
Name:
LICENSE.txt
Size:
1.86 KB
Format:
Plain Text
Description:
No Thumbnail Available
Name:
PROQUEST_LICENSE.txt
Size:
5.87 KB
Format:
Plain Text
Description: