This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fully Digit On-Line Networks
April 1983 (vol. 32 no. 4)
pp. 402-406
M.J. Irwin, Department of Computer Science, Pennsylvania State University
Research in computer architecture in the last decade has been driven largely by the motivation to overcome the "von Neumann" bottleneck. This paper describes the design and use of one such architecture?fully digit on-line networks. First, digit on-line algorithms and processing are defined. The key advantage to digit on-line processing is that it allows a digit serial, most significant digit first, type of data flow. Processing of the most significant operand digits starts immediately and generation of the most significant result digits soon follows. The minimum set of primitive logic operations required to implement a digit on-line processing component in VLSI are outlined. Then, digit on-line networks consisting of many of these digit on-line components are examined. Finally, two different network configurations are discussed and compared.
Index Terms:
systolic arrays, Digit on-line algorithms, digit on-line architectures, linear recurrences, pipelining, redundant digit sets
Citation:
M.J. Irwin, R.M. Owens, "Fully Digit On-Line Networks," IEEE Transactions on Computers, vol. 32, no. 4, pp. 402-406, April 1983, doi:10.1109/TC.1983.1676243
Usage of this product signifies your acceptance of the Terms of Use.