Boolean Functions 1111 0 0 0 0 1 1 1 0 0 1 1 0 0 1 0 1 0 1 0 1 0 0 0 0 0 0 1 1 1 x 2 x 3 x f mapping truth table.

Slides:



Advertisements
Similar presentations
Techniques for Combinational Logic Optimization
Advertisements

Logic Gates.
Computer Science 210 Computer Organization Introduction to Logic Circuits.
INTRODUCTION LOGICAL OPERATIONS TRUTH TABLE AND RULES.
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.
CDA 3100 Recitation Week 10.
1 Combinational Logic Design&Analysis. 2 Introduction We have learned all the prerequisite material: – Truth tables and Boolean expressions describe functions.
Cyclic Combinational Circuits and Other Novel Constructs Marrella splendensCyclic circuit (500 million year old Trilobite)(novel construct)
ITEC 352 Lecture 4 Boolean logic / Karnaugh Maps.
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.
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.
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
Logic Functions and their Representation. Slide 2 Combinational Networks x1x1 x2x2 xnxn f.
Gates CS105. Electrical Signals Transmission of data Any electrical signal has a level of voltage – Interpretation of 1s and 0s Generally speaking: –
Propositional Calculus Math Foundations of Computer Science.
ENGG 1203 Tutorial Combinational Logic (I) 1 Feb Learning Objectives
Logic Function Optimization. Combinational Logic Circuit Regular SOP and POS designs Do not care expressions Digital logic circuit applications Karnaugh.
Systems Architecture I1 Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus so that they.
1 Introduction to Abstract Mathematics Applications : Digital Logic Circuits 2.4 and Number Systems 2.5 Instructor: Hayk Melikya
XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.
Chapter 4 The Building Blocks: Binary Numbers, Boolean Logic, and Gates.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Apr. 3, 2000Systems Architecture I1 Systems Architecture I (CS ) Lecture 3: Review of Digital Circuits and Logic Design Jeremy R. Johnson Mon. Apr.
 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.
Quiz What are the results of the following 4-bit bitwise logical operations? NOT OR NOR AND
Chapter 2Basic Digital Logic1 Chapter 2. Basic Digital Logic2 Outlines  Basic Digital Logic Gates  Two types of digital logic circuits Combinational.
Logic Circuits Chapter 2. Overview  Many important functions computed with straight-line programs No loops nor branches Conveniently described with circuits.
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7.1 – 7.2 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Boolean.
Discrete Mathematics and Its Applications.  The English mathematician George Boole ( ) sought to give symbolic form to Aristotle's system of.
Course contents Chapter 1 - section 1.6 Chapter 2 - all sections Chapter – 4.7, and 4.12 Chapter , Chapter 6 - all sections.
Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.
Islamic University Of Gaza, Nael Aburas Data Storage Introduction to computer, 2nd semester, 2010/2011 Mr.Nael Aburas
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Circuit Design.
ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.
Logic Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
Linear Algebra. Circuits The circuits in computers and other input devices have inputs, each of which is either a 0 or 1, the output is also 0s and 1s.
Logic Gates. The Inverter The inverter (NOT circuit) performs the operation called inversion or complementation. Standard logic symbols: 1 1 input output.
1 P P := the class of decision problems (languages) decided by a Turing machine so that for some polynomial p and all x, the machine terminates after at.
Logic Gates M. AL-Towaileb1. Introduction Boolean algebra is used to model the circuitry of electronic devices. Each input and each output of such a device.
1 CS 151: Digital Design Chapter 3: Combinational Logic Design 3-1Design Procedure CS 151: Digital Design.
Logic Gates and Boolean Algebra Introduction to Logic II.
4–1. BSCS 5 th Semester Introduction Logic diagram: a graphical representation of a circuit –Each type of gate is represented by a specific graphical.
C OMBINATIONAL L OGIC D ESIGN 1 Eng.Maha AlGubali.
Circuit Synthesis A logic function can be represented in several different forms:  Truth table representation  Boolean equation  Circuit schematic 
Lecture 1 Gunjeet kaur Dronacharya group of institutions.
Logic Gates and Boolean Algebra
Transistors and Logic Circuits
Chapter 2.3 Binary Logic.
CHAPTER 3 SETS AND BOOLEAN ALGEBRA
Computer Architecture CST 250
Jeremy R. Johnson Wed. Sept. 29, 1999
ECE 331 – Digital System Design
Karnaugh Maps (K-Maps)
Computer Science 210 Computer Organization
Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan
CSE 311 Foundations of Computing I
Logic Gates L Al-zaid Math110.
Schematics 201 Lecture Topic: Electrical Symbols
3.4 Computer systems Boolean logic Lesson 2.
13 Digital Logic Circuits.
ECB2212-Digital Electronics K-Map
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
GCSE Computer Science – Logic Gates & Boolean Expressions
Today You are Learning simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT.
Logic Gates Dr.Halimah Alshehri.
Digital Logic Design Basics Combinational Circuits Sequential Circuits.
Boolean Algebra and Gate Networks
Eng. Ahmed M Bader El-Din October, 2018
Agenda Lecture Content: Combinatorial Circuits Boolean Algebras
Presentation transcript:

Boolean Functions x 2 x 3 x f mapping truth table

Representation of Boolean Functions Disjunctive Normal Form (canonical): Example: OR of AND terms (not unique): ),,(xxxxxxxxxxxxf  ),,(xxxxxxxf  1 x 2 x 3 x f

Representation of Boolean Functions Conjunctive Normal Form (canonical): Example: AND of OR terms (not unique): )( )()( )()(),,( xxx xxxxxx xxxxxxxxxf    )()(),,( xxxxxxf  x 2 x 3 x f

Representation of Boolean Functions Example: XOR of AND terms: unique? x 2 x 3 x f )1 as represent literals; positive(only  xx ),,(xxxxxxxxxxf 

representation is unique. Dependence on variables is explicit. XOR of AND terms: Representation of Boolean Functions For m variables, express a boolean function as the sum of some combination of the product terms: m ||,,,|,,|1xxxxxxxxxxxx nnn   sums,distinct2 m 2

Logic Circuits Logic GateBuilding Block:

Logic Circuits Logic GateBuilding Block: feed-forward device

Logic Circuits “AND” gate Common Gate:

Logic Circuits “OR” gate Common Gate:

Logic Circuits “XOR” gate Common Gate:

Logic Circuits “NOT” gate 1 0 Common Gate: 0 1

inputsoutputs Logic Circuits network of logic gates

Logic Circuits inputsoutputs network of logic gates gate

Example Logic Circuits x y x y z z c s

Example

Logic Circuits Size: number of gates. Depth: longest path from an input to an output. Measures x y x y z z c s size = 5, depth = 3

Logic Circuits Why study logic circuits? It all seems simple enough Construct XOR from AND/OR/NOT gates xx x 3 variables (draw circuit)

Logic Circuits Construct XOR from AND/OR/NOT gates. 4 variables (draw circuit) xx x x...

Example: Logic Gates Models of Computation

Example: Linear Threshold Gates

Models of Computation Example: Comparators and Balancers x y min(x, y) max(x, y) x y

Models of Computation Example: Switching Circuits a b c ed SD dcbacedeabf 

Switching Circuits (Shannon, 1938)

Example: Encoding FSMs Systems with states analyzed. Finite State Machine input current state next state A B D F

Logic Circuits Construct XOR from AND/OR/NOT gates. construction: lower bound: XOR of n variables gates For n > 4, optimal size is unknown. ≤ optimal size ≤

Linear Threshold Gates 1 x 2 x n x 1 w 2 w n w 0 w...

Linear Threshold Gates Useful Model?