Week 3 Logic will get you from A to B. Imagination will take you everywhere. Albert Einstein.

Slides:



Advertisements
Similar presentations
Digital Circuits.
Advertisements

COE 202: Digital Logic Design Combinational Circuits Part 1
1 CK Cheng CSE Dept. UC San Diego CS 140, Lecture 2 Combinational Logic.
1 Homework Reading –Tokheim, Section 5-10, 7-4 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.
1 CK Cheng CSE Dept. UC San Diego CS 140, Lecture 2 Combinational Logic.
Digital Fundamentals Floyd Chapter 4 Tenth Edition
CK Cheng Tuesday 10/2/02 CS 140 Lecture 2. Part I. Combinational Logic I) Specification –a. Language –b. Truth Table –c. Boolean Algebra –d. Incompletely.
Contemporary Logic Design Two-Level Logic © R.H. Katz Transparency No. 3-1 Chapter #2: Two-Level Combinational Logic Section 2.1, Logic Functions.
Digital Logic Review: Part II
Digital Fundamentals with PLD Programming Floyd Chapter 4
Boolean Algebra and Logic Simplification
Logic Function Optimization. Combinational Logic Circuit Regular SOP and POS designs Do not care expressions Digital logic circuit applications Karnaugh.
1 COMBINATIONAL LOGIC One or more digital signal inputs One or more digital signal outputs Outputs are only functions of current input values (ideal) plus.
Lecture 2 – Boolean Algebra Lecturer: Amy Ching Date: 21 st Oct 2002.
Dr. Ahmed El-Bialy, Dr. Sahar Fawzy Combinational Circuits Dr. Ahmed El-Bialy Dr. Sahar Fawzy.
Logic Design A Review. Binary numbers Binary numbers to decimal  Binary 2 decimal  Decimal 2 binary.
Lecture 23 Final Revision 3. Prof. Sin-Min Lee.
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.
Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.
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.
07 KM Page 1 ECEn/CS 224 Karnaugh Maps. 07 KM Page 2 ECEn/CS 224 What are Karnaugh Maps? A simpler way to handle most (but not all) jobs of manipulating.
Boolean Algebra & Logic Circuits Dr. Ahmed El-Bialy Dr. Sahar Fawzy.
"Digital Systems"1 7-segment Numeric display b a d g e c f.
1 CS 151: Digital Design Chapter 3: Combinational Logic Design 3-1Design Procedure CS 151: Digital Design.
CS151 Introduction to Digital Design Chapter 3: Combinational Logic Design 3-1 Design Procedure 1Created by: Ms.Amany AlSaleh.
Karnaugh Maps (K-Maps)
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
THE K-MAP.
C.S.Choy39 TERMINOLOGY Minterm –product term containing all input variables of a function in either true or complementary form Maxterm – sum term containing.
 Seattle Pacific University EE Logic System DesignKMaps-1 Two-Level Simplification All Boolean expressions can be represented in two- level forms.
Karnaugh Maps (K maps).
ECE 301 – Digital Electronics Minimizing Boolean Expressions using K-maps, The Minimal Cover, and Incompletely Specified Boolean Functions (Lecture #6)
School of Computer and Communication Engineering, UniMAP DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan.
In some Boolean functions there are some input terms that will never occur, for example in BCD code there are sex invalid combinations 1010,1011,1100,
ACOE161Digital Circuit Design1 Design Of Combinational Logic Circuits.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Introduction to Digital Electronics Lecture.
CE1110: Digital Logic Design Gate Level Minimization Karnaugh Maps (K-Maps)
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Lecture 3: Incompletely Specified Functions and K Maps
Department of Preparatory Year, Umm Al Qura University
DeMorgan’s Theorem DeMorgan’s 2nd Theorem
CHAPTER 1 : INTRODUCTION
Digital Logic.
Basic Digital Logic Systems
ECE Digital logic Lecture 10: Karnaugh MAps
CSE 140 : Components and Design Techniques for Digital Systems
Karnaugh Maps (K-Maps)
Week 3 Logic will get you from A to B. Imagination will take you everywhere. Albert Einstein.
Karnaugh Maps References:
Karnaugh Maps References: Lecture 4 from last semester
Boolean Algebra.
Lecture 3: Incompletely Specified Functions and K Maps
Lecture 4 Sums of Product Circuits Simplification
Digital Circuits.
BASIC & COMBINATIONAL LOGIC CIRCUIT
ECE 331 – Digital System Design
Homework Reading Tokheim, Section 5-10, 7-4.
Boolean Algebra.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION Part (a)
Lecture 6 Karnaugh maps (K-maps) K-maps with “don’t cares”
ECB2212-Digital Electronics K-Map
Digital Fundamentals Floyd Chapter 4 Tenth Edition
3-Variable K-map AB/C AB/C A’B’ A’B AB AB’
Laws & Rules of Boolean Algebra
Chapter 2 Digital Design and Computer Architecture, 2nd Edition
Digital Circuits.
Lecture 3: Incompletely Specified Functions and K Maps
ECE 331 – Digital System Design
Digital Circuits.
Presentation transcript:

Week 3 Logic will get you from A to B. Imagination will take you everywhere. Albert Einstein

Represents Binary outcomes Digital Logic Represents Binary outcomes statement TRUE FALSE answer YES NO light OFF On switch CLOSED OPEN one bit 1 0

Basic Rules of Boolean Algebra 1. A + 0 = A 2. A + 1 = 1 3. A • 0 = 0 4. A • 1 = A 5. A + A = A 6. A + A’ = 1 7. A • A = A 8. A • A’ = 0 A’’ = A A + AB = A 11. A + A’B = A + B 12. A(B+C) = AB + AC 13. (A+B)(C+D) = AC+AD+BC+BD 14. (A + B)(A + C) = A + BC Note: A,B,C can represent a single variable or a combination of variables. Thus, rule 13 can be easily derived from rule 12.

DeMorgan’s Rules (A + B)’ = A’B’ (AB)’ = A’ + B’ By taking the inverse of each side they can be re-written as: A + B = (A’B’)’ AB = (A’+B’)’

Gray Code unsigned decimal gray 000 0 000 001 1 001 010 2 011 000 0 000 001 1 001 010 2 011 011 3 010 100 4 110 101 5 111 110 6 101 111 7 100

Karnaugh Maps 2 & 3 Variables

Karnaugh Maps 4 Variables

Karnaugh Map Example A’B’C’ + AB’C’ + A’BC’ + ABC’

Karnaugh Map Grouping

Karnaugh Map Grouping

Karnaugh Map Example Cont. A’B’C’ + AB’C’ + A’BC’ + ABC’ B is not covered, and both B and B’ are included, So we ignore B C’ is common to the entire grouping, So it is included A is covered over the full Range so we ignore A Final Result : X = C’

Canonical Form Canonical means all variables are represented in each term. X = a’b + ac is a minimum representation Change to Canonical Form = a’b(c+c’) + a(b+b’)c = a’bc + a’bc’ + abc + ab’c This implies that some variables are redundant

Don’t Care abcd 0 0000 1 1 0001 0 2 0010 1 3 0011 1 4 0100 0 5 0101 1 6 0110 1 7 0111 1 8 1000 1 9 1001 1 10 1010 x 15 1111 x BCD to 7 segment display Logic Each segment is controlled by it’s own logic To reduce the boolean equation in a Karnaugh Map we plot the don’t care states. If appropriate we can use these to form larger groupings, thus simplifying the logic. One equation for each segment. Segment 1

End