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

Slides:

Advertisements

Similar presentations

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

Advertisements

CSE-221 Digital Logic Design (DLD)

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

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

16/07/2015CSE1303 Part B lecture notes 1 Hardware Implementation Lecture B17 Lecture notes section B17.

Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.

CS 105 Digital Logic Design

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

Logic Design CS221 1 st Term combinational circuits Cairo University Faculty of Computers and Information.

Binary Addition CSC 103 September 17, 2007.

XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.

Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.

+ CS 325: CS Hardware and Software Organization and Architecture Combinational Circuits 1.

Digital Components and Combinational Circuits Sachin Kharady.

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.

1 CMSC 250 Chapter 1, con't., Combinatorial circuits.

Functions of Combinational Logic

WEEK #10 FUNCTIONS OF COMBINATIONAL LOGIC (ADDERS)

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)

Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.

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

Digital Electronics and Computer Interfacing

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}

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

4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.

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.

Number Systems and Circuits for Addition Lecture 5 Section 1.5 Thu, Jan 26, 2006.

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

1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.

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

How computers calculate How binary operations yield complex capabilities.

CS 105 DIGITAL LOGIC DESIGN Chapter 4 Combinational Logic 1.

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

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

© 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.

C OMBINATIONAL L OGIC D ESIGN 1 Eng.Maha AlGubali.

Explain Half Adder and Full Adder with Truth Table.

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

Logic Design (CE1111 ) Lecture 4 (Chapter 4) Combinational Logic Prepared by Dr. Lamiaa Elshenawy 1.

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.

COMBINATIONAL AND SEQUENTIAL CIRCUITS Guided By: Prof. P. B. Swadas Prepared By: BIRLA VISHVAKARMA MAHAVDYALAYA.

Chapter 3 Boolean Algebra and Digital Logic T103: Computer architecture, logic and information processing.

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

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.

Combinational Circuits

ECE 3130 Digital Electronics and Design

Digital Components and Combinational Circuits

Combinational Circuits

Dr. Clincy Professor of CS

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.

FIGURE 4.1 Block diagram of combinational circuit

Week 7: Gates and Circuits: PART II

Number Systems and Circuits for Addition

Dr. Clincy Professor of CS

DIGITAL ELECTRONICS B.SC FY

Logic Circuits I Lecture 3.

XOR, XNOR, and Binary Adders

Combinational Circuits

XOR Function Logic Symbol  Description  Truth Table 

Digital Circuits and Logic

Presentation transcript:

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

Combinational Circuits Digital logic circuits can be categorized as: –Combinational circuits –Sequential circuits Combination logic is used to build circuits that contain basic Boolean operators, inputs and outputs. The key to recognize a combinational circuit –an output is always based entirely on the given inputs. Combinational circuit: –The output of a combinational circuit is a function of its inputs, –the output is uniquely determined by the values of the inputs at any given moments. 2

Half-Adder Half adder: –A typical combinational circuit –Adding two binary digits together. How to construct a half-adder? The truth table reveals that –Sum is actually an XOR. –Carry is equivalent to an AND gate. Combining an XOR gate and an AND gate results in the logic diagram for a half-adder. 3

Full-Adder 4

5

Ripple-Carry Adder A full-adder is capable of adding only three bits. Full adders can connected in series to add binary numbers. This type of circuit is called a ripple-carry adder because of the sequential generation of carries that “ripple” through the adder stages. 6 Today’s systems employ more efficient adders.

7 Decoders

Multiplexer 8

9 A look Inside a Multiplexer with four inputs and two control lines A Multiplexer Symbol

10 Bit Shifting moves the bits of a word or byte one position to the left or right. Bit Shifting A 4-bit shifter: When the control line, S, is low, left shift occurs; when S is high, right shift occurs.

11 Bit Shifting moves the bits of a word or byte one position to the left or right. Bit Shifting - left A 4-bit shifter: When the control line, S, is low, left shift occurs; when S is high, right shift occurs. XX X

12 Bit Shifting moves the bits of a word or byte one position to the left or right. Bit Shifting - right A 4-bit shifter: When the control line, S, is low, left shift occurs; when S is high, right shift occurs. X X X