Data Structures and Algorithms


Design of High Speed 64 Bits Multiplier by Square Function

Authors: Wu Sheng-Ping

This article propose a new Booth multiplier design that the booth expansion is rearranged in square term like: \[ ab=((a+b)^2-a^2-b^2)/2 \] If the code length of $a,b$ is $n$, the multiplier on the right is with the size $2^{2n}$, but multiplier on the left is with the size $2^n$.

Comments: 2 Pages.

Download: PDF

Submission history

[v1] 2011-12-07 18:58:12

Unique-IP document downloads: 172 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus