WEEK #10 FUNCTIONS OF COMBINATIONAL LOGIC (ADDERS)

Slides:

Advertisements

Similar presentations

SYEN 3330 Digital SystemsJung H. Kim Chapter5-1 1 SYEN 3330 Digital Systems Chapter 5 – Part 1.

Advertisements

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

DPSD This PPT Credits to : Ms. Elakya - AP / ECE.

Binary Addition. Binary Addition (1) Binary Addition (2)

CHAPTER 6 Functions of Combinational Logic

ECE 331 – Digital System Design

CSE-221 Digital Logic Design (DLD)

Arithmetic II CPSC 321 E. J. Kim. Today’s Menu Arithmetic-Logic Units Logic Design Revisited Faster Addition Multiplication (if time permits)

08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:

Design of Arithmetic Circuits – Adders, Subtractors, BCD adders

Digital Fundamentals Floyd Chapter 6 Tenth Edition

Combinational Logic1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.

ECE 301 – Digital Electronics

ECE 301 – Digital Electronics

Combinational circuits

ECE 331 – Digital System Design

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

Chapter 7 Arithmetic Operations and Circuits Hexadecimal Arithmetic 4 binary bits represent a single hexadecimal digit Addition –Add the digits.

CS 105 Digital Logic Design

Lecture No. 14 Combinational Functional Devices svbitec.wordpress.com.

Digital Logic Lecture 08 By Amr Al-Awamry. Combinational Logic 1 A combinational circuit consists of an interconnection of logic gates. Combinational.

EECS 370 Discussion 1 xkcd.com. EECS 370 Discussion Topics Today: – Floating Point – Finite State Machines – Combinational Logic – Sequential Logic 2.

Adders and Multipliers Review. ARITHMETIC CIRCUITS Is a combinational circuit that performs arithmetic operations, e.g. –Addition –Subtraction –Multiplication.

Morgan Kaufmann Publishers

Binary Addition CSC 103 September 17, 2007.

Binary Addition Section 4.5. Binary Addition Example.

ECE 3130 – Digital Electronics and Design

Eng. Mohammed Timraz Electronics & Communication Engineer University of Palestine Faculty of Engineering and Urban planning Software Engineering Department.

ADDERS Half Adders Recall that the basic rules of binary addition are as indicated below in Table 2-9. A circuit known as the half-adder carries out these.

Chapter 4 – Arithmetic Functions and HDLs Logic and Computer Design Fundamentals.

Functions of Combinational Logic

1 Adders & Subtractors Adders –An adder is a combinational logic circuit that performs the addition of 2 binary numbers (A & B) to generate the sum (S)

Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.

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}

Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.

Logic Gates Logic gates are electronic digital circuit perform logic functions. Commonly expected logic functions are already having the corresponding.

Computer Science 101 Circuit Design - Examples. Sum of Products Algorithm Identify each row of the output that has a 1. Identify each row of the output.

CHAPTER 4 Combinational Logic Design- Arithmetic Operation (Section 4.6&4.9)

Digital Logic. 2 Abstractions in CS (gates) Basic Gate: Inverter IO IO GNDI O Vcc Resister (limits conductivity) Truth Table.

9/15/09 - L15 Decoders, Multiplexers Copyright Joanne DeGroat, ECE, OSU1 Decoders and Multiplexer Circuits.

Half-Adder: A combinational circuit which adds two one-bit binary numbers is called a half-adder. The sum column resembles like an output of the XOR gate.

1 CS 151: Digital Design Chapter 4: Arithmetic Functions and Circuits 4-1,2: Iterative Combinational Circuits and Binary Adders.

Universal college of engineering & technology. .By Harsh Patel)

Logic and computers 2/6/12. Binary Arithmetic /6/ Only two digits: the bits 0 and 1 (Think: 0 = F, 1.

Sneha.  A combinational circuit that performs the addition of two bits is called a half adder.  It has two inputs.  It has two outputs.

Digital Design Module –II Adders Amit Kumar Assistant Professor SCSE, Galgotias University, Greater Noida.

Computer Architecture

1 Chapter 4 Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables,

Computing Machinery Chapter 3: Combinational Circuits.

CPEN Digital System Design

Number Systems and Circuits for Addition – Binary Adders Lecture 6 Section 1.5 Fri, Jan 26, 2007.

CEC 220 Digital Circuit Design

Addition and multiplication Arithmetic is the most basic thing you can do with a computer, but it’s not as easy as you might expect! These next few lectures.

1. 2 Figure 10.1 Truth table and schematic diagram for a binary half-adder Simple Adders Half-adder.

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.

CS151 Introduction to Digital Design Chapter 4: Arithmetic Functions and HDLs 4-1: Iterative Combinational Circuits 4-2: Binary Adders 1Created by: Ms.Amany.

LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.

Programming for GCSE Topic 9.2: Circuits for Adding T eaching L ondon C omputing William Marsh School of Electronic Engineering and Computer Science Queen.

ETE 204 – Digital Electronics Combinational Logic Design Single-bit and Multiple-bit Adder Circuits [Lecture: 9] Instructor: Sajib Roy Lecturer, ETE,ULAB.

Lecture No. 14 Combinational Functional Devices. Digital Logic &Design Dr. Waseem Ikram Lecture 14.

Addition and multiplication1 Arithmetic is the most basic thing you can do with a computer, but it’s not as easy as you might expect! These next few lectures.

ECEN 248 Lab 3: Study and Implementation of Adders Dept. of Electrical and Computer Engineering.

Half-Adder:  A combinational circuit which adds two one-bit binary numbers is called a half-adder. oThe sum column resembles like an output of the XOR.

Gunjeet Kaur Dronacharya Group of Institutions. Binary Adder-Subtractor A combinational circuit that performs the addition of two bits is called a half.

PRESENTATION Carry Look Ahead Adder.

Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables, logic gates,

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.

Number Systems and Circuits for Addition

XOR, XNOR, and Binary Adders

XOR Function Logic Symbol  Description  Truth Table 

Presentation transcript:

WEEK #10 FUNCTIONS OF COMBINATIONAL LOGIC (ADDERS) DKT 122/3 DIGITAL SYSTEM 1 WEEK #10 FUNCTIONS OF COMBINATIONAL LOGIC (ADDERS)

Topic Outlines ALL ABOUT ADDERS.. Basic Adders Half-adder Full-adder Parallel Binary Adders Ripple Carry Adders Carry Look-Ahead Adders

Something To Share About Adders.. By Lewis Carroll "Can you do addition?" the White Queen asked. "What's one and one and one and one and one and one and one and one and one and one?" "I don't know," said Alice. "I lost count." Through the Looking Glass.

Basic Adders Half-adder The half-adder (HA) accepts two binary digits on its inputs, A & B and produces two binary digits on its outputs, a sum bit,  and a carry bit, Cout Half Adder A B  Cout Half-adder block diagram Half-adder logic symbol

Basic Rule for Binary Addition Basic Adders Half-adder Half Adder Truth Table Inputs Outputs A 1 B 1 Cout 1  1 Basic Rule for Binary Addition 0 + 0 = 0 0 + 1 = 1 1 + 0 = 1 1 + 1 = 10 A B Sum, Cout Logic circuit for half-adder

Basic Adders Full-adder Full adder (FA) accepts two input bits, A & B and an input carry, Cin and generates a sum output,  and an output carry, Cout A Full Adder  B Cout Cin Full-adder block diagram Full-adder logic symbol

Basic Rule for Binary Addition Basic Adders Full Adder Truth Table Full-adder Inputs Outputs A 1 B 1 Cin 1 Cout 1  1 Basic Rule for Binary Addition 0 + 0 = 0 0 + 1 = 1 1 + 0 = 1 1 + 1 = 10

Basic Adders Full-adder Based on the previous truth-table, simplify the sum & carry equation using K-map method: Sum, Σ= ? Carry, Cout = ? Sum  AB Cin 00 01 11 10 1 Carry Cout AB Cin 00 01 11 10 1

Basic Adders Remember that Boolean operation for half-adder: For full-adder: Initially, it is known from the Truth-Table of Full-adder that For Cout,

Basic Adders Full-adder Logic circuit for full-adder Arrangement of two half-adders to form a full-adder

Parallel Binary Adders To add 2 binary numbers, a full adder is required for each bit in the numbers. So, for: 2-bit numbers -> 2 adders are needed; 4-bit numbers -> 4 adders are needed; & so on.. For the LSB position, can use either a half-adder; or full-adder (with carry input being made 0 (grounded)) Basic 2-bit parallel adder using 2 full adder

Parallel Binary Adders C4 is the output carry of the MSB adder C0 is the input carry to the LSB adder C0 C4 Σ3 Σ2 Σ1 Σ0 1 (LSB) … 4 (MSB) are the sum outputs Basic 4-bit parallel adder using 4 full-adder

Types of Parallel Adders ripple carry (RC) adder carry look-ahead (CLA) adder Differs in terms of how the internal carries from stage to stage are handled Externally, both types of adders are the same in term of inputs and outputs The difference is the speed at which they can add numbers  CLA is faster than RC

Ripple Carry Adders 4-bit parallel ripple carry adder (showing “worst-case” carry propagation delays)

Carry Look-Ahead Adders Conditions for carry generation & carry propagation

Carry Look-Ahead Adders Carry generation & carry propagation in terms of the input bits to a 4-bit adder.

Carry Look-Ahead Adders END Logic diagram for a 4-stage look-ahead carry adder