ECE 301 – Digital Electronics

Slides:

Advertisements

Similar presentations

ADDER, HALF ADDER & FULL ADDER

Advertisements

Digital Circuits. Review – Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every.

ECE 331 – Digital System Design

ECE 301 – Digital Electronics Karnaugh Maps (Lecture #7) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design,

ECE 301 – Digital Electronics Circuit Design and Analysis (Lecture #9A) The slides included herein were taken from the materials accompanying Fundamentals.

ECE 331 – Digital System Design Boolean Algebra (Lecture #3) The slides included herein were taken from the materials accompanying Fundamentals of Logic.

ECE 331 – Digital System Design Introduction to and Analysis of Sequential Logic Circuits (Lecture #20) The slides included herein were taken from the.

ECE 301 – Digital Electronics Minterm and Maxterm Expansions and Incompletely Specified Functions (Lecture #6) The slides included herein were taken from.

ECE 331 – Digital System Design

Gates and Circuits. Three Main Gates  AND  OR  NOT.

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

Lecture 1: Introduction to Digital Logic Design CK Cheng Tuesday 4/1/02.

ECE 301 – Digital Electronics Number Systems and Conversion, Binary Arithmetic, and Representation of Negative Numbers (Lecture #10) The slides included.

ECE 331 – Digital System Design Counters (Lecture #19) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design,

ECE 301 – Digital Electronics

ECE 331 – Digital System Design Single-bit Adder Circuits and Adder Circuits in VHDL (Lecture #12) The slides included herein were taken from the materials.

ECE 331 – Digital System Design Karnaugh Maps and Determining a Minimal Cover (Lecture #7) The slides included herein were taken from the materials accompanying.

ECE 331 – Digital System Design Sequential Circuit Design (Lecture #23) The slides included herein were taken from the materials accompanying Fundamentals.

ECE 301 – Digital Electronics

Combinational circuits

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

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

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.

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.

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.

ECE 331 – Digital System Design Circuit Design and Analysis (Lecture #9A) The slides included herein were taken from the materials accompanying Fundamentals.

ECE 331 – Digital System Design Single-bit Adder Circuits and Adder Circuits in VHDL (Lecture #11) The slides included herein were taken from the materials.

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

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

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

Computer Science 101 More Devices: Arithmetic. From 1-Bit Equality to N-Bit Equality = A B A = B Two bit strings.

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

ECE 331 – Digital System Design Basic Logic Operations, Boolean Expressions and Truth Tables, and Standard Logic Gates The slides included herein were.

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.

Logic Gates Learning Objectives Learn that there is a one-to-one relationship between logic gates and Boolean expressions Learn how logic gates are combined.

ECE 331 – Digital System Design

ECE 301 – Digital Electronics

ECE 3130 Digital Electronics and Design

Digital Logic Design 1st Exam Solution

Combinational Circuits

Computer Architecture CST 250

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.

XOR, XNOR, and Binary Adders

ECE 331 – Digital System Design

ECE 331 – Digital System Design

Elec 2607 Digital Switching Circuits

XOR, XNOR, & Binary Adders

ECE 331 – Digital System Design

Week 7: Gates and Circuits: PART II

ECE 331 – Digital System Design

Number Systems and Circuits for Addition

DIGITAL ELECTRONICS B.SC FY

XOR, XNOR, and Binary Adders

Electronics for Physicists

XOR Function Logic Symbol  Description  Truth Table 

Adder Circuits By: Asst Lec. Basma Nazar

Digital Circuits.

XOR, XNOR, and Binary Adders

Unit IV Adders Subtractors Flip Flops Counters Multiplexes and De multiplexes. Integrated circuits-Op. amp – Characteristics Inverting amplifier - Non-inverting.

Presentation transcript:

ECE 301 – Digital Electronics Single-bit Adder Circuits (Lecture #12) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design, 6th Edition, by Roth and Kinney, and were used with permission from Cengage Learning.

ECE 301 - Digital Electronics The Half Adder (HA) Fall 2010 ECE 301 - Digital Electronics

ECE 301 - Digital Electronics The Half Adder 0 0 1 1 + 0 + 1 + 0 + 1 0 1 1 10 Sum Carry Fall 2010 ECE 301 - Digital Electronics

ECE 301 - Digital Electronics The Half Adder A B Sum Carry 1 Truth Table Fall 2010 ECE 301 - Digital Electronics

The Half Adder Given the truth table on the previous slide, 1. Derive the Boolean expressions for the sum and carry. 2. Draw the corresponding circuit diagram. Fall 2010 ECE 301 - Digital Electronics

ECE 301 - Digital Electronics The Full Adder (FA) Fall 2010 ECE 301 - Digital Electronics

ECE 301 - Digital Electronics The Full Adder 0 0 0 0 0 0 1 1 + 0 + 1 + 0 + 1 0 1 1 10 Carry-in 1 1 1 1 0 0 1 1 + 0 + 1 + 0 + 1 1 10 10 11 Carry-out Sum Fall 2010 ECE 301 - Digital Electronics

ECE 301 - Digital Electronics The Full Adder A B Cin Sum Cout 1 Truth Table Fall 2010 ECE 301 - Digital Electronics

The Full Adder Given the truth table on the previous slide, 1. Derive the Boolean expressions for the sum and carry-out. 2. Draw the corresponding circuit diagram. Fall 2010 ECE 301 - Digital Electronics

Design the Full Adder hierarchically, using 2 Half Adders 1 OR gate Fall 2010 ECE 301 - Digital Electronics

ECE 301 - Digital Electronics The Full Adder Half Adder (ha2) Cin Sum B A Cout Half Adder (ha1) Fall 2010 ECE 301 - Digital Electronics

ECE 301 - Digital Electronics Questions? Fall 2010 ECE 301 - Digital Electronics