This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
March 1978 (vol. 27 no. 3)
pp. 266-270
D.P. Agrawal, Southern Methodist University
A novel technique for computing squares of negabinary numbers is described in this correspondence. The basic principle is to use an arithmetic algorithm normally utilized for the square-root operation. Asuitable recursive combinations are shown to reduce the problem of obtaining the square of "n" bit number to the addition of [n/3] operands and the change of sign in the last step is shown to be helpful in reducing the hardware. One way for further improvement is also suggested.
Index Terms:
subtrahend, Base-2 or negabinary, negabinary adders, polarized addend, reduction technique, square, square-root
Citation:
D.P. Agrawal, "A Novel Technique for Computing Negabinary Squares," IEEE Transactions on Computers, vol. 27, no. 3, pp. 266-270, March 1978, doi:10.1109/TC.1978.1675084
Usage of this product signifies your acceptance of the Terms of Use.