Computer Arithmetic Algorithms and Hardware Design
CSE 246

Fall 2006
Huey Ling
Highspeed Binary Adder
Based on the bit pair ( a i , b i ) truth table, the carry propagate i and carry generate gi have dominated the carrylookp ahead formation process for more than two decades. This paper presents scheme in which the
Computer Arithmetic Algorithms and Hardware Design
CSE 246

Fall 2006
CSE 246: Computer Arithmetic
Algorithms and Hardware Design
Fall 2006
Lecture 8: Division
Instructor:
Prof. ChungKuan Cheng
Topics:
CSE 246
Radix4 SRT Division
Division by a Constant
Division by a Repeated Multiplication
2
Project Update
Come in to sp
Computer Arithmetic Algorithms and Hardware Design
CSE 246

Fall 2006
CSE 246: Computer Arithmetic Algorithms and Hardware Design
Fall 2006 Lecture 2: Redundant and residue number systems
Instructor: Prof. ChungKuan Cheng
Topics:
Redundant Number Systems Residue Number Systems
Mixed Radix Number Systems (as they
Computer Arithmetic Algorithms and Hardware Design
CSE 246

Fall 2006
CSE 246: Computer Arithmetic Algorithms and Hardware Design
Numbers: RNS, DBNS, Montgomory
Prof ChungKuan Cheng
Lecture 3
How to compare two RNS numbers
We can approximate the magnitude of a RNS number by the following formula
x M ( xk 1  xk 2 
Computer Arithmetic Algorithms and Hardware Design
CSE 246

Fall 2006
CSE 246: Computer Arithmetic Algorithms and Hardware Design
Fall 2006 Lecture 9: Floating Point Numbers
Instructor: Prof. ChungKuan Cheng
Motivation
Maximal information with given bit numbers. Arithmetic with proper precision. Fairness of round