By Topic

Truncated multiplication with approximate rounding

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)
E. E. Swartzlander ; Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA

In many signal processing applications it is desirable to maintain constant word size through the basic arithmetic operations of add, subtract, multiply and divide. Of these operations, multiply is the biggest concern as multiplying two n-bit data yields a 2n-bit product. Forming the full product and rounding it to the desired precision is mathematically attractive, but the complexity is high. Forming a portion of the bit product matrix would reduce the complexity, but this incurs potentially large errors. A compromise approach has been developed that represents a reasonable (in many applications) compromise. The complexity is slightly above that of a truncated bit product multiplier, but the accuracy is close to that of a rounded full precision multiplier.

Published in:

Signals, Systems, and Computers, 1999. Conference Record of the Thirty-Third Asilomar Conference on  (Volume:2 )

Date of Conference:

24-27 Oct. 1999