Morgan Kaufmann Publishers

Slides:



Advertisements
Similar presentations
Kuliah Rangkaian Digital Kuliah 7: Unit Aritmatika
Advertisements

Combinational Circuits. Analysis Diagram Designing Combinational Circuits In general we have to do following steps: 1. Problem description 2. Input/output.
CS2100 Computer Organisation Combinational Circuits (AY2014/5 Semester 2)
DPSD This PPT Credits to : Ms. Elakya - AP / ECE.
ECE 331 – Digital System Design
Design of Arithmetic Circuits – Adders, Subtractors, BCD adders
ECE 301 – Digital Electronics
ECE 301 – Digital Electronics
4-bit adder, multiplexer, timing diagrams, propagation delays
Chapter 5 Arithmetic Logic Functions. Page 2 This Chapter..  We will be looking at multi-valued arithmetic and logic functions  Bitwise AND, OR, EXOR,
CS1104: Computer Organisation Lecture 6: Combinational Circuits Design Methods/Arithmetic Circuits
Logic Gates Combinational Circuits
Adders, subtractors, ALUs
CS 105 Digital Logic Design
Combinational Circuits
Combinational Circuits
ReVieW Combinational & Sequential Logic Circuit EKT 221 / 4 DIGITAL ELECTRONICS II.
Morgan Kaufmann Publishers
Combinational Logic Design
Logic Design CS221 1 st Term combinational circuits Cairo University Faculty of Computers and Information.
Logical Circuit Design Week 8: Arithmetic Circuits Mentor Hamiti, MSc Office ,
+ CS 325: CS Hardware and Software Organization and Architecture Combinational Circuits 1.
Combinational Circuits
Digital Arithmetic and Arithmetic Circuits
Conversion and Coding (12) 10. Conversion and Coding (12) Conversion.
IKI a-Combinatorial Components Bobby Nazief Semester-I The materials on these slides are adopted from those in CS231’s Lecture Notes.
Fall 2004EE 3563 Digital Systems Design EE 3563 Comparators  Comparators determine if two binary inputs are equal  Some will signal greater than/less.
Chapter 6-1 ALU, Adder and Subtractor
Circuit Delays. Outline  Calculation of Circuit Delays  Faster Circuits  Look-Ahead Carry Adder.
Logic Gates Logic gates are electronic digital circuit perform logic functions. Commonly expected logic functions are already having the corresponding.
CHAPTER 4 Combinational Logic Design- Arithmetic Operation (Section 4.6&4.9)
COE 202: Digital Logic Design Combinational Circuits Part 2 KFUPM Courtesy of Dr. Ahmad Almulhem.
Lecture 18: Hardware for Arithmetic Today’s topic –Intro to Boolean functions (Continued) –Designing an ALU 1.
Half Adder & Full Adder Patrick Marshall. Intro Adding binary digits Half adder Full adder Parallel adder (ripple carry) Arithmetic overflow.
1 CS 151: Digital Design Chapter 4: Arithmetic Functions and Circuits 4-1,2: Iterative Combinational Circuits and Binary Adders.
Combinational Circuits
Chapter Four Combinational Logic 1. C OMBINATIONAL C IRCUITS It consists of input variables, logic gates and output variables. Output is function of input.
CS 105 DIGITAL LOGIC DESIGN Chapter 4 Combinational Logic 1.
Topics covered: Arithmetic CSE243: Introduction to Computer Architecture and Hardware/Software Interface.
ECE 331 – Digital System Design Multi-bit Adder Circuits, Adder/Subtractor Circuit, and Multiplier Circuit (Lecture #12)
1 Chapter 4 Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables,
Logic Design CS221 1 st Term combinational circuits Cairo University Faculty of Computers and Information.
Combinational Logic Design
CEC 220 Digital Circuit Design
CHAPTER 2 Digital Combinational Logic/Arithmetic Circuits
1 Combinational Logic EE 208 – Logic Design Chapter 4 Sohaib Majzoub.
1 Lecture 14 Binary Adders and Subtractors. 2 Overview °Addition and subtraction of binary data is fundamental Need to determine hardware implementation.
Number Representation (Part 2) Computer Architecture (Fall 2006)
ECE DIGITAL LOGIC LECTURE 15: COMBINATIONAL CIRCUITS Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2015, 10/20/2015.
CS151 Introduction to Digital Design Chapter 4: Arithmetic Functions and HDLs 4-1: Iterative Combinational Circuits 4-2: Binary Adders 1Created by: Ms.Amany.
UNIT 8 COMBINATIONAL CIRCUIT DESIGN AND SIMULATION USING GATES
ETE 204 – Digital Electronics Combinational Logic Design Single-bit and Multiple-bit Adder Circuits [Lecture: 9] Instructor: Sajib Roy Lecturer, ETE,ULAB.
Gunjeet Kaur Dronacharya Group of Institutions. Binary Adder-Subtractor A combinational circuit that performs the addition of two bits is called a half.
Combinational Circuits
CS2100 Computer Organisation
Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables, logic gates,
Combinational Logic Circuits
Reference: Moris Mano 4th Edition Chapter 4
Summary Half-Adder Basic rules of binary addition are performed by a half adder, which has two binary inputs (A and B) and two binary outputs (Carry out.
FUNCTION OF COMBINATIONAL LOGIC CIRCUIT
ECE 331 – Digital System Design
CSE Winter 2001 – Arithmetic Unit - 1
COMS 361 Computer Organization
Multiple function unit design
Combinational Circuits
Adder and Subtractors Discussion D4.1. Adder and Subtractor Circuits Objective: (i) To construct half and full adder circuit and verify its working (ii)
Half & Full Subtractor Half Subtractor Full Subtractor.
Half & Full Subtractor Half Subtractor Full Subtractor.
More Example.
Computer Architecture
Presentation transcript:

Morgan Kaufmann Publishers 24 April, 2017 Block Level Design Chapter 4 — The Processor

Outline Block-Level Design 4-bit Parallel Adder BCD-to-Excess-3 Code Converter 16-bit Parallel Adder 4-bit Parallel Adder cum Subtractor

Outline Block-Level Design 4-bit Parallel Adder BCD-to-Excess-3 Code Converter 16-bit Parallel Adder 4-bit Parallel Adder cum Subtractor

Block-Level Design Method More complex circuits can also be built using block-level method. In general, block-level design method (as opposed to gate-level design) relies on algorithms or formulae of the circuit, which are obtained by decomposing the main problem to sub-problems recursively (until small enough to be directly solved by blocks of circuits). Simple examples using 4-bit parallel adder as building blocks: (1) BCD-to-Excess-3 Code Conversion (2) 16-Bit Parallel Adder (3) Adder cum Subtractor

Outline Block-Level Design 4-bit Parallel Adder BCD-to-Excess-3 Code Converter 16-bit Parallel Adder 4-bit Parallel Adder cum Subtractor

4-bit Parallel Adder (1/4) Consider a circuit to add two 4-bit numbers together and a carry-in, to produce a 5-bit result: 4-bit Parallel Adder C5 C1 X2 X1 Y4 Y3 S4 S3 S2 S1 Y2 Y1 X4 X3 Black-box view of 4-bit parallel adder 5-bit result is sufficient because the largest result is: (1111)2+(1111)2+(1)2 = (11111)2

4-bit Parallel Adder (2/4) SSI design technique should not be used. Truth table for 9 inputs very big, i.e. 29=512 entries: Simplification very complicated.

4-bit Parallel Adder (3/4) Alternative design possible. Addition formulae for each pair of bits (with carry in), Ci+1Si = Xi + Yi + Ci has the same function as a full adder. Ci+1 = Xi .Yi + (Xi  Yi ) .Ci Si = Xi  Yi  Ci

4-bit Parallel Adder (4/4) Cascading 4 full adders via their carries, we get: C1 Y1 X1 S1 FA C2 C5 Y2 X2 S2 C3 Y3 X3 S3 C4 Y4 X4 S4 Output Input

Parallel Adders Note that carry propagated by cascading the carry from one full adder to the next. Called Parallel Adder because inputs are presented simultaneously (in parallel). Also, called Ripple-Carry Adder.

Outline Block-Level Design 4-bit Parallel Adder BCD-to-Excess-3 Code Converter 16-bit Parallel Adder 4-bit Parallel Adder cum Subtractor

BCD-to-Excess-3 Code Converter (1/2) Excess-3 code can be converted from BCD code using truth table: Gate-level design can be used since only 4 inputs. However, alternative design possible. Use problem-specific formulae: Excess-3 Code = BCD Code + (0011)2

BCD-to-Excess-3 Code Converter (2/2) Excess-3 Code = BCD Code + (0011)2 Block-level circuit: 4-bit Parallel Adder X4 X3 X2 X1 Y4 Y3 Y2 Y1 1 S4 S3 S2 S1 BCD code Excess-3 unused Cin Cout A BCD-to-Excess-3 Code Converter

Outline Block-Level Design 4-bit Parallel Adder BCD-to-Excess-3 Code Converter 16-bit Parallel Adder 4-bit Parallel Adder cum Subtractor

16-bit Parallel Adder (1/2) Larger parallel adders can be built from smaller ones. Example: a 16-bit parallel adder can be constructed from four 4-bit parallel adders: 4-bit // adder X4..X1 Y4..Y1 C1 S4..S1 X8..X5 Y8..Y5 C5 S8..S5 X12..X9 Y12..Y9 C9 S12..S9 X16..X13 Y16..Y13 C13 S16..S13 C17 4 A 16-bit parallel adder

16-bit Parallel Adder (2/2) Shortened notation for multiple lines. 4 S4 .. S1 S4 S3 S2 S1 is a shortened notation for 16-bit parallel adder ripples carry from one 4-bit block to the next. Such ripple-carry circuits are “slow” because of long delays needed to propagate the carries.

Outline Block-Level Design 4-bit Parallel Adder BCD-to-Excess-3 Code Converter 16-bit Parallel Adder 4-bit Parallel Adder cum Subtractor

4-bit Parallel Adder cum Subtractor (1/4) Subtraction can be performed through addition using 2s-complement numbers. Hence, we can design a circuit which can perform both addition and subtraction, using a parallel adder. 4-bit adder cum subtractor S: control signal for add/subtract X2 X1 Y4 Y3 Result: either X+Y or X-Y Y2 Y1 X4 X3

4-bit Parallel Adder cum Subtractor (2/4) The control signal S=0 means add S=1 means subtract Recall that: X-Y = X + (-Y) = X + (2’s complement of Y) = X + (1’s complement of Y) +1 X+Y = X + (Y)

4-bit Parallel Adder cum Subtractor (3/4) Design requires: (i) XOR gates: S = 0 Y S = 1 Y' Y such that: output = Y when S=0 = Y' when S=1 (ii) S connected to carry-in.

4-bit Parallel Adder cum Subtractor (4/4) Adder cum subtractor circuit: 4-bit parallel adder X2 X1 Y4 Y3 Y2 Y1 X4 X3 S2 S1 S4 S3 C S Cin Cout Analysis: If S=1, then X + (1's complement of Y) +1 appears as the result. If S=0, then X+Y appears as the result. A 4-bit adder cum subtractor