DeMorgan’s Law and Gates

Slides:



Advertisements
Similar presentations
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.
Advertisements

Introduction So far, we have studied the basic skills of designing combinational and sequential logic using schematic and Verilog-HDL Now, we are going.
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:
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
Arithmetic-Logic Units CPSC 321 Computer Architecture Andreas Klappenecker.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
 Arithmetic circuit  Addition  Subtraction  Division  Multiplication.
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
Using building blocks to make bigger circuits
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.
Complementary CMOS Logic Style Construction (cont.)
Digital Electronics and Computer Interfacing
Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
Half Adder & Full Adder Patrick Marshall. Intro Adding binary digits Half adder Full adder Parallel adder (ripple carry) Arithmetic overflow.
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 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
COMP541 Arithmetic Circuits
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
Chapter 3 Digital Logic Structures
Computer Arthmetic Chapter Four P&H. Data Representation Why do we not encode numbers as strings of ASCII digits inside computers? What is overflow when.
How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B A B
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
C OMBINATIONAL L OGIC D ESIGN 1 Eng.Maha AlGubali.
Gunjeet Kaur Dronacharya Group of Institutions. Binary Adder-Subtractor A combinational circuit that performs the addition of two bits is called a half.
Computer Arthmetic Chapter Four P&H.
Combinational Circuits
ECE 3130 Digital Electronics and Design
ECE 3130 Digital Electronics and Design
Discussion 2: More to discuss
ECE 2110: Introduction to Digital Systems
CMPE212 Discussion Patrick Sykes
Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables, logic gates,
COMP211 Computer Logic Design Lecture 3. Combinational Logic 2
Combinational Circuits
Computer Architecture CST 250
Multipliers Multipliers play an important role in today’s digital signal processing and various other applications. The common multiplication method is.
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
CSE Winter 2001 – Arithmetic Unit - 1
CSCE 211: Digital Logic Design
CSCE 211: Digital Logic Design
XOR, XNOR, & Binary Adders
Week 7: Gates and Circuits: PART II
Digital Logic.
Number Systems and Circuits for Addition
CSE 140L Discussion 3 CK Cheng and Thomas Weng
CSCE 211: Digital Logic Design
COMS 361 Computer Organization
CSCE 211: Digital Logic Design
Part III The Arithmetic/Logic Unit
Digital Logic.
DIGITAL ELECTRONICS B.SC FY
Chapter 10.3 and 10.4: Combinatorial Circuits
XOR, XNOR, and Binary Adders
ECE 352 Digital System Fundamentals
ECE 352 Digital System Fundamentals
XOR Function Logic Symbol  Description  Truth Table 
Design of Digital Circuits Lab 5 Supplement: Implementing an ALU
Adder Circuits By: Asst Lec. Basma Nazar
Digital 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)
XOR, XNOR, and Binary Adders
Chapter 10 Introduction to VHDL
More Example.
Lecture 3 Combinational units. Adders
CMPE212 Discussion 10/3/14 Patrick Sykes
Presentation transcript:

DeMorgan’s Law and Gates CMPE212 Discussion 9/19/2014 Patrick Sykes

In Lab Today Learn how to use the function generator and oscilloscope. We’ll connect the function generator and oscilloscope to check gate time delays. We’ll verify DeMorgan’s laws.

Digital Design Remember the mystery circuit from last discussion? This is known as a half-adder and used to add two single bits together. The design is not scaleable. For example, combining N half-adders to perform N bit addition.

Let’s Design

Verilog Practice We will be revisiting this circuit several times throughout the semester. Try to implement the Full Adder circuit in Verilog.

Full Adder continued Notice that our implementation now takes a third input, a carry-in Connecting multiple Full Adders can be used to do N bit addition. However, this creates an issue.

Time Delay There is currently a speed limit to our signals This causes a delay from the input of a circuit to the output For our purposes so far, the time delay is so short we don’t notice it.

Time Delay Critical path: The longest necessary path through a circuit In lab, we want to exaggerate the critical path There is a large critical path in our adder, all of the carrys There are ways to deal with this, which you will learn in class

DeMorgan’s Laws Get used to them because they’ll be very useful

Questions?