By Topic

Generation of signed-digit representations for integer multiplication

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

2 Author(s)
Dempster, A.G. ; Dept. of Electron. Syst., Univ. of Westminster, London, UK ; Macleod, M.D.

This letter presents an algorithm for generating all of the signed-digit representations of a given integer. There is an infinite number of representations, so the tree algorithm is terminated when a defined number of digits above the minimum possible is reached. It is shown that by having available these other representations, more efficient multiplication circuits can be designed than when using existing algorithms.

Published in:

Signal Processing Letters, IEEE  (Volume:11 ,  Issue: 8 )