Dr. Guy Even

email:guy@eng.tau.ac.il

URL: http://www.eng.tau.ac.il/~guy/index.html

Class: Wednesdays 16-18, Kitot 207

Office Hour: Mondays 16-17 (Room 116, Engineering-Labs Building)

prepared by the students - read at your own risk!

- Lecture #1: Floating Point Division - part 1, prepared by Ran Katzir compressed ps [125KB] or Word file [119KB]
- Lecture #2: Floating Point Division - part 2, prepared by Yakov Shkolnik Word file [424KB]
- Lecture #3: Unsigned Addition, (a) prepared by Shlomi Biton Zipped Word file [374KB] (b) prepared by Alexander Lifshitz Gzipped postscript file [198KB]
- Lecture #4: Signed Addition & Unsigned Multiplication: (a) prepared by Eran Knaz Word File [265KB] (b) prepared by Moshe Yehonadav Word File [292KB]
- Lecture #5: Booth Encoding: prepared by Ziv Gilad Word File [265KB]
- Lecture #6: IEEE floating point standard: No notes (see references)

- Adders, 2's-Complement adders, etc:
- Books: Koren, Omondi
- Mueller and Paul, "The Complexity of Simple Computer Architectures"
- Parallel Prefix Computation
- Ladner and Fischer, "Parallel Prefix Computation", JACM, Vol 27, pp. 831-838, Oct., 1980.
- F. Thomson Leighton, "Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes", 1992.
- Brent and Kung, "A regular Layout for Parallel Adders", IEEE trans. Computers, Vol C-31, No. 3, March 1982, pp. 260-264.
- Wei and Thomborson, "Area-Time Optimal Designs", IEEE trans. Computers, Vol 39, No. 5, May 1990.
- Booth Recoding and Multiplication
- W. J. Paul and P.M. Seidel, "On the Complexity of Booth Recoding" ([113KB] compressed postscript).
- G. W. Bewick, "Fast Multiplication: Algorithms and Implementation", available from ftp://umunhum.stanford.edu/tr/bewick.apr94.thesis.ps.Z [1770 KB]
- Floating Point
- IEEE 754 Standard
- Even and Paul, "On The Design of IEEE Compliant Floating Point Units" ([143KB] compressed postscript)
- Mueller and Paul, excerpt from Vol 2 of "The Complexity of Simple Computer Architectures" (compressed postscript)
- Mueller and Paul, "The Decomposition Theorem for IEEE Floating Point Rounding" (compressed postscript)
- Even and Seidel, "A comparison of three rounding algorithms for IEEE floating-point multiplication", (postscript)
- Other related sites - partial list
- Stanford Computer Architecture and Arithmetic Group . The Recent Publications section contains papers that have appeared in journals and conferences. The Dissertations section contains PhD dissertations from Prof. Flynn's group. The Technical Reports section contains a lot of papers on Floating point arithmetic, some which did not appear elsewhere.
- Peter Kornerup's homepage. The Research page has links to PhD theses and a very extensive bibliography list.
- Marc Daumas' homepage.
- Peter Siedel's homepage.