We introduce a right-to-left digit serial algorithm for the integer power operation  x y   where  x  and  y  are positive integers. For n-bit words the algorithm utilizes  o ( n ) additions and does not require use of a multiplier. We describe a hardware implementation and evaluate the effectiveness employing a Synopsys tool set with a standard cell implementation. Out digit serial algorithm compares favorably with a popular iterative square and multiply algorithm implemented with the same tool set.
['Lun Li', 'Mitchell A. Thornton', 'David W. Matula']
A digit serial algorithm for the integer power operation