An exact method for estimating maximum errors of multi-mode floating-point iterative booth multiplier
by Kun-Yi Wu; Shiann-Rong Kuang; Kee-Khuan Yu
International Journal of Computational Science and Engineering (IJCSE), Vol. 8, No. 4, 2013

Abstract: With the rapid growth of floating-point (FP) arithmetic, FP multipliers have become the main energy consumers in embedded systems. Many FP applications allow a slight output distortion, thereby we can trade output quality with energy consumption via reducing the precision of FP multiplication operations to be less accurate than IEEE single-precision FP multiplication. In this paper, we propose a sort of multi-mode FP iterative booth multiplier which can provide multiple precision modes (PMs). However, the maximum error of each PM with respect to IEEE single-precision FP multiplication is very difficult to compute by using exhaustive simulation. To efficiently assign each multiplication operation in an application to a proper PM for satisfying output error constraint and achieving more energy saving, an exact analysis method is proposed to estimate the maximum error of each PM. Experimental results show that the proposed method can get 46% to 63% reduction in the estimated value of the maximum error, leading to up to 24% more energy saving than previous work.

Online publication date: Fri, 27-Dec-2013

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com