By Topic

A note about the correction cycle of high radix Booth's 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
$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

2 Author(s)
G. Guo ; EE & CS Dept., Texas A&I Univ., Kingsville, TX, USA ; M. Ashtijou

Booth's multiplication algorithm and its modified version are reviewed (A.D. Booth, 1990). It is shown that high radix Booth's multiplication needs a correction cycle only when fixed point fractions are used. The correction cycle with [(n-1) mod log2(r)] arithmetic right-shifts is not for the integer case

Published in:

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

Date of Conference:

3-6 Oct 1993