Department of Computer Engineering. 2 Engr Ahmad Bilal M IN AND MAX Term Khabi Gharoor Nahi Kiya.

Slides:



Advertisements
Similar presentations
Boolean Algebra and Logic Gates
Advertisements

Figure 4.1. The function f (x1, x2, x3) =  m(0, 2, 4, 5, 6).
CS2100 Computer Organisation
Introduction to Computer Engineering by Richard E. Haskell Basic Digital Design Module M1.2 Section 3.2.
1 Combinational Logic Design&Analysis. 2 Introduction We have learned all the prerequisite material: – Truth tables and Boolean expressions describe functions.
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 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
1 Homework Reading –Tokheim, Section 5-1, 5-2, 5-3, 5-7, 5-8 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.
CS 151 Digital Systems Design Lecture 6 More Boolean Algebra A B.
COMBINATIONAL LOGIC CIRCUITS C.L. x1 x2 xn Z Z = F (x1, x2, ……., Xn) F is a Binary Logic (BOOLEAN ) Function Knowing F Allows Straight Forward Direct Implementation.
Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2 Dr. Costas Kyriacou and Dr. Konstantinos.
Boolean Algebra and Logic Gates1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Canonical Forms and Logic Miniminization
ENGG 1203 Tutorial Combinational Logic (I) 1 Feb Learning Objectives

AOI Logic Implementation
Lecture 3: Incompletely Specified Functions and K Maps CSE 140: Components and Design Techniques for Digital Systems Fall 2014 CK Cheng Dept. of Computer.
Decoders and Multiplexers Prof. Sin-Min Lee Department of Computer Science San Jose State University.
Lecture 4 Logic gates and truth tables Implementing logic functions
Logic Function Optimization. Combinational Logic Circuit Regular SOP and POS designs Do not care expressions Digital logic circuit applications Karnaugh.
طراحی مدارهای منطقی نیمسال دوم دانشگاه آزاد اسلامی واحد پرند.
1 Digital Logic Design Week 5 Simplifying logic expressions.
EEL-3705 TPS QUIZZES. Quiz 2-1 Use a Venn Diagram to show.
AOI Logic Implementation
ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.
CE1110 :Digital Logic Design lecture 02 Digital Logic Gates Dr. Atef Ali Ibrahim 1.
Venn Diagram – the visual aid in verifying theorems and properties 1 E.
ENGIN112 L6: More Boolean Algebra September 15, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 6 More Boolean Algebra A B.
ece Parity Used to check for errors Can be either ODD or EVEN Left most bit used as the indicator For EVEN, insert a 0 or a 1 so as to make the.
1 Digital Logic Design Week 5&6 cont’d Revision for Quiz 2/Exam.
ECE 3110: Introduction to Digital Systems Chapter #4 Review.
ECE2030 Introduction to Computer Engineering Lecture 6: Canonical (Standard) Forms Prof. Hsien-Hsin Sean Lee School of Electrical and Computer Engineering.
1 Homework Reading –Tokheim, Section 5-1, 5-2, 5-3, 5-7, 5-8 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.
CSE 140: Components and Design Techniques for Digital Systems Lecture 3: Incompletely Specified Functions and K Maps CK Cheng Dept. of Computer Science.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 4 Dr. Shi Dept. of Electrical and Computer Engineering.
CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.
ECE DIGITAL LOGIC LECTURE 8: BOOLEAN FUNCTIONS Assistant Prof. Fareena Saqib Florida Institute of Technology Spring 2016, 02/11/2016.
Standard & Canonical Forms COE 202 Digital Logic Design Dr. Aiman El-Maleh College of Computer Sciences and Engineering King Fahd University of Petroleum.
Figure 5–5 Exclusive-OR logic diagram and symbols. Open file F05-05 to verify the operation. Thomas L. Floyd Digital Fundamentals, 9e Copyright ©2006 by.
School of Computer and Communication Engineering, UniMAP DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan.
CEC 220 Digital Circuit Design SOP and POS forms Friday, Sept 11 CEC 220 Digital Circuit Design Slide 1 of 17.
Combinational Logic Analysis. Basic Combinational Logic Circuits AND-OR logic AND-OR logic AND-OR logic produces an SOP expression. AND-OR logic produces.
Circuit Synthesis A logic function can be represented in several different forms:  Truth table representation  Boolean equation  Circuit schematic 
Digital Logic & Design Dr. Waseem Ikram Lecture 09.
Lecture 1 Gunjeet kaur Dronacharya group of institutions.
Homework Reading Machine Projects Labs
Lecture 3: Incompletely Specified Functions and K Maps
Lecture 4 Logistics Last lecture --- Boolean algebra Today’s lecture
Eng. Mai Z. Alyazji October, 2016
Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and
Combinational Logic Circuits
ECE 2110: Introduction to Digital Systems
ECE/CS 352 Digital Systems Fundamentals
Princess Sumaya University
CHAPTER 3 SETS AND BOOLEAN ALGEBRA
Combinational Circuits
ECE 331 – Digital System Design
Karnaugh Maps (K-Maps)
Lecture 3: Incompletely Specified Functions and K Maps
SYEN 3330 Digital Systems Chapter 2 – Part 4 SYEN 3330 Digital Systems.
Week 7: Gates and Circuits: PART II
Instructor: Alexander Stoytchev
Digital Logic.
CSC 220: Computer Organization Logic Gates and Functions
13 Digital Logic Circuits.
Digital Logic.
Karnaugh Maps (K maps).
Lecture 3: Incompletely Specified Functions and K Maps
Presentation transcript:

Department of Computer Engineering

2 Engr Ahmad Bilal M IN AND MAX Term Khabi Gharoor Nahi Kiya

Department of Computer Engineering

SOP and POS Q1 :Why Standard SOP and POS forms? Q2 How can Be Implemented? Can be implemented using AND and OR Functions

Department of Computer Engineering

AB+ABC ABX+DFE’+GHJ (A+B)(F+G) (X+A+F+T)(A+A) Example

Department of Computer Engineering PROBLEM Issues With Boolean Algebra Become Tough Need Expertise

Department of Computer Engineering GETTING READY FOR K MAP Glossary Minterms: Product terms in Standard SOP form Maxterms: Sum terms in Standard POS form

Department of Computer Engineering ABCMin- terms Max- terms Minterms and Maxterm

Department of Computer Engineering SO What The Use. How it helps to design us a particular Circuit

Department of Computer Engineering Designing Lets say we want to design a Circuit who gives out put 1, on our desired inputs only using SOPs

Department of Computer Engineering Designing Remember its SOP Define Inputs for which You want output as 1 For this example lets say the inputs are 0,2,3,5,7

Department of Computer Engineering Implementing CCT SOPs Canonical Sum

Department of Computer Engineering A’.B’.C’+A’BC’+A’BC+AB’C+ABC NOW LOOKING AT THE ABOVE EQUATION DRAW A TRUTH TABLE

Department of Computer Engineering SOP-Equation and Truth Table Expression InputOutput ABCF

Department of Computer Engineering POS can be Implemented in same way. Lets say we want to design a circuits using POS which gives 0 on only selected inputs For Our Practice Let the inputs be What about POS

Department of Computer Engineering Canonical Product

Department of Computer Engineering Conversions =

Department of Computer Engineering aaDDDDDDDDDDDDEW2` PRACTICE QUESTION Develop a Booliean equation, Circuit diagram and Its truth table which gives 0 only on following inputs 1,2,3,5

Department of Computer Engineering POS-Truth Table Conversion InputOutput ABCF

Department of Computer Engineering SHOCK QUIZ

Department of Computer Engineering Design a Lock The Code of this lock is last 3 digits of your Roll Number The Lock will only operate when its get output from the key pads in form of 101 Proof with four samples of truth table, that your circuit works only for right code 1 1 Bonus Question The Three input from key pads are given to XOR gate. The lock will only open when xor gives out put of 1 to gate 0