Cart (Loading....) | Create Account
Close category search window
 

Reliable floating-point arithmetic algorithms for Berger encoded operands

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Lo, J.-C. ; Dept. of Electr. Eng., Rhode Island Univ., Kingston, RI, USA

A set of reliable floating-point arithmetic algorithms for Berger encoded operands is presented. Closed-form equations are derived for floating-point addition, subtraction, multiplication and division. Given the IEEE floating-point number standard, the redundancy requirements of the proposed scheme are 39.47% for addition/subtraction, 45.65% for multiplication, and 45.44% for division of single precision numbers. The scheme uses only 16.14% for addition/subtraction, 36.44% for multiplication and 36.02% for division of double-precision numbers

Published in:

Computer Design: VLSI in Computers and Processors, 1992. ICCD '92. Proceedings, IEEE 1992 International Conference on

Date of Conference:

11-14 Oct 1992

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.