This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
April 1983 (vol. 32 no. 4)
pp. 329-330
SINCE the inception of electronic computers, much effort has been directed towards the search of faster arithmetic techniques. For all scientific computations, the arithmetic units have always been considered as the heart of a digital computer. In the earlier approaches, emphasis on the arithmetic elements was limited to integer arithmetic with limited precision, as the cost of discrete components was the main driving factor. Circuit optimization with reduced components and techniques for high-speed arithmetic were crucial at that time. Later, software techniques were employed to include floating-point representation and to achieve desirable precision. The advances in LSI technology and the inception of microcomputers caused a-great deal of impact on the ways people used to think. Emphasis on circuit component reduction was shifted to iterative logic and minimization of chip types. This led to various uniformly structured and specialized units like cellular arrays, etc. Now, several high-speed multipliers and FFT processors are commercially available. The on-line processing requirement also enhanced acceptance of techniques like overlapping and pipelining. The error analysis has always been a lively topic of interest and so also the variable word-lengths. Parallel processing requirements led to the introduction of bit-slice ALU's. The current trend is to use high-speed arithmetic for various transforms and signal processing applications. This was clearly reflected from the papers submitted for the special issue.
Citation:
D.P. Agrawal, T.R.N. Rao, "Introduction: Computer Arithmetic," IEEE Transactions on Computers, vol. 32, no. 4, pp. 329-330, April 1983, doi:10.1109/TC.1983.1676232
Usage of this product signifies your acceptance of the Terms of Use.