By Liang-Kai Wang and Michael J. Schulte Joseph Schneider March 12, 2010.

Slides:



Advertisements
Similar presentations
Fixed Point Numbers The binary integer arithmetic you are used to is known by the more general term of Fixed Point arithmetic. Fixed Point means that we.
Advertisements

Chapter 2: Data Representation
Principles of Computer Architecture Miles Murdocca and Vincent Heuring Chapter 2: Data Representation.
Decimal Floating-point Multiplication via Carry-Save Addition Mark Erle Systems & Technology Group International Business Machines Brian Hickmann & Mike.
Physics Rules for using Significant Figures. Rules for Averaging Trials Determine the average of the trials using a calculator Determine the uncertainty.
Energy and Delay Improvement via Decimal Floating Point Hossam A.H.Fahmy, Electronics and Communications Department, CairoUniversity Egypt and.
Digital Circuits. Analog and Digital Signals Noise margins in Logic Circuits VMVM.
1 Module 2: Floating-Point Representation. 2 Floating Point Numbers ■ Significant x base exponent ■ Example:
Logic Gates Combinational Circuits
Binary Number Systems.
CS 105 Digital Logic Design
Chapter 3 Data Representation part2 Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2010.
Chapter3 Fixed Point Representation Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.
Simple Data Type Representation and conversion of numbers
Virtual Wallet Gates Winkler Yin Shen Jordan Fei Project Manager: Prajna Shetty /02/2009 A handheld device that saves time and money through smart.
Computer Arithmetic Nizamettin AYDIN
2-1 Chapter 2 - Data Representation Principles of Computer Architecture by M. Murdocca and V. Heuring © 1999 M. Murdocca and V. Heuring Chapter Contents.
AICCSA’06 Sharja 1 A CAD Tool for Scalable Floating Point Adder Design and Generation Using C++/VHDL By Asim J. Al-Khalili.
2-1 Chapter 2 - Data Representation Principles of Computer Architecture by M. Murdocca and V. Heuring © 1999 M. Murdocca and V. Heuring Principles of Computer.
07/19/2005 Arithmetic / Logic Unit – ALU Design Presentation F CSE : Introduction to Computer Architecture Slides by Gojko Babić.
46 Number Systems Problem: Implement simple pocket calculator Need: Display, adders & subtractors, inputs Display: Seven segment displays Inputs: Switches.
Abdullah Aldahami ( ) March 12, Introduction 2. Background 3. Proposed Multiplier Design a.System Overview b.Fixed Point Multiplier.
1 A Combined Decimal and Binary Floating-point Multiplier Charles Tsen, Sonia González-Navarro, Michael Schulte, Brian Hickmann, Katherine Compton 2009.
Aim: How can we express a large or small number?
Combinational Circuits
Joseph Schneider February 23,  Fused Multiply-Add (FMA) is a unit designed to perform (A x B) + C as a single instruction  Faster, more precise.
IT1004: Data Representation and Organization Negative number representation.
CO5023 Introduction to Digital Circuits. What do we know so far? How to represent numbers (integers and floating point) in binary How to convert between.
ECE 320 Homework #4 1. Using 8 data input selector logic (MUX), implement the following two functions: a) F(A,B,C)=S 0 S 2 S 3 S 5 b) F(A,B,C,D)=P 0 +P.
2's Complement Arithmetic
Chapter 8 Computer Arithmetic. 8.1 Unsigned Notation Non-negative notation  It treats every number as either zero or a positive value  Range: 0 to 2.
Logic Design (CE1111 ) Lecture 4 (Chapter 4) Combinational Logic Prepared by Dr. Lamiaa Elshenawy 1.
Decoder Chapter 12 Subject: Digital System Year: 2009.
Gunjeet Kaur Dronacharya Group of Institutions. Binary Adder-Subtractor A combinational circuit that performs the addition of two bits is called a half.
Digital Design: With an Introduction to the Verilog HDL, 5e M. Morris Mano Michael D. Ciletti Copyright ©2013 by Pearson Education, Inc. All rights reserved.
MATH Lesson 2 Binary arithmetic.
CHAPTER 5: Representing Numerical Data
Combinational Circuits
NxN Crossbar design for Barrel Shifter
CSCI206 - Computer Organization & Programming
EKT 221 : Digital 2 COUNTERS.
Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables, logic gates,
Outline Introduction Floating Point Arithmetic Adder Multiplier.
Chapter 1 Number Systems, Number Representations, and Codes
Instructor: Alexander Stoytchev
Data Representation and Arithmetic Algorithms
Data Representation Data Types Complements Fixed Point Representation
CSCI206 - Computer Organization & Programming
Digital Logic & Design Lecture 03.
HALF ADDER FULL ADDER Half Subtractor.
Unconventional Fixed-Radix Number Systems
Arithmetic Circuits (Part I) Randy H
Significant Figures.
Arithmetic Logical Unit
Multiplier-less Multiplication by Constants
How to represent real numbers
UNIVERSITY OF MASSACHUSETTS Dept
Ch 4. Combinational logic
Data Representation and Arithmetic Algorithms
Chapter 1 Number System RGGP, Narwana.
2’s Complement form 1’s complement form 2’s complement form
ECE 352 Digital System Fundamentals
Combinational Circuits
Generating QR Codes from Oracle Database - Appendix
Design of Digital Circuits Lab 5 Supplement: Implementing an ALU
Arithmetic Circuits.
Chapter3 Fixed Point Representation
+/- Numbers Year 2-3 – Addition and subtraction of two-digit numbers
+/- Numbers Year 2-3 – Develop methods for addition and subtraction within 100
Presentation transcript:

By Liang-Kai Wang and Michael J. Schulte Joseph Schneider March 12, 2010

 Goal is to improve latency for DFP Adder  Number of modifications performed to achieve this, such as an implementation of a new internal format  Overall focus is on the design of a decimal LZA

 Detects location of most significant bit  Previous designs have been for binary, not decimal  Design of decimal LZA expected to improve latency

 Exponent field uncompressed  Significand encoded in BCD  New section for Leading Zero Count; Removes leading zero detection from critical path

 Internal Format removes need for Forward and Backward conversion units  Pre-correction moved in front of Swapping unit and duplicated; Keeps it out of critical path  Leading Zero Detection no longer performed in Shift Amount unit; Lead Zero Count is now an input signal, LZA used so later decimal operations do not need to recalculate it

 Needed in addition and subtraction to guarantee leading zero count of output is correct  Only needed when result after addition or subtraction is not rounded; LZC is always zero when result is rounded

 Preliminary LZC is the minimum number of leading zeros between the two significands being added  If there is a carry, final LZC obtained by reducing preliminary LZC by one

 Requires Encoding unit, Correction unit, and a parallel array of decimal digit adders  Encoding unit ◦ Converts BCD digits into strings of zeros and ones ◦ Detects position of most significant non-zero digit in the string  Correction unit ◦ Flag generation modules and correction trees determine if correction needs to be performed on Encoding unit’s result

 IBM decNumber library version 3.56 used to verify correctness of adder  Sign, exponent, and length and value of significand randomly generated  Adder successfully passed numerous random tests and the corner cases of IBM’s test suite  Previous adder version and new adder implemented in Verilog RTL using TSMC 45nm bulk technology

 Both designs use same floorplan so Area Util. Rate reflects how much area used by each design  New adder 14% faster but at the cost of 18% more area

 LZA takes up significant amount of area, though Kogge-Stone adder is still the largest component

 LZA synthesized alone; Critical path has maximum delay of 24 FO4 inverter delays  Subtractor takes up over 60% of LZA area