Boolean 4.1 Boolean Logic 4 ©Paul Godin Created September 2007 gmail.com.

Slides:



Advertisements
Similar presentations
Programming Logic Gate Functions in PLCs
Advertisements

Boolean Algebra and Reduction Techniques
Gate-level Minimization
ECE 2373 Modern Digital System Design Exam 2. ECE 2372 Exam 2 Thursday March 5 You may use two 8 ½” x 11” pages of information, front and back, write.
ECE 331 – Digital System Design Boolean Algebra (Lecture #3) The slides included herein were taken from the materials accompanying Fundamentals of Logic.
ENGIN112 L8: Minimization with Karnaugh Maps September 19, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 8 Minimization with Karnaugh.
Relationship Between Basic Operation of Boolean and Basic Logic Gate The basic construction of a logical circuit is gates Gate is an electronic circuit.
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
ENGIN112 L12: Circuit Analysis Procedure September 29, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 12 Circuit Analysis Procedure.
ENGG 1203 Tutorial Combinational Logic (I) 1 Feb Learning Objectives
Boolean Algebra and Logic Simplification. Boolean Addition & Multiplication Boolean Addition performed by OR gate Sum Term describes Boolean Addition.
Digital Logic Design Adil Waheed. BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION AND gate F = A.B OR gate F = A + B NOT gate F = A NAND gate F = A.B NOR gate.
Boolean Algebra and Logic Simplification
Introduction to Digital Design Lab Project
1 Fundamentals of Computer Science Propositional Logic (Boolean Algebra)
Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.
DeMorgan Theorem, Computer Simulation Exercises
Boolean Algebra and Digital Circuits
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC. K-Map (1)  Karnaugh Mapping is used to minimize the number of logic gates that are required in a digital circuit.
Digital Electronics Lecture 4 Simplification using Boolean Algebra, Combinational Logic Circuit Design.
Digital Circuits Design Chin-Sung Lin Eleanor Roosevelt High School.
Digital Electronics Lecture 6 Combinational Logic Circuit Design.
Basic Digital Logic 2 Combinational Logic
Why? What’s Boolean algebra used for? –“The purpose of Boolean algebra is to facilitate the analysis and design of digital circuits.” Express a truth table.
Circuit Simplification Truth Table  Minimized Logic Gates.
Basic Gates 3.1 Basic Digital Logic: NAND and NOR Gates ©Paul Godin Created September 2007 Last Update Sept 2009.
CH51 Chapter 5 Combinational Logic By Taweesak Reungpeerakul.
Basic Digital Logic: NAND and NOR Gates Technician Series ©Paul Godin Last Update Dec 2014.
Boolean Logic 1 Technician Series Boolean 1.1 ©Paul Godin Created Jan 2015 gmail.com.
COMBINATIONAL LOGIC Circuit Design. Steps Create the truth table Extract the Boolean Expression from the truth table or create a K-Map Simplify the expression.
Steering Gates, Timing Diagrams & Combinational Logic Technician Series Steering 1.1 ©Paul Godin Created Jan 2014.
Basic Gates 2.1 Basic Digital Logic: Application of Digital Gates using AND / OR / NOT ©Paul Godin Created August 2007 Last Update Sept 2013 Basic Gates.
Boolean Algebra and Reduction Techniques
Basic Gates 1.1 Basic Digital Logic: AND, OR and NOT gates ©Paul Godin Created August 2007 Last Update Sept 2013.
Boolean 1.1 Boolean Logic 1 ©Paul Godin Created September 2007 Last Edit September 2009 gmail.com.
Karnaugh Maps (K maps). What are Karnaugh 1 maps?  Karnaugh maps provide an alternative way of simplifying logic circuits.  Instead of using Boolean.
DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
THE K-MAP.
Circuits & Boolean Expressions. A ABC BC ABC C B A Example # 1: Boolean Expression: Develop a Boolean expression from a circuit.
Karnaugh Maps (K maps).
CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.
CEC 220 Digital Circuit Design SOP and POS forms Friday, Sept 11 CEC 220 Digital Circuit Design Slide 1 of 17.
Logic Gates and Boolean Algebra Introduction to Logic II.
Circuits, Truth Tables & Boolean Algebra. Expressions Can describe circuits in terms of Boolean expression.
Boolean 3.1 Boolean Logic 3 ©Paul Godin Created September 2007 Last edit Sept 2009.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC:K-Map. K-Map (1)  Karnaugh Map provides a systematic method for simplifying Boolean expressions and may produce.
Digital Logic Design. Truth Table  Logic Circuit 1. Start with truth table 2. When your output is a 1, figure out the combination of inputs, ANDs, and.
Digital Logic & Design Dr. Waseem Ikram Lecture 09.
Logic Gates and Boolean Algebra
De Morgan’s Theorem,.
ECE 2110: Introduction to Digital Systems
Boolean Expressions Lecture No. 10.
Circuits & Boolean Expressions
Combinational Logic Design Process
Circuits, Truth Tables & Boolean Algebra
Universal gates.
Latch Practice Problems 1
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION Part (a)
Boolean Logic 2 ©Paul Godin Created September 2007 Last edit Sept 2009
Edge-Based Circuits DIGI-260 ©Paul R. Godin gmail.com.
Electrical Characteristics Practice Problems #1
Basic Digital Logic: AND, OR and NOT gates Technician Series
Combinational Logic Practice Problems gmail.com Jan 2015.
Karnaugh Maps (K maps).
Principles & Applications
Laws & Rules of Boolean Algebra
Circuits & Boolean Expressions
Presentation transcript:

Boolean 4.1 Boolean Logic 4 ©Paul Godin Created September 2007 gmail.com

Boolean 4.2 Solving Logic Problems

Boolean 4.3 Solving Logic Problems ◊Digital logic problems are often expressed in a verbal format. ◊“I need a circuit that does this when that happens...” ◊Problem-solving steps generally involve structuring the problem into a logic format, simplifying, designing, simulating, prototyping, constructing and evaluating. ◊There are application software tools available to help with the simplification process (seen later).

Boolean 4.4 First Step: Logic Format Convert the problem to a structured logic format. A’C’ + BC + ABC’ Truth Table Boolean equation Timing Diagram A B Z Logic Diagram AA’BCY

Boolean 4.5 Second Step: Simplify Simplify the problem using reduction techniques DC BA (AB+C)+(A+BD)+E (ABC)+(ABC)+(ABC)+(ABC) = W Boolean algebraic reduction K-Mapping SOP from a Truth Table to Boolean or K-Map AB'C'+AC'D'+E

Boolean 4.6 Third Step: Design Create a logic circuit, preferably with simulation software. Consider universal gates. Logic Circuit Logic Circuit, NAND Only

Boolean 4.7 Fourth Step: Simulate Analyse the functionality of the simulated circuit. Input/Output Timing Diagram (Logic Analysis)

Boolean 4.8 Fifth Step: Prototype Construct a prototype circuit. Select the devices based on electrical, environmental, physical and other requirements.

Boolean 4.9 Sixth Step: Construct and Evaluate Design and assemble a circuit board. Evaluate the physical circuit’s functionality within the limits of the environmental operating conditions.

Boolean 4.10 Exercise: Word problem to circuit ◊A water pump must start if any 2 adjacent sensors of its 4 sensors detects water, or if someone switches on an over-ride switch. ◊Design and simulate this circuit.

Boolean 4.11 ©Paul R. Godin prgodin gmail.com END 1011? 1101!