## CSE 246: Computer Arithmetic Algorithms and Hardware Design (Fall 06)

Lectures: Tues/Thurs 3:30-4:50PM, Warren Lecture Hall 2110
Office Hours: Tues/Thurs 2:00-3:00PM, CSE2130

### Textbook

Computer Arithmetic: Algorithms and Hardware Designs Behrooz Parhami, Oxford

### Lectures

Letcture 1 Introduction and Number Systems
Letcture 2 Number Systems: Redundant Systems and RNS
Letcture 3 Number Systems (RNS, DBNS, Montgomery)
Modular Multiplcation without Trial Division, P.L. Montgomory
Letcture 6 Multipliers
Letcture 6.1 Multiplication Arithmetic
Letcture 7 Division I
Letcture 8 Division II
Letcture 9 Floating Point Arithmetic
Letcture 10 Floating Point Arithmetic, Polynomial Functions
Letcture 11 Polynomial Functions

### Homeworks

HW1: 1.4, 1.5, 1.9, 2.8, 2.9, 2.10, 2.15 Due Tu Oct. 3.
HW2: 3.1, 3.14, 4.1, 4.7, 4.9, 4.14, 4.15 Due Tu Oct. 10.
HW3: 5.1, 6.8, 6.9, 6.13, 6.16 Due Th Oct. 19.
HW4: Due Th Oct. 26.
• 1. Prove that in prefix adders the subtrees of the same output can overlap.
• 2. Show the logic diagram of an 8-bit Ling's adder. Demonstrate the function with an example of 57+120.
• 3. Select one addition paper published in the last three years. Describe the novel features, advantages and disadvantages of the adder in less than 200 words (no limit on figures).