By Topic

Binary fraction multiplication algorithms

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
$33 $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)
M. T. Jong ; Department of Electrical Engineering WICHITA STATE UNIVERSITY, Wichita, KS 67208

Three algorithms are considered for performing n-bit multiplication of two n-bit natural binary fractions. One of the algorithms can be easily and efficiently implemented in software to yield the maximum accuracy.

Published in:

IEEE Circuits & Systems Magazine  (Volume:1 ,  Issue: 4 )