Future Research in Computer Arithmetic - PowerPoint PPT Presentation

1 / 18
About This Presentation
Title:

Future Research in Computer Arithmetic

Description:

The Power Architecture and Power.org word marks and the Power ... L. Rubinfield in 1975 proved radix-4 Booth. S. Vassiliadis in 1989 proved Booth for any radix ... – PowerPoint PPT presentation

Number of Views:44
Avg rating:3.0/5.0
Slides: 19
Provided by: ceEtTu
Category:

less

Transcript and Presenter's Notes

Title: Future Research in Computer Arithmetic


1
Future Research in Computer Arithmetic
  • September 28, 2007
  • Eric Schwarz, IBM

2
Topics
  • Binary Multiplication
  • Proofs of Overlapped Scanning Foundations
  • 73 Counter Design Future
  • Division
  • Direct Division
  • Remainder Avoidance active
  • Decimal Floating-Point extremely active
  • Pipelining Add
  • Multiply
  • Multiply-Add

3
  • Binary Multiplication

4
Basics
  • Recode multiplier and separate into digits
  • Create multiples of the multiplicand
  • Multiplex the multiples
  • Sum all partial products in counter tree
  • reduce final 2 partial products in CLA

5
History of Overlapped Scanning
  • A.D. Booth in 1951 showed overlapped scanning
  • L. Rubinfield in 1975 proved radix-4 Booth
  • S. Vassiliadis in 1989 proved Booth for any radix

6
Fixed Point Multiplication in 1973
7
Fixed Point Multiplication in 1991
8
High Level Counters 73
US Patent 5,187,679 in 1993
9
  • Power6 and Z6 Decimal Floating Point Hardware

10
Power6 and Z6 processors have DFU
Core
L2 Data
L2 Data
L3 Ctrl
L2 Ctrl
Mem Ctrl
Mem Ctrl
L2 Ctrl
L3 Ctrl
L2 Data
L2 Data
Core
11
754R Decimal Floating Point Format
  • IEEE 754R defines 2 formats
  • Integer coefficient DPD (Densely Packed
    Decimal)
  • Formats for 32,64,128 bit.
  • C encodes 2 exponent bits and 1 decimal digit in
    5 bits.

12
Power6 Decimal Floating Point Unit
  • Cycle Time approx 5Ghz, 13 FO4 design
  • Hardware executes 64-bit and 128-bit formats.
  • 144-bit Dataflow can be split into two 72-bit
    pipes.
  • DPD coefficients are decoded into BCD for
    execution.
  • All cases are handled in hardware. (No Special
    Case Software Traps)

13
Coefficient Dataflow
Multiple Generator
1X,3X,4X Registers
36 Digit Dataflow splits to Two 18 Digit Dataflows
Doubler Quintupler
A mux
B mux
Q
Expand DPD to BCD
Prescale Table
Expand DPD to BCD
Operand A Hi Register
Operand A Lo Register
Operand B Hi Register
Operand B Lo Register
Magnitude Calculations A-B B-A
Multiplication Partial Product Partial
Product Accumulate Generate
Q Correction and Multiplexers
Working Register Hi
Working Register Lo
Q
DEC to BIN BIN to DEC Converters
Compress BCD to DPD
Result Register Hi
Result Register Lo
36 digits wide (144 bits)
14
Power6 DFP Multiplication
  • Partial products are formed from two multiples to
    reduce area

34 digit multiplication on 36 digit dataflow 1
digit every 2 cycles
16 digit multiplication on dual 18 digit
dataflows 1 digit every cycles
15
Performance of Arithemetic Operations
N is the number of digits in the first operand
excluding leading zeros
16
Future
  • Pipelined Adder with Rounding Injection
  • Lia-Kai Wang
  • Decimal Multiplication
  • Mark Erle and Michael Schulte 32 Counter
  • Tomas Lang and A. Nannarelli - 42 Counter
  • Alvaro Vazquez et. al. 4221
  • Luigi Dadda - counters
  • Decimal Multiply-Add Pipeline with Rounding
    Injection
  • Divide
  • Tomas Lang and A. Nannarelli Base 2 and Base 5
  • Intel Format

17
Future of Computer Arithmetic
  • Is based on clear proofs and expositions of the
    fundamental concepts.
  • the easier to understand, the easier to build on
  • Arithmetic is very active
  • IEEE 754R Standard currently in ballot
  • Decimal Floating-Point pipelined designs
  • new adder designs, new multiplier designs
  • vector processing, image processing, video game

18
thanks Stamatis!
Write a Comment
User Comments (0)
About PowerShow.com