Issue No. 03 - March (1978 vol. 27)
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.
subtrahend, Base-2 or negabinary, negabinary adders, polarized addend, reduction technique, square, square-root
D. Agrawal, "A Novel Technique for Computing Negabinary Squares," in IEEE Transactions on Computers, vol. 27, no. , pp. 266-270, 1978.