Introduction to the role of redundancy in computer arithmetic

Computer

Volumn 8, Issue 6, 1975, Pages 74-77

  Atkins, D E ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002795190     PISSN: 00189162     EISSN: None     Source Type: Trade Journal    
DOI: 10.1109/C-M.1975.219001     Document Type: Article

References (19)

1. D. W. Matula, “Radix Arithmetic: Digital Algorithms for Computer Architecture,” Chapter 9 in Applied Computation Theory, edited by R. Yeh, Prentice-Hall, 1975.
2. Chin Tung, “Arithmetic,” Chapter 3 in Computer Science, edited by Alfonso F. Cardenas, Leon Presser, and Miguel A Marin, Wiley, 1972.
3. J. E. Robertson, “A Deterministic Process for the Design of Limited Carry-Borrow Propagation Adders,” Report 275, Department of Computer Science, University of Illinois, Urbana, July 1967.
4. R. A. Rohatsch, “A Study of Transformations Applicable to the Development of Limited Carry-Borrow Propagation Adders,” (Ph.D. Thesis), Report 226, Department of Computer Science, University of Illinois, Urbana, June 1967.
5. R. T. Borevec, “The Logical Design of a Class of Limited Carry-Borrow Propagation Adders,” Report No. 275, Department of Computer Science, University of Illinois, Urbana, August 1968.
6. D. E. Atkins, “Design of the Arithmetic Units of Illiac III: Use of Redundancy and Higher Radix Methods,” IEEE Transactions on Computers, Vol. C-19, No. 8 (August 1969), pp. 720–733.
7. J. O. Penhollow, “A Study of Arithmetic Recoding with Applications to Multiplication and Division,” Report No. 128, Department of Computer Science, University of Illinois, Urbana, September 1962.
8. G. W. Reitziesner, “Binary Arithmetic,” in Advances in Computers, Vol. 1, F. L. Alt, ed., Academic Press, New York, 1960.
9. C. S. Wallace, “A Suggestion for a Fast-Multiplier,” IEEE Transactions on Electronic Computers, Vol. EC-13, (February 1964), pp. 14–17.
10. J. E. Robertson, “A New Class of Digital Division Methods,” IRE Transactions on Electronic Computers, Vol. EC-7 (September 1958), pp. 218–222.
11. J. E. Robertson, “The Correspondence between Methods of Digital Division and Multiplier Recoding Procedures,” Report No. 252, Department of Computer Science, University of Illinois, Urbana, December 1967.
12. D. E. Atkins, “Higher Radix Division Using Estimates of the Divisor and Partial Remainders,” IEEE Transactions on Computers, Vol. C-17, No. 10 (October 1968), pp. 925–934.
13. D. E. Atkins, “A Study of Methods for Selection of Quotient Digits during Digital Division,” (Ph.D. Thesis), Report No. 397, Department of Computer Science, University of Illinois, Urbana, June 1970.
14. B. G. DeLugish, “A Class of Algorithms for Automatic Evaluation of Certain Elementary Functions in a Binary Computer,” (Ph.D. Thesis), Report No. 399, Department of Computer Science, University of Illinois, Urbana.
15. A. Avizienis, “On a Flexible Implementation of Digital Computer Arithmetic,” Proceedings of IFIP Congress '62, Munich, 1962, pp. 664–668.
16. C. Tung, “A Combinational Arithmetic Function Generation System,” (Ph.D. Thesis), Report No. 68-29, Department of Engineering, UCLA, June 1968.
17. M. J. Pisterzi, “A Limited Connection Arithmetic Unit,” Report No. 398, Department of Computer Science, University of Illinois, Urbana, June 1970.
18. A. Avizienis, “Binary-Compatible Signed-Digit Arithmetic,” AFIPS Conference Proceedings, Vol. 26, Part 1, (1964 FJCC), pp. 663–672.
19. A. Avizienis, —, “Signed-Digit Number Representations for Fast Parallel Arithmetic,” IRE Transactions on Electronic Computers, Vol. 10 (1961), pp. 389–400.