This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
March 1979 (vol. 28 no. 3)
pp. 215-224
D.P. Agrawal, Department of Electrical and Computer Engineering, Wayne State University
High-speed multifunction arithmetic arrays for multiplication, division, square and square-root operations are presented in this paper. These arrays seem attractive due to their versatility and speed. A recently described quotient-bit evaluation technique that uses the carry-save method in a nonuniform division array is extended here for the restoring-division process. This array includes the multiplication process as well, and the division time approaches that of multiplication. The design objective of multifunctional arithmetic arrays precludes consideration of other high-speed division techniques. A further extension of the restoring division process is shown to make the design of an array for square/square-root operation straightforward. The two underlying arrays can be coalesced to perform any one of the four operations. Possible methods of merging the arrays, with their relative merits, are also discussed. For illustration purposes, complete internal details of such a generalized pipelined array for 4-bit operation is included in this paper. Due consideration is also given to the possibility of large-scale integration of the different arrays illustrated in this paper.
Index Terms:
square-root, Arrays, carry-look-ahead, carry-save, division, high-speed arithmetic, multifunction, multiplication, pipelining, sign detection, square
Citation:
D.P. Agrawal, "High-Speed Arithmetic Arrays," IEEE Transactions on Computers, vol. 28, no. 3, pp. 215-224, March 1979, doi:10.1109/TC.1979.1675322
Usage of this product signifies your acceptance of the Terms of Use.