By Topic

Fast Multicomputation with Asynchronous Strategy

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

3 Author(s)
Wu-Chuan Yang ; Dept. of Technol. Manage., Aletheia Univ., Tainan ; Guan, D.J. ; Chi Sung Laih

We propose a new strategy to improve the performance of multicomputations, such as computing xA + yB in an additive group or a xby in a multiplicative group. This new strategy is called asynchronous strategy. In each iteration, it tries to compute partial results by pairing nearby zero and nonzero bits. The new strategy can be applied to any binary code of x and y to further reduce the computational cost. However, our experiments show that sparse signed-digit code can achieve minimum computational cost. The algorithms using the asynchronous strategy need only O(h) extra registers when they try to do computation with bits which are h positions apart

Published in:

Computers, IEEE Transactions on  (Volume:56 ,  Issue: 2 )