Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1.

Slides:

Advertisements

Similar presentations

1 ECE 4436ECE 5367 Computer Arithmetic I-II. 2 ECE 4436ECE 5367 Addition concepts 1 bit adder –2 inputs for the operands. –Third input – carry in from.

Advertisements

Chapter 4 -- Modular Combinational Logic. Decoders.

Lecture 19: Hardware for Arithmetic Today’s topic –Designing an ALU –Carry Look-Ahead Adder 1.

1 Lecture 12: Hardware for Arithmetic Today’s topics:  Designing an ALU  Carry-lookahead adder Reminder: Assignment 5 will be posted in a couple of days.

Chapter 1 — Computer Abstractions and Technology — 1 Lecture 7 Carry look ahead adders, Latches, Flip-flops, registers, multiplexors, decoders Digital.

Mohamed Younis CMCS 411, Computer Architecture 1 CMCS Computer Architecture Lecture 7 Arithmetic Logic Unit February 19,

1 CONSTRUCTING AN ARITHMETIC LOGIC UNIT CHAPTER 4: PART II.

Lecture 20: Hardware for Arithmetic Today’s topic –Carry Look-Ahead Adder 1.

Lecture Adders Half adder.

Fast Adders See: P&H Chapter 3.1-3, C Goals: serial to parallel conversion time vs. space tradeoffs design choices.

Tutorial: Wednesday Week 3 Hand in on Monday, Do the questions for tutorials 1 & 2 at the back of the course notes (answers to tutorial 3 will be published.

Fast Adders See: P&H Chapter 3.1-3, C Goals: serial to parallel conversion time vs. space tradeoffs design choices.

Space vs. Speed: Binary Adders 11.3 Space vs. Speed.

1 Lecture 4: Arithmetic for Computers (Part 3) CS 447 Jason Bakos.

Computer Structure - The ALU Goal: Build an ALU  The Arithmetic Logic Unit or ALU is the device that performs arithmetic and logical operations in the.

ECE C03 Lecture 61 Lecture 6 Arithmetic Logic Circuits Hai Zhou ECE 303 Advanced Digital Design Spring 2002.

Lecture 8 Arithmetic Logic Circuits

1 Chapter 4: Arithmetic Where we've been: –Performance (seconds, cycles, instructions) –Abstractions: Instruction Set Architecture Assembly Language and.

1 ECE369 Chapter 3. 2 ECE369 Multiplication More complicated than addition –Accomplished via shifting and addition More time and more area.

1  1998 Morgan Kaufmann Publishers Chapter Four Arithmetic for Computers.

Chapter 3 Arithmetic for Computers. Arithmetic Where we've been: Abstractions: Instruction Set Architecture Assembly Language and Machine Language What's.

Chapter 5 Arithmetic Logic Functions. Page 2 This Chapter..  We will be looking at multi-valued arithmetic and logic functions  Bitwise AND, OR, EXOR,

1 Bits are just bits (no inherent meaning) — conventions define relationship between bits and numbers Binary numbers (base 2)

Chapter 6-1 ALU, Adder and Subtractor

1 EGRE 426 Fall 08 Chapter Three. 2 Arithmetic What's up ahead: –Implementing the Architecture 32 operation result a b ALU.

1  1998 Morgan Kaufmann Publishers Arithmetic Where we've been: –Performance (seconds, cycles, instructions) –Abstractions: Instruction Set Architecture.

Csci 136 Computer Architecture II – Constructing An Arithmetic Logic Unit Xiuzhen Cheng

CPS3340 COMPUTER ARCHITECTURE Fall Semester, /19/2013 Lecture 7: 32-bit ALU, Fast Carry Lookahead Instructor: Ashraf Yaseen DEPARTMENT OF MATH &

1 CPSC3850 Adders and Simple ALUs Simple Adders Figures 10.1/10.2 Binary half-adder (HA) and full-adder (FA). Digit-set interpretation: {0, 1}

Computing Systems Designing a basic ALU.

درس مدارهای منطقی دانشگاه قم مدارهای منطقی محاسباتی تهیه شده توسط حسین امیرخانی مبتنی بر اسلایدهای درس مدارهای منطقی دانشگاه.

COE 202: Digital Logic Design Combinational Circuits Part 2 KFUPM Courtesy of Dr. Ahmad Almulhem.

CDA 3101 Fall 2013 Introduction to Computer Organization The Arithmetic Logic Unit (ALU) and MIPS ALU Support 20 September 2013.

Lecture 18: Hardware for Arithmetic Today’s topic –Intro to Boolean functions (Continued) –Designing an ALU 1.

1 Lecture 12 Time/space trade offs Adders. 2 Time vs. speed: Linear chain 8-input OR function with 2-input gates Gates: 7 Max delay: 7.

Building a Faster Adder

CPE 232 MIPS Arithmetic1 CPE 232 Computer Organization MIPS Arithmetic – Part I Dr. Gheith Abandah [Adapted from the slides of Professor Mary Irwin (

1  2004 Morgan Kaufmann Publishers Performance is specific to a particular program/s –Total execution time is a consistent summary of performance For.

Orange Coast College Business Division Computer Science Department CS 116- Computer Architecture Arithmetic: Part II.

1 Lecture 12: Adders, Sequential Circuits Today’s topics:  Carry-lookahead adder  Clocks, latches, sequential circuits.

1 Carry Lookahead Logic Carry Generate Gi = Ai Bi must generate carry when A = B = 1 Carry Propagate Pi = Ai xor Bi carry in will equal carry out here.

C-H1 Lecture Adders Half adder. C-H2 Full Adder si is the modulo- 2 sum of ci, xi, yi.

1  2004 Morgan Kaufmann Publishers Lets Build a Processor Almost ready to move into chapter 5 and start building a processor First, let’s review Boolean.

1 Lecture 11: Hardware for Arithmetic Today’s topics:  Logic for common operations  Designing an ALU  Carry-lookahead adder.

Carry-Lookahead, Carry-Select, & Hybrid Adders ECE 645: Lecture 2.

EE204 L03-ALUHina Anwar Khan EE204 Computer Architecture Lecture 03- ALU.

1 CPTR 220 Computer Organization Computer Architecture Assembly Programming.

1 (Based on text: David A. Patterson & John L. Hennessy, Computer Organization and Design: The Hardware/Software Interface, 3 rd Ed., Morgan Kaufmann,

Lecture 12 Logistics Last lecture Today HW4 due today Timing diagrams

Lecture Adders Half adder.

CSE241A VLSI Digital Circuits Winter 2003 Recitation 2

Computer Architecture & Operations I

Single Bit ALU 3 R e s u l t O p r a i o n 1 C y I B v b 2 L S f w d O

Addition and multiplication

ECE/CS 552: Carry Lookahead

Combinational Circuits

Lecture 12: Adders, Sequential Circuits

Lecture 12: Adders, Sequential Circuits

Topic 3b Computer Arithmetic: ALU Design

Lecture 14 Logistics Last lecture Today

Topic 3b Computer Arithmetic: ALU Design

CSE 140 Lecture 14 Standard Combinational Modules

Addition and multiplication

Instructor: Mozafar Bag-Mohammadi University of Ilam

Lecture 14 Logistics Last lecture Today

Addition and multiplication

Arithmetic Circuits.

Number Representation

Lecture 2 Adders Half adder.

Presentation transcript:

Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1

Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 2 q Is a 32-bit ALU as fast as a 1-bit ALU? q Is there more than one way to do addition?  Two extremes: ripple carry and sum-of-products c 1 = b 0 c 0 + a 0 c 0 + a 0 b 0 c 2 = b 1 c 1 + a 1 c 1 + a 1 b 1 c 3 = b 2 c 2 + a 2 c 2 + a 2 b 2 c 4 = b 3 c 3 + a 3 c 3 + a 3 b 3 Problem: ripple carry adder is slow

Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 3 q An approach in-between our two extremes q More complexity (gates) vs less propagation (levels) q Motivation: q If we didn't know the value of carry-in, what could we do?  When would we always generate a carry? g i = a i b i  When would we propagate the carry? p i = a i + b i q Rewriting the carry equations, we get: c 1 = g 0 + p 0 c 0 c 2 = g 1 + p 1 c 1 or c 2 = c 3 = g 2 + p 2 c 2 or c 3 = c 4 = g 3 + p 3 c 3 or c 4 = Carry-lookahead adder

Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 4 Carry-lookahead adder block q Consider the equation for the last carry c4: q c4 = g3 + (p3.g2) + (p3.p2.g1) + (p3.p2.p1.g0) + (p3.p2.p1.p0.c0), or …. q c4 = G0 + P0.c0, where G0 = g3 + (p3.g2) + (p3.p2.g1) + (p3.p2.p1.g0) P0 = p3.p2.p1.p0 q Calling c4 as C1 and c0 as C0, we have: C1 = G0 + P0.C0 C0 ALU0 CarryIn C1 P0 G0 a0 b0 a1 b1 a2 b2 a3 b3 P0 G0 C0 Result bit Carry-lookahead unit (CLA)

Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 5 q Use 4-bit ALU and a 4-bit CLA building blocks q I.e., given Pi, Gi and C0, 4-bit CLA can find C1, C2, C3, C4 in parallel! q Ripple is eliminated ! q Ripple carry speed: q (16 hops between 1-bit ALUs) * (2 logic levels at each ALU) = 32 gate delays q CLA-adder speed: q (1 logic level to compute pi, gi) + (2 logic levels to compute Pi, Gi from pi,gi) + (2 logic levels at CLA to compute Ci) = 5 gate delays !! Use principle to build bigger adders CarryIn Result0--3 ALU0 CarryIn Result4--7 ALU1 CarryIn Result8--11 ALU2 CarryIn CarryOut Result ALU3 CarryIn C1 C2 C3 C4 P0 G0 P1 G1 P2 G2 P3 G3 pi gi pi + 1 gi + 1 ci + 1 ci + 2 ci + 3 ci + 4 pi + 2 gi + 2 pi + 3 gi + 3 a0 b0 a1 b1 a2 b2 a3 b3 a4 b4 a5 b5 a6 b6 a7 b7 a8 b8 a9 b9 a10 b10 a11 b11 a12 b12 a13 b13 a14 b14 a15 b15 Carry-lookahead unit 4-bit