Digitale basistechniek lesplan DatumTheoriePrakticumThuis 7 januariCombinational LogicTutorial Quartus II Herhaling Tutorial 12 JanuariCombinational LogicHalfadderFulladder.

Slides:



Advertisements
Similar presentations
CS1103 Digital Logic Design
Advertisements

Basic Logic Gates Discussion D5.1 Section Sections 13-3, 13-4.
Logic Gates.
CT455: Computer Organization Logic gate
Introduction to Logic Gates
Morgan Kaufmann Publishers
Logic Gate Level Part 2. Constructing Boolean expression from truth table First method: write nonparenthesized OR of ANDs Each AND is a 1 in the result.
CS 151 Digital Systems Design Lecture 11 NAND and XOR Implementations.
CS 151 Digital Systems Design Lecture 7 More Logic Functions: NAND, NOR, XOR.
ENGIN112 L11: NAND and XOR Implementation September 26, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 11 NAND and XOR Implementations.
EE2174: Digital Logic and Lab Professor Shiyan Hu Department of Electrical and Computer Engineering Michigan Technological University CHAPTER 4 Technology.
ECE 331 – Digital System Design Multi-level Logic Circuits and NAND-NAND and NOR-NOR Circuits (Lecture #8) The slides included herein were taken from the.
Computer Engineering (Logic Circuits) (Karnaugh Map)
1 EECC341 - Shaaban #1 Lec # 6 Winter Combinational Circuit Analysis Example Given this logic circuit we can : Find corresponding logic.
ENGG 1203 Tutorial Combinational Logic (I) 1 Feb Learning Objectives
2.7 NAND and NOR logic networks
Unit 7 Multi-Level Gate Circuits / NAND and NOR Gates Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information.
Computer Organization
1 Why study Boolean Algebra? 4 It is highly desirable to find the simplest circuit implementation (logic) with the smallest number of gates or wires. We.
BOOLEAN ALGEBRA Saras M. Srivastava PGT (Computer Science)
1 DIGITAL ELECTRONICS. 2 OVERVIEW –electronic circuits capable of carrying out logical (boolean) and arithmetic operations on information stored as binary.
BR 1/991 Two ways to think about logic signals Fixed logic convention –High voltage always means 1, TRUE, Asserted –Low voltage always means 0, FALSE,
EE2420 – Digital Logic Summer II 2013 Hassan Salamy Ingram School of Engineering Texas State University Set 4: Other Gates.
Logic Gates. Outline  Logic Gates  The Inverter  The AND Gate  The OR Gate  The NAND Gate  The NOR Gate  The XOR Gate  The XNOR Gate  Drawing.
Chapter 33 Basic Logic Gates. 2 Objectives –After completing this chapter, the student should be able to: Identify and explain the function of the basic.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
Basic logic gates  AND gate:The truth table is given by A.BBA
Chapter 3 Gate-Level Minimization
Boolean Logic and Circuits ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.
Boolean Algebra Combinational-Circuit Analysis We analyze a combinational logic circuit by obtaining a formal description of its logic function. Once.
NAND-NAND and NOR-NOR Circuits and Even and Odd Logic Functions
CH51 Chapter 5 Combinational Logic By Taweesak Reungpeerakul.
COE 202: Digital Logic Design Combinational Logic Part 4
Computer Organization and Design Transistors & Logic - II Montek Singh Wed, Oct 16, 2013 Lecture 10.
1 EG 32 Digital Electronics Thought for the day You learn from your mistakes..... So make as many as you can and you will eventually know everything.
Implementation of SOP/POS Expressions
CS 121 Digital Logic Design Gate-Level Minimization Chapter 3.
Lecture 09 NAND and XOR Implementations. Overview °Developing NAND circuits °Two-level implementations Convert from AND/OR to NAND (again!) °Multi-level.
Computer Organization and Design Transistors & Logic - II Montek Singh Oct {21,28}, 2015 Lecture 10.
1 Logic Gates and Circuits  Logic Gates Logic Gates  The Inverter The Inverter  The AND Gate The AND Gate  The OR Gate The OR Gate  The NAND Gate.
Ahmad Almulhem, KFUPM 2010 COE 202: Digital Logic Design Combinational Logic Part 4 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:
Digital Integrated Circuit Design Laboratory Department of Computer Science and Information Engineering National Cheng Kung University Experiment on digital.
NAND-NAND and NOR-NOR Circuits and Even and Odd Logic Functions ECE 301 – Digital Electronics.
1 Lect # 2 Boolean Algebra and Logic Gates Boolean algebra defines rules for manipulating symbolic binary logic expressions. –a symbolic binary logic expression.
5 - Digital Logic with Boolean Algebra
Logic Gates. A logic gate is an elementary building block of a digital circuit. Most logic gates have two inputs and one output. At any given moment,
Topic 4 – Switching Circuits. Serial vs. Parallel Transmission Circuit elements can be connected in either a serial or parallel manner. Serial implies.
ECE 171 Digital Circuits Chapter 6 Logic Circuits Herbert G. Mayer, PSU Status 1/16/2016 Copied with Permission from prof. Mark PSU ECE.
Chapter 3 Digital Logic Structures
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR and parity check Circuits.
DeMorgan’s Theorem DeMorgan’s 2 nd Theorem The complement of a sum of variables is equal to the product of the complemented variables. A + B = A. B Applying.
Boolean or, Switching Algebra. Switching Algebra The two-valued Boolean algebra is also called “Switching algebra” by engineers and computer scientists.
Logic Gates and Boolean Algebra Introduction to Logic II.
Dr. Ameria Eldosoky Discrete mathematics
CS2100 Computer Organisation
CS2100 Computer Organisation
Lecture 6 Topics Combinational Logic Circuits
Introduction to Logic Gates
Computer Organization and Design Transistors & Logic - II
Lecture 2-1 Boolean Algebra
Digital Signals Digital Signals have two basic states:
Basic Digital Logic Basic Gates
Boolean Algebra Why study Boolean Algebra?
Boolean Algebra & Logic Circuits
Universal gates.
King Fahd University of Petroleum and Minerals
Discussion D5.1 Section Sections 13-3, 13-4
Boolean Algebra and Gate Networks
Digitale basistechniek lesplan
Presentation transcript:

Digitale basistechniek lesplan DatumTheoriePrakticumThuis 7 januariCombinational LogicTutorial Quartus II Herhaling Tutorial 12 JanuariCombinational LogicHalfadderFulladder 14 JanuariFunctions of Combinational Logic 2 bit decoderBCDto7seg 19 JanuariFunctions of Combinational Logic 2-1 mux1-2 demux 21 JanuariFlip-Flops and related devices Gated d- latch(8.3) Example JanuariCounters en Statemachines Frequency divider8.11) 28 JanuariCounters en Statemachines 4 bit synch counter, verkeerslicht 2 februariHerhalingVerkeerslicht 2 4 februariOefententamen 9 februariTentamen

Bepaling van het eindcijfer Het eindcijfer wordt bepaald door: 1 Voldoende Praktikum. (O/V) Tentamencijfer.

Introduction to Logic Gates Logical gates –Inverter –AND –OR –NAND –NOR –Exclusive OR (XOR) –Exclusive NOR (XNOR) Draw Logic Circuit Analysis of Logic Circuit

Introduction to Logic Gates Universal gates NAND and NOR –NAND gate –NOR gate Execution using NAND gate Execution using NOR gate Positive & Negative Logic SOP Expression Execution POS Expression Execution Integrated Logic Circuit Family

Logic Gates

Inverter gate The use of inverter: complement

Logic Gates AND gate

Logic Gates OR gate

Logic Gates NAND gate

Logic Gates NOR gate

Logic Gates Exclusive OR (XOR) gate

Logic Gates Exclusive NOR (XNOR) gate

Draw Logic Gates When Boolean expression is obtained, we can draw logic gates Example: –F1 = xyz’ (use three input AND gate)

Draw Logic Gates

Logic Circuit Analysis When logic circuit is given, we can analyze the circuit to obtain logical expression Example: –What is the Boolean expression for F4

Logic Circuit Analysis What is the Boolean expression for F5

Universal Gates: NAND & NOR Gate AND/OR/NOT is enough to build any Boolean function Even though, other gates is also used because: –Very useful (no choice) –Save transistor’s number –Self sufficient (can build any gate from it) NAND/NOR: save, self sufficient XOR: useful (e.g. execute parity bit)

NAND Gate NAND gate is self sufficient (i.e.can build any gate from it) Can be used for building AND/OR/NOT gate Build NOT gate using NAND gate

NAND Gate Build AND gate using NAND gates Build OR gate using NAND gates

NOR Gate NOR gate is also self sufficient Can be used for building AND/OR/NOT gate Build NOT gate using NOR gate

NOR Gate Build AND gate using NOR gates Build OR gate using NOR gates

Build using NAND gate It is not impossible to build Boolean expression using NAND gates Steps –Obtain sum-of-product Boolean expression E.g: F3 = xy’ +x’z –Use DeMorgan theorem to get expression using two level NAND gate E.g: F3 = xy’ +x’z = (xy’+x’z)” = ((xy’)’.(x’z)’)’

Build using NAND gate

Build using NOR gate It is not impossible to build Boolean expression using NOR gates Steps –Obtain product-of-sum Boolean expression E.g: F6 = (x+y’).(x’+z) –Use DeMorgan theorem to get expression using two level NAND gate E.g: F3 = (x+y’).(x’+z) =((x+y’).(x’+z))’’ = ((x+y’)+(x’+z)’)’

Build using NOR gate

Positive & Negative Logic In logic gate, most of the time –H (High Voltage, 5V) = logic 1 –L (Low Voltage, 0V) = logic 0 This is called positive logic However, if it is inverted, it is negative logic –H (High Voltage, 5V) = logic 0 –L (Low Voltage, 0V) = logic 1 Depends, some similar gate need different Boolean function

Positive & Negative Logic Signal which is set to logic 1 is said to be active and true Signal which is set to logic 0 is said to be not active and false The name of active high signal is always written in non-compliment form The name of active low signal is always written in non-compliment form

Positive & Negative Logic

Construction of SOP Expression Sum-of-product expression can be built using –Two level logic gate AND-OR –Two level logic gate AND-NOT Logic AND-OR gate

Construction of SOP Expression NAND-NAND circuit (with transformation circuit) –Add two balls –Change OR with NAND with inverted input and ball on it’s compliment input

Construction of POS Expression Product-of-sum expression can be built using –Two level logic gate AND-OR –Two level logic gate AND-NOT Logic AND-OR gate

Construction of POS Expression NOR-NOR circuit (with transformation circuit) –Add two balls –Change AND with NOR with inverted input and ball on it’s compliment input ”: