ELEC Digital Logic Circuits Fall 2014 Switching Algebra (Chapter 2)
|
|
- Holly Harvey
- 6 years ago
- Views:
Transcription
1 ELEC Digital Logic Circuits Fall 2014 Switching Algebra (Chapter 2) Vishwani D. Agrawal James J. Danaher Professor Department of Electrical and Computer Engineering Auburn University, Auburn, AL Fall 2014, Sep ELEC Lecture 4 1
2 Switching Algebra A Boolean algebra, where Set K contains just two elements, {0, 1}, also called {false, true}, or {off, on}, etc. Two operations are defined as, + OR, AND Fall 2014, Sep ELEC Lecture 4 2
3 Claude E. Shannon ( ) Fall 2014, Sep ELEC Lecture 4 3
4 Shannon s Legacy A Symbolic Analysis of Relay and Switching Circuits, Master s Thesis, MIT, Perhaps the most influential master s thesis of the 20 th century. An Algebra for Theoretical Genetics, PhD Thesis, MIT, Founded the field of Information Theory. C. E. Shannon and W. Weaver, The Mathematical Theory of Communication, University of Illinois Press, A must read. Fall 2014, Sep ELEC Lecture 4 4
5 Switching Devices Electromechanical relays (1940s) Vacuum tubes (1950s) Bipolar transistors ( ) Field effect transistors ( ) Integrated circuits ( ) Nanotechnology devices (future) Fall 2014, Sep ELEC Lecture 4 5
6 Example: Automobile Ignition Engine turns on when Ignition key is applied AND AND Car is in parking gear OR Brake pedal is on Seat belt is fastened OR Car is in parking gear Fall 2014, Sep ELEC Lecture 4 6
7 Switching logic Parking gear Seat belt Key Brake pedal Parking gear Battery Motor Fall 2014, Sep ELEC Lecture 4 7
8 Define Boolean Variables Parking gear Seat belt Key P = {0, 1} S = {0, 1} Battery K = {0, 1} Brake pedal Parking gear B = {0,1} P = {0, 1} 0 means switch off or open 1 means switch on or closed Motor M = {0, 1} Fall 2014, Sep ELEC Lecture 4 8
9 Write Boolean Function Parking gear Seat belt Key P = {0, 1} S = {0, 1} Battery K = {0, 1} Brake pedal Parking gear B = {0,1} P = {0, 1} Motor M = {0, 1} Ignition function: M = K AND (P OR B) AND (S OR P) = K(P + B)(S + P) Fall 2014, Sep ELEC Lecture 4 9
10 Simplify Boolean Function M = K AND (P OR B) AND (S OR P) = K(P + B)(S + P) = K(P + B)(P + S) Commutativity = K (P + B S) Distributivity Fall 2014, Sep ELEC Lecture 4 10
11 Construct an Optimum Circuit M = K (P + B S) Parking gear Key P = {0, 1} Battery K = {0, 1} Brake pedal Seat belt B = {0,1} S = {0, 1} This is a relay circuit. Earlier logic circuits, even computers, were built with relays. Motor M = {0,1} Fall 2014, Sep ELEC Lecture 4 11
12 Implementing with Relays An electromechanical relay contains: Electromagnet Current source A switch, spring-loaded, normally open or closed Switch has two states, open (0) or closed (1). The state of switch is controlled by not applying or applying current to electromagnet. Fall 2014, Sep ELEC Lecture 4 12
13 One Switch Controlling Other Switches X and Y are normally open. Y cannot close unless a current is applied to X. X Y Y = X Fall 2014, Sep ELEC Lecture 4 13
14 Inverting Switch Switch X is normally closed and Y is normally open. Y cannot open unless a current is applied to X. X Y Y = X Fall 2014, Sep ELEC Lecture 4 14
15 Boolean Operations AND Series connected relays. OR Parallel relays. A A B F B F F = A B F = A + B Fall 2014, Sep ELEC Lecture 4 15
16 Complement (Inversion) A A F B F F = A F = A + B = A B Fall 2014, Sep ELEC Lecture 4 16
17 Relay Computers Conrad Zuse ( ) Z1 (1938) Z3 (1941) Fall 2014, Sep ELEC Lecture 4 17
18 Electronic Switching Devices Electron Tube Fleming, 1904 de Forest, 1906 Point Contact Transistor Bardeen, Brattain, Shockley, 1948 Fall 2014, Sep ELEC Lecture 4 18
19 Transistor, 1948 The thinker, the tinkerer, the visionary and the transistor John Bardeen, Walter Brattain, William Shockley Nobel Prize, 1956 Fall 2014, Sep ELEC Lecture 4 19
20 Bell Laboratories, Murray Hill, New Jersey Fall 2014, Sep ELEC Lecture 4 20
21 Fall 2014, Sep ELEC Lecture 4 21
22 Bipolar Junction Transistor (BJT) Fall 2014, Sep ELEC Lecture 4 22
23 Field Effect Transistor (FET) a.k.a. metal oxide semiconductor (MOS) FET. (metal oxide) Fall 2014, Sep ELEC Lecture 4 23
24 Integrated Circuit (1958) Jack Kilby ( ), Nobel Prize, 2000 Fall 2014, Sep ELEC Lecture 4 24
25 MOSFET (Metal Oxide Semiconductor Field Effect Transistor) Drain Drain Gate VGS Short or Open Gate VGS Short or Open Source Source NMOSFET VGS = 0, open VGS = high, short PMOSFET VGS = 0, short VGS = high, open Reference: R. C. Jaeger and T. N. Blalock, Microelectronic Circuit Design, Third Edition, McGraw Hill. Fall 2014, Sep ELEC Lecture 4 25
26 NMOSFET NOT Gate (Early Design) A: Boolean variable A = VDD volts; 1, true, on A = 0 volt; 0, false, off A Power supply VDD volts w.r.t. ground Ground = 0 volt A Problem: When A = 1, current leakage causes power dissipation. Solution: Complementary MOS design proposed by F. M. Wanlass and C.-T. Sah, Nanowatt Logic Using Field- Effect Metal-Oxide Semiconductor Triodes, International Solid State Circuits Conference Digest of Technical Papers, Feb 20, 1963, pp Fall 2014, Sep ELEC Lecture 4 26
27 CMOS Circuit Wanlass, F. M. "Low Stand-By Power Complementary Field Effect Circuitry. U. S. Patent 3,356,858 (Filed June 18, Issued December 5, 1967). Fall 2014, Sep ELEC Lecture 4 27
28 CMOS NOT Gate (Modern Design) Power supply VDD = 1 volt; voltage depends on technology. A = VDD = 1 volt is state 1 A = GND = 0 volt is state 0 Truth Table A A A A A A 0 1 Electrical Circuit GND Ground 1 0 Boolean Function Symbol Fall 2014, Sep ELEC Lecture 4 28
29 CMOS Logic Gate: NAND Electrical Circuit VDD Boolean Function Truth Table A B F A Symbol A F B F B GND Fall 2014, Sep ELEC Lecture 4 29
30 CMOS Logic Gate: NOR Electrical Circuit A VDD Boolean Function Truth Table A B F A Symbol F B F B GND Fall 2014, Sep ELEC Lecture 4 30
31 CMOS Logic Gate: AND Boolean Function Symbol Truth Table A B F F A B F A B F Fall 2014, Sep ELEC Lecture 4 31
32 CMOS Logic Gate: OR Boolean Function Symbol Truth Table A B F F A B F A B F Fall 2014, Sep ELEC Lecture 4 32
33 CMOS Gates Logic function Number of transistors 1 or 2 inputs N inputs NOT 2 - AND 6 2N + 2 OR 6 2N + 2 NAND 4 2N NOR 4 2N Fall 2014, Sep ELEC Lecture 4 33
34 Optimized Ignition Logic M = K (P + B S) = KP + KBS K KP P M B S KBS 3 gates, 20 transistors. Can we reduce transistors? Fall 2014, Sep ELEC Lecture 4 34
35 Further Optimization M = K (P + B S) = KP + KBS (Distr. law) = KP + KBS (Theorem 3, involution) NAND gates 4+6 transistors K P B S = KP KBS (De Morgan s theorem) KP M KBS 3 gates, 14 transistors. Fall 2014, Sep ELEC Lecture 4 35
36 Digital Systems DIGITAL CIRCUITS Fall 2014, Sep ELEC Lecture 4 36
37 Digital Logic Design Representation of switching function: Truth table Canonical forms Karnaugh map Logic minimization: Minimize number of literals. Technology mapping: Implement logic function using predesigned gates or building blocks from a technology library. Fall 2014, Sep ELEC Lecture 4 37
38 Truth Table Truth table is an exhaustive description of a switching function. Contains 2 n input combinations for n variables. Example: f(a,b,c) = A B + A C + A C n Input variables, n = 3 Output A B C f(a,b,c) n = 8 rows Fall 2014, Sep ELEC Lecture 4 38
39 How Many Switching Functions? Output column of truth table has length 2 n for n input variables. It can be arranged in variables. ways for n Example: n = 1, single variable. Input n 2 2 Output functions A F1(A) F2(A) F3(A) F4(A) Fall 2014, Sep ELEC Lecture 4 39
40 Definitions Boolean variable: A variable denoted by a symbol; can assume a value 0 or 1. Literal: Symbol for a variable or its complement. Product or product term: A set of literals, ANDed together. Example, a b c. Cube: Same as a product term. Sum: A set of literals, Ored together. Example, a + b + c. Fall 2014, Sep ELEC Lecture 4 40
41 More Definitions SOP (sum of products): A Boolean function expressed as a sum of products. Example: f(a,b,c) = A B + A C + A C POS (product of sums): A Boolean function expressed as a product of sums. Example: f(a,b,c) = ( A + B + C) ( A + B + C) ( A + B + C) Fall 2014, Sep ELEC Lecture 4 41
42 Minterm A product term in which each variable is present either in true or in complement form. For n variables, there are 2 n unique minterms. Minterm m 0 m 1 m 2 m 3 m 4 m 5 m 6 m 7 Product A B C A B C A B C A B C A B C A B C A B C A B C Fall 2014, Sep ELEC Lecture 4 42
43 Minterms are Canonical Functions Value of minterm 1 0 m 0 m 1 m 2 m 3 m 4 m 5 m 6 m Input Fall 2014, Sep ELEC Lecture 4 43
44 Canonical SOP Form a.k.a. Disjunctive Normal Form (DNF) A Boolean function expressed as a sum of minterms. Example: f(a,b,c) = A B + A C + A C = A BC + ABC + A B C + AB C + ABC = m 1 +m 3 +m 4 +m 6 +m 7 = m(1, 3, 4, 6, 7) Truth table with row numbers Row No. A B C f(a,b,c) Fall 2014, Sep ELEC Lecture 4 44
45 Maxterm A summation term in which each variable is present either in true or in complement form. For n variables, there are 2 n unique maxterms. Maxterm M 0 M 1 M 2 M 3 M 4 M 5 M 6 M 7 Sum A + B + C A + B + C A + B + C A + B + C A + B + C A + B + C A + B + C A + B + C Fall 2014, Sep ELEC Lecture 4 45
46 Canonical POS Form a.k.a. Conjunctive Normal Form (CNF) A Boolean function expressed as a product of maxterms. Example: f(a,b,c) = A B + A C + A C = (A + B + C)(A + B + C)( A + B + C) = M 0 M 2 M 5 = Π M(0, 2, 5) Truth table with row numbers Row No. A B C f(a,b,c) Fall 2014, Sep ELEC Lecture 4 46
47 Canonical Forms are Unique A canonical form completely defines a Boolean function. That is, for every input the canonical form specifies the value of the function. To determine canonical form: Construct truth table and sum minterms corresponding to 1 outputs, or multiply maxterms corresponding to 0 outputs. Alternatively, use Shannon s expansion theorem (see Section 2.2.3, page 101). Two Boolean functions are identical if and only if their canonical forms are identical. Fall 2014, Sep ELEC Lecture 4 47
48 Why Generate Canonical Form? Example: Are the following Boolean Functions Identical? F1= A B D + F2 F3 = = A C D A B D A B C D + B D A C D + A B D + B C D Generate canonical forms, e.g., minterms, and compare. + Fall 2014, Sep ELEC Lecture 4 48
49 Algebraic Procedure Expand each term to contain all variables Remember Postulate 6: Complement a + a = 1 a a = 0 Postulate 2: Identity elements a + 0 = a, 0 is identity element for + a 1 = a, 1 is identity element for dot ( ) Fall 2014, Sep ELEC Lecture 4 49
50 F1= ABD + ABD + ACD = ABD(C + C) + ABD(C + C) + ACD(B + B) = ABCD + ABCD + ABCD + ABCD + ABCD + ABCD = m 7 + m 5 + m 15 + m 13 + m 11 = m(5, 7,11,13,15) Similarly, F2 F3 = = m(5, 7,11,13,15) m(5, 7,11,13,15) Hence, three functions are identical. Fall 2014, Sep ELEC Lecture 4 50
51 Karnaugh Map 1952: Edward M. Veitch invented a graphical procedure for digital circuit optimization. 1953: Maurice Karnaugh perfected the map procedure: The Map Method for Synthesis of Combinational Logic Circuits, Trans. AIEE, pt I, 72(9): , November Fall 2014, Sep ELEC Lecture 4 51
52 Karnaugh Map: 2 Variables, A, B A = 0 A = 1 Unit Hamming distance between adjacent cells B = 0 B = 1 m 0 m m 2 m Each cell is a minterm m 3 = AB = 11 (numerical interpretation) Fall 2014, Sep ELEC Lecture 4 52
53 Representing a Function B = 0 B = 1 A = 0 A = m 0 m m 1 m Place 1 in cells corresponding to minterms in canonical form. For example, see F = A B + A B represented on the left. Truth Table A B F Fall 2014, Sep ELEC Lecture 4 53
54 Grouping Adjacent Minterms A = 0 A = 1 B = Adjacent cells differ in one variable, which is eliminated. B = 1 m 0 1 m For example, F = A B + A B = A(B + B) = A m 1 m 3 Product term A Fall 2014, Sep ELEC Lecture 4 54
55 Karnaugh Map Minimization Canonical SOP form represented on map Example: F = A B + A B + A B Find minimal cover (fewest groups of largest sizes), F = A + B A = 0 A = 1 product A B = 0 1 A F m 0 m 2 B B = product B m 1 m 3 Fall 2014, Sep ELEC Lecture 4 55
56 Karnaugh Map: 3 Variables, A, B, C A C B Check unit Hamming distance between adjacent cells. Fall 2014, Sep ELEC Lecture 4 56
57 Synthesizing a Digital Function Start with specification. Create a truth table from specification. Minimize (SOP with fewest literals): Either write canonical SOP Reduce using postulates and theorems Or find largest cubes from Karnaugh map Minimized SOP gives a two-level AND-OR circuit. NAND or NOR circuit for CMOS technology can be found using de Morgan s theorem. Fall 2014, Sep ELEC Lecture 4 57
58 Example: Multiplexer Inputs: A, B, C Output: F Function: F = A, when C = 1 F = B, when C = 0 Fall 2014, Sep ELEC Lecture 4 58
59 3-Input Function: Multiplexer B C A Truth Table row A B C F C B A C F = A C + B C A C F B Fall 2014, Sep ELEC Lecture 4 59
60 Technology Optimization A C B F = A C + B C F = 20 transistors A C F B Fall 2014, Sep ELEC Lecture 4 60
61 Optimized Multiplexer A C B X Y F F = X + Y = X Y from de Morgan' s theorem A X C B F Y = 14 transistors Fall 2014, Sep ELEC Lecture 4 61
62 Karnaugh Map: 4 Variables, A, B, C, D A D C B Check unit Hamming distance between adjacent cells. Fall 2014, Sep ELEC Lecture 4 62
63 Adjacency of Edge Cells Fall 2014, Sep ELEC Lecture 4 63
64 Reexamine Three Functions from Slide 48 Example: Are the following Boolean Functions Identical? F1= A B D + A B D + A C D F2 = A C D + A B D + B C D F3 = A B C D + B D This time generate Karnaugh maps, and compare. Fall 2014, Sep ELEC Lecture 4 64
65 F1 = A Karnaugh Map of F1 B D + A B D + A C D A C D F1 = Σm(5,. 7, 11, 13, 15) B Fall 2014, Sep ELEC Lecture 4 65
66 Karnaugh Map of F2 F2 = A C D + A B D + B C D A C D. F2 = Σm(5, 7, 11, 13, 15) F1 and F2 cover same area on map. Fall 2014, Sep ELEC Lecture 4 66 B
67 F3 = A B C D + Karnaugh Map of F3 B D A C D F3 = Σm(5, 7, 11, 13, 15) F1, F2 and F3 cover exactly the. same area on map, hence, they are identical. Fall 2014, Sep ELEC Lecture 4 67 B
68 Ignition Function Minterm K P B S M M = K AND (P OR B) AND (S OR P) = K(P + B)(S + P) Fall 2014, Sep ELEC Lecture 4 68
69 Karnaugh Map: M(K, P, B, S) K B S. P Fall 2014, Sep ELEC Lecture 4 69
70 Karnaugh Map: Minimum Cover K KP B S KBS. P Fall 2014, Sep ELEC Lecture 4 70
71 Minimized Function M = KP + KBS K P M B S Fall 2014, Sep ELEC Lecture 4 71
72 Using Inverting Gates Because They Need Fewer Transistors M = KP + KBS = KP KBS Using de Morgan s Theorem K P M B S Fall 2014, Sep ELEC Lecture 4 72
73 Karnaugh Map on the Web Fall 2014, Sep ELEC Lecture 4 73
74 Minterm Clusters, Cubes or Products A ABCD ABD BCD D C AC Larger clusters are products with fewer variables. B Fall 2014, Sep ELEC Lecture 4 74
75 Product P 1 = ABCD = A + B + C + D A B C D P1 Signals are voltages B w.r.t. GROUND A = 0 or 1 volt C B = 0 or 1 volt C = 0 or 1 volt D D = 0 or 1 volt NMOS transistors A GROUND VDD = 1 volt PMOS transistors P1 = 0 or 1 volt More variables in a product mean more transistors (hardware). Fall 2014, Sep ELEC Lecture 4 75
76 A C Product P 2 = AC = P2 AC VDD = 1 volt Signals are voltages w.r.t. GROUND A A = 0 or 1 volt B = 0 or 1 volt C = 0 or 1 volt C D = 0 or 1 volt P1 = 0 or 1 volt GROUND Fewer variables in a product mean fewer transistors (hardware). Fall 2014, Sep ELEC Lecture 4 76
77 Observations A larger minterm cluster is a product with fewer variables; requires fewer transistors. Each gate input needs two transistors. Smaller number of clusters is more efficient: Fewer gates to generate products. Fewer inputs for the OR gate to produce the function. Direct minterm implementation is most inefficient. Fall 2014, Sep ELEC Lecture 4 77
EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive
EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive March 30, 2010 John Wawrzynek Spring 2010 EECS150 - Lec19-cl1 Page 1 Boolean Algebra I (Representations of Combinational
More informationCS 226: Digital Logic Design
CS 226: Digital Logic Design 0 1 1 I S 0 1 0 S Department of Computer Science and Engineering, Indian Institute of Technology Bombay. 1 of 29 Objectives In this lecture we will introduce: 1. Logic functions
More informationL2: Combinational Logic Design (Construction and Boolean Algebra)
L2: Combinational Logic Design (Construction and Boolean Algebra) Acknowledgements: Lecture material adapted from Chapter 2 of R. Katz, G. Borriello, Contemporary Logic Design (second edition), Pearson
More informationCombinational Logic. Review of Combinational Logic 1
Combinational Logic! Switches -> Boolean algebra! Representation of Boolean functions! Logic circuit elements - logic gates! Regular logic structures! Timing behavior of combinational logic! HDLs and combinational
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT2: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 2 Following the slides of Dr. Ahmed H. Madian ذو الحجة 438 ه Winter
More informationThis form sometimes used in logic circuit, example:
Objectives: 1. Deriving of logical expression form truth tables. 2. Logical expression simplification methods: a. Algebraic manipulation. b. Karnaugh map (k-map). 1. Deriving of logical expression from
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active
More informationAdvanced Digital Design with the Verilog HDL, Second Edition Michael D. Ciletti Prentice Hall, Pearson Education, 2011
Problem 2-1 Recall that a minterm is a cube in which every variable appears. A Boolean expression in SOP form is canonical if every cube in the expression has a unique representation in which all of the
More informationEEE130 Digital Electronics I Lecture #4
EEE130 Digital Electronics I Lecture #4 - Boolean Algebra and Logic Simplification - By Dr. Shahrel A. Suandi Topics to be discussed 4-1 Boolean Operations and Expressions 4-2 Laws and Rules of Boolean
More information2009 Spring CS211 Digital Systems & Lab CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS
CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS What will we learn? 2 Logic functions and circuits Boolean Algebra Logic gates and Synthesis CAD tools and VHDL Read Section 2.9 and 2.0 Terminology 3 Digital
More informationChapter 2: Boolean Algebra and Logic Gates
Chapter 2: Boolean Algebra and Logic Gates Mathematical methods that simplify binary logics or circuits rely primarily on Boolean algebra. Boolean algebra: a set of elements, a set of operators, and a
More informationBoolean Algebra and logic gates
Boolean Algebra and logic gates Luis Entrena, Celia López, Mario García, Enrique San Millán Universidad Carlos III de Madrid 1 Outline l Postulates and fundamental properties of Boolean Algebra l Boolean
More informationGates and Logic: From switches to Transistors, Logic Gates and Logic Circuits
Gates and Logic: From switches to Transistors, Logic Gates and Logic Circuits Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University See: P&H ppendix C.2 and C.3 (lso, see C.0 and
More informationUnit 2 Session - 6 Combinational Logic Circuits
Objectives Unit 2 Session - 6 Combinational Logic Circuits Draw 3- variable and 4- variable Karnaugh maps and use them to simplify Boolean expressions Understand don t Care Conditions Use the Product-of-Sums
More informationLecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps
EE210: Switching Systems Lecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps Prof. YingLi Tian Feb. 21/26, 2019 Department of Electrical Engineering The City College of New York
More informationCPE100: Digital Logic Design I
Chapter 2 Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu http://www.ee.unlv.edu/~b1morris/cpe100/ CPE100: Digital Logic Design I Section 1004: Dr. Morris Combinational Logic Design Chapter
More informationEx: Boolean expression for majority function F = A'BC + AB'C + ABC ' + ABC.
Boolean Expression Forms: Sum-of-products (SOP) Write an AND term for each input combination that produces a 1 output. Write the input variable if its value is 1; write its complement otherwise. OR the
More informationChapter 2: Switching Algebra and Logic Circuits
Chapter 2: Switching Algebra and Logic Circuits Formal Foundation of Digital Design In 1854 George Boole published An investigation into the Laws of Thoughts Algebraic system with two values 0 and 1 Used
More informationChapter 2 Boolean Algebra and Logic Gates
Ch1: Digital Systems and Binary Numbers Ch2: Ch3: Gate-Level Minimization Ch4: Combinational Logic Ch5: Synchronous Sequential Logic Ch6: Registers and Counters Switching Theory & Logic Design Prof. Adnan
More informationSimplification of Boolean Functions. Dept. of CSE, IEM, Kolkata
Simplification of Boolean Functions Dept. of CSE, IEM, Kolkata 1 Simplification of Boolean Functions: An implementation of a Boolean Function requires the use of logic gates. A smaller number of gates,
More informationNumber System conversions
Number System conversions Number Systems The system used to count discrete units is called number system. There are four systems of arithmetic which are often used in digital electronics. Decimal Number
More informationIntro To Digital Logic
Intro To Digital Logic 1 Announcements... Project 2.2 out But delayed till after the midterm Midterm in a week Covers up to last lecture + next week's homework & lab Nick goes "H-Bomb of Justice" About
More informationStandard Expression Forms
ThisLecture will cover the following points: Canonical and Standard Forms MinTerms and MaxTerms Digital Logic Families 24 March 2010 Standard Expression Forms Two standard (canonical) expression forms
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Chapter 2 - Part 1 2 Chapter 2 - Part 1 3 Chapter 2 - Part 1 4 Chapter 2 - Part
More informationAdministrative Notes. Chapter 2 <9>
Administrative Notes Note: New homework instructions starting with HW03 Homework is due at the beginning of class Homework must be organized, legible (messy is not), and stapled to be graded Chapter 2
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. Overview Part 1 Gate
More informationBoolean Algebra. The Building Blocks of Digital Logic Design. Section. Section Overview. Binary Operations and Their Representation.
Section 3 Boolean Algebra The Building Blocks of Digital Logic Design Section Overview Binary Operations (AND, OR, NOT), Basic laws, Proof by Perfect Induction, De Morgan s Theorem, Canonical and Standard
More informationChapter 7 Logic Circuits
Chapter 7 Logic Circuits Goal. Advantages of digital technology compared to analog technology. 2. Terminology of Digital Circuits. 3. Convert Numbers between Decimal, Binary and Other forms. 5. Binary
More informationCs302 Quiz for MID TERM Exam Solved
Question # 1 of 10 ( Start time: 01:30:33 PM ) Total Marks: 1 Caveman used a number system that has distinct shapes: 4 5 6 7 Question # 2 of 10 ( Start time: 01:31:25 PM ) Total Marks: 1 TTL based devices
More informationCHAPTER III BOOLEAN ALGEBRA
CHAPTER III- CHAPTER III CHAPTER III R.M. Dansereau; v.. CHAPTER III-2 BOOLEAN VALUES INTRODUCTION BOOLEAN VALUES Boolean algebra is a form of algebra that deals with single digit binary values and variables.
More informationCSE140: Components and Design Techniques for Digital Systems. Introduction. Instructor: Mohsen Imani
CSE4: Components and Design Techniques for Digital Systems Introduction Instructor: Mohsen Imani Slides from: Prof.Tajana Simunic Rosing & Dr.Pietro Mercati Welcome to CSE 4! Instructor: Mohsen Imani Email:
More informationChapter 2 Combinational logic
Chapter 2 Combinational logic Chapter 2 is very easy. I presume you already took discrete mathemtics. The major part of chapter 2 is boolean algebra. II - Combinational Logic Copyright 24, Gaetano Borriello
More informationLogical Design of Digital Systems
Lecture 4 Table of Content 1. Combinational circuit design 2. Elementary combinatorial circuits for data transmission 3. Memory structures 4. Programmable logic devices 5. Algorithmic minimization approaches
More informationLearning Objectives 10/7/2010. CE 411 Digital System Design. Fundamental of Logic Design. Review the basic concepts of logic circuits. Dr.
/7/ CE 4 Digital ystem Design Dr. Arshad Aziz Fundamental of ogic Design earning Objectives Review the basic concepts of logic circuits Variables and functions Boolean algebra Minterms and materms ogic
More informationSwitches: basic element of physical implementations
Combinational logic Switches Basic logic and truth tables Logic functions Boolean algebra Proofs by re-writing and by perfect induction Winter 200 CSE370 - II - Boolean Algebra Switches: basic element
More informationFundamentals of Computer Systems
Fundamentals of Computer Systems Boolean Logic Stephen A. Edwards Columbia University Summer 2017 Boolean Logic George Boole 1815 1864 Boole s Intuition Behind Boolean Logic Variables,,... represent classes
More informationCombinational Logic Design Principles
Combinational Logic Design Principles Switching algebra Doru Todinca Department of Computers Politehnica University of Timisoara Outline Introduction Switching algebra Axioms of switching algebra Theorems
More informationLogic Design I (17.341) Fall Lecture Outline
Logic Design I (17.341) Fall 2011 Lecture Outline Class # 06 October 24, 2011 Dohn Bowden 1 Today s Lecture Administrative Main Logic Topic Homework 2 Course Admin 3 Administrative Admin for tonight Syllabus
More informationReview. EECS Components and Design Techniques for Digital Systems. Lec 06 Minimizing Boolean Logic 9/ Review: Canonical Forms
Review EECS 150 - Components and Design Techniques for Digital Systems Lec 06 Minimizing Boolean Logic 9/16-04 David Culler Electrical Engineering and Computer Sciences University of California, Berkeley
More informationLecture 22 Chapters 3 Logic Circuits Part 1
Lecture 22 Chapters 3 Logic Circuits Part 1 LC-3 Data Path Revisited How are the components Seen here implemented? 5-2 Computing Layers Problems Algorithms Language Instruction Set Architecture Microarchitecture
More informationDigital Circuit And Logic Design I. Lecture 3
Digital Circuit And Logic Design I Lecture 3 Outline Combinational Logic Design Principles (). Introduction 2. Switching algebra 3. Combinational-circuit analysis 4. Combinational-circuit synthesis Panupong
More informationCHAPTER III BOOLEAN ALGEBRA
CHAPTER III- CHAPTER III CHAPTER III R.M. Dansereau; v.. CHAPTER III-2 BOOLEAN VALUES INTRODUCTION BOOLEAN VALUES Boolean algebra is a form of algebra that deals with single digit binary values and variables.
More informationCSE20: Discrete Mathematics for Computer Science. Lecture Unit 2: Boolan Functions, Logic Circuits, and Implication
CSE20: Discrete Mathematics for Computer Science Lecture Unit 2: Boolan Functions, Logic Circuits, and Implication Disjunctive normal form Example: Let f (x, y, z) =xy z. Write this function in DNF. Minterm
More informationE&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev
E&CE 223 Digital Circuits & Systems Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev 4 of 92 Section 2: Boolean Algebra & Logic Gates Major topics Boolean algebra NAND & NOR gates Boolean
More informationE40M. Binary Numbers. M. Horowitz, J. Plummer, R. Howe 1
E40M Binary Numbers M. Horowitz, J. Plummer, R. Howe 1 Reading Chapter 5 in the reader A&L 5.6 M. Horowitz, J. Plummer, R. Howe 2 Useless Box Lab Project #2 Adding a computer to the Useless Box alows us
More informationCombinatorial Logic Design Principles
Combinatorial Logic Design Principles ECGR2181 Chapter 4 Notes Logic System Design I 4-1 Boolean algebra a.k.a. switching algebra deals with boolean values -- 0, 1 Positive-logic convention analog voltages
More informationCombinational Logic Fundamentals
Topic 3: Combinational Logic Fundamentals In this note we will study combinational logic, which is the part of digital logic that uses Boolean algebra. All the concepts presented in combinational logic
More informationStandard & Canonical Forms
1 COE 202- Digital Logic Standard & Canonical Forms Dr. Abdulaziz Y. Barnawi COE Department KFUPM 2 Outline Minterms and Maxterms From truth table to Boolean expression Sum of minterms Product of Maxterms
More informationGates and Logic: From Transistors to Logic Gates and Logic Circuits
Gates and Logic: From Transistors to Logic Gates and Logic Circuits Prof. Hakim Weatherspoon CS 3410 Computer Science Cornell University The slides are the product of many rounds of teaching CS 3410 by
More informationChap 2. Combinational Logic Circuits
Overview 2 Chap 2. Combinational Logic Circuits Spring 24 Part Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra Standard Forms Part 2 Circuit Optimization Two-Level Optimization
More informationBoolean Algebra and Digital Logic 2009, University of Colombo School of Computing
IT 204 Section 3.0 Boolean Algebra and Digital Logic Boolean Algebra 2 Logic Equations to Truth Tables X = A. B + A. B + AB A B X 0 0 0 0 3 Sum of Products The OR operation performed on the products of
More informationL2: Combinational Logic Design (Construction and Boolean Algebra)
L2: Combinational Logic Design (Construction and oolean lgebra) cknowledgements: Lecture material adapted from Chapter 2 of R. Katz, G. orriello, Contemporary Logic Design (second edition), Pearson Education,
More informationGates and Logic: From Transistors to Logic Gates and Logic Circuits
Gates and Logic: From Transistors to Logic Gates and Logic Circuits Prof. Hakim Weatherspoon CS 3410 Computer Science Cornell University The slides are the product of many rounds of teaching CS 3410 by
More informationMidterm1 Review. Jan 24 Armita
Midterm1 Review Jan 24 Armita Outline Boolean Algebra Axioms closure, Identity elements, complements, commutativity, distributivity theorems Associativity, Duality, De Morgan, Consensus theorem Shannon
More informationBoolean Algebra and Logic Design (Class 2.2 1/24/2013) CSE 2441 Introduction to Digital Logic Spring 2013 Instructor Bill Carroll, Professor of CSE
Boolean Algebra and Logic Design (Class 2.2 1/24/2013) CSE 2441 Introduction to Digital Logic Spring 2013 Instructor Bill Carroll, Professor of CSE Today s Topics Boolean algebra applications in logic
More informationComputer Organization I. Lecture 13: Design of Combinational Logic Circuits
Computer Organization I Lecture 13: Design of Combinational Logic Circuits Overview The optimization of multiple-level circuits Mapping Technology Verification Objectives To know how to optimize the multiple-level
More informationSlides for Lecture 10
Slides for Lecture 10 ENEL 353: Digital Circuits Fall 2013 Term Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary 30 September, 2013 ENEL 353
More informationFundamentals of Computer Systems
Fundamentals of Computer Systems Boolean Logic Stephen A. Edwards Columbia University Summer 2015 Boolean Logic George Boole 1815 1864 Boole s Intuition Behind Boolean Logic Variables X,,... represent
More informationFloating Point Representation and Digital Logic. Lecture 11 CS301
Floating Point Representation and Digital Logic Lecture 11 CS301 Administrative Daily Review of today s lecture w Due tomorrow (10/4) at 8am Lab #3 due Friday (9/7) 1:29pm HW #5 assigned w Due Monday 10/8
More informationLecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions
EE210: Switching Systems Lecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions Prof. YingLi Tian Feb. 15, 2018 Department of Electrical Engineering The City College of New York The
More informationLecture A: Logic Design and Gates
Lecture A: Logic Design and Gates Syllabus My office hours 9.15-10.35am T,Th or gchoi@ece.tamu.edu 333G WERC Text: Brown and Vranesic Fundamentals of Digital Logic,» Buy it.. Or borrow it» Other book:
More informationWeek-I. Combinational Logic & Circuits
Week-I Combinational Logic & Circuits Overview Binary logic operations and gates Switching algebra Algebraic Minimization Standard forms Karnaugh Map Minimization Other logic operators IC families and
More informationEC-121 Digital Logic Design
EC-121 Digital Logic Design Lecture 2 [Updated on 02-04-18] Boolean Algebra and Logic Gates Dr Hashim Ali Spring 2018 Department of Computer Science and Engineering HITEC University Taxila!1 Overview What
More informationUNIT 4 MINTERM AND MAXTERM EXPANSIONS
UNIT 4 MINTERM AND MAXTERM EXPANSIONS Spring 2 Minterm and Maxterm Expansions 2 Contents Conversion of English sentences to Boolean equations Combinational logic design using a truth table Minterm and
More informationELEC Digital Logic Circuits Fall 2014 Sequential Circuits (Chapter 6) Finite State Machines (Ch. 7-10)
ELEC 2200-002 Digital Logic Circuits Fall 2014 Sequential Circuits (Chapter 6) Finite State Machines (Ch. 7-10) Vishwani D. Agrawal James J. Danaher Professor Department of Electrical and Computer Engineering
More informationDigital Logic Design. Combinational Logic
Digital Logic Design Combinational Logic Minterms A product term is a term where literals are ANDed. Example: x y, xz, xyz, A minterm is a product term in which all variables appear exactly once, in normal
More informationSlide Set 3. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary
Slide Set 3 for ENEL 353 Fall 2016 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary Fall Term, 2016 SN s ENEL 353 Fall 2016 Slide Set 3 slide
More informationChapter-2 BOOLEAN ALGEBRA
Chapter-2 BOOLEAN ALGEBRA Introduction: An algebra that deals with binary number system is called Boolean Algebra. It is very power in designing logic circuits used by the processor of computer system.
More informationECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2
ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2 Instructor: Andrew B. Kahng (lecture) Email: abk@ucsd.edu Telephone: 858-822-4884 office, 858-353-0550 cell Office: 3802
More informationMC9211 Computer Organization
MC92 Computer Organization Unit : Digital Fundamentals Lesson2 : Boolean Algebra and Simplification (KSB) (MCA) (29-2/ODD) (29 - / A&B) Coverage Lesson2 Introduces the basic postulates of Boolean Algebra
More informationFundamentals of Computer Systems
Fundamentals of Computer Systems Boolean Logic Stephen A. Edwards Columbia University Fall 2011 Boolean Logic George Boole 1815 1864 Boole s Intuition Behind Boolean Logic Variables x, y,... represent
More informationComputer Organization: Boolean Logic
Computer Organization: Boolean Logic Representing and Manipulating Data Last Unit How to represent data as a sequence of bits How to interpret bit representations Use of levels of abstraction in representing
More informationOutline. EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) Combinational Logic (CL) Defined
EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) January 30, 2003 John Wawrzynek Outline Review of three representations for combinational logic:
More informationL4: Karnaugh diagrams, two-, and multi-level minimization. Elena Dubrova KTH / ICT / ES
L4: Karnaugh diagrams, two-, and multi-level minimization Elena Dubrova KTH / ICT / ES dubrova@kth.se Combinatorial system a(t) not(a(t)) A combinatorial system has no memory - its output depends therefore
More informationEECS Variable Logic Functions
EECS150 Section 1 Introduction to Combinational Logic Fall 2001 2-Variable Logic Functions There are 16 possible functions of 2 input variables: in general, there are 2**(2**n) functions of n inputs X
More informationCPE100: Digital Logic Design I
Chapter 2 Professor Brendan Morris, SEB 326, brendan.morris@unlv.edu http://www.ee.unlv.edu/~bmorris/cpe/ CPE: Digital Logic Design I Section 4: Dr. Morris Combinational Logic Design Chapter 2 Chapter
More informationCMSC 313 Lecture 17 Postulates & Theorems of Boolean Algebra Semiconductors CMOS Logic Gates
CMSC 313 Lecture 17 Postulates & Theorems of Boolean Algebra Semiconductors CMOS Logic Gates UMBC, CMSC313, Richard Chang Last Time Overview of second half of this course Logic gates &
More informationE&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev. Section 2: Boolean Algebra & Logic Gates
Digital Circuits & Systems Lecture Transparencies (Boolean lgebra & Logic Gates) M. Sachdev 4 of 92 Section 2: Boolean lgebra & Logic Gates Major topics Boolean algebra NND & NOR gates Boolean algebra
More informationCHAPTER 5 KARNAUGH MAPS
CHAPTER 5 1/36 KARNAUGH MAPS This chapter in the book includes: Objectives Study Guide 5.1 Minimum Forms of Switching Functions 5.2 Two- and Three-Variable Karnaugh Maps 5.3 Four-Variable Karnaugh Maps
More informationCPE100: Digital Logic Design I
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu CPE100: Digital Logic Design I Midterm01 Review http://www.ee.unlv.edu/~b1morris/cpe100/ 2 Logistics Thursday Oct. 5 th In normal lecture (13:00-14:15)
More informationDIGITAL TECHNICS. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute 1. LECTURE: COMBINATONAL CIRCUITS BASIC CONCEPTS
DIGITAL TECHNICS Dr. Bálint Pődör Óbuda University, Microelectronics and Technology Institute. LECTURE: COMBINATONAL CIRCUITS BASIC CONCEPTS 26/27. LECTURE: COMBINATONAL CIRCUITS BASIC CONCEPTS. General
More informationBoolean Algebra, Gates and Circuits
Boolean Algebra, Gates and Circuits Kasper Brink November 21, 2017 (Images taken from Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc.) Outline Last week: Von
More informationELEC Digital Logic Circuits Fall 2014 Boolean Algebra (Chapter 2)
ELEC 2200-002 Digital Logic Circuits Fall 2014 Boolean Algebra (Chapter 2) Vishwani D. Agrawal James J. Danaher Professor Department of Electrical and Computer Engineering Auburn University, Auburn, AL
More informationCMSC 313 Lecture 16 Postulates & Theorems of Boolean Algebra Semiconductors CMOS Logic Gates
CMSC 33 Lecture 6 Postulates & Theorems of oolean lgebra Semiconductors CMOS Logic Gates UMC, CMSC33, Richard Chang Last Time Overview of second half of this course Logic gates & symbols
More informationECE 342 Electronic Circuits. Lecture 34 CMOS Logic
ECE 34 Electronic Circuits Lecture 34 CMOS Logic Jose E. Schutt-Aine Electrical & Computer Engineering University of Illinois jesa@illinois.edu 1 De Morgan s Law Digital Logic - Generalization ABC... ABC...
More informationDigital Logic. CS211 Computer Architecture. l Topics. l Transistors (Design & Types) l Logic Gates. l Combinational Circuits.
CS211 Computer Architecture Digital Logic l Topics l Transistors (Design & Types) l Logic Gates l Combinational Circuits l K-Maps Figures & Tables borrowed from:! http://www.allaboutcircuits.com/vol_4/index.html!
More informationECE 546 Lecture 10 MOS Transistors
ECE 546 Lecture 10 MOS Transistors Spring 2018 Jose E. Schutt-Aine Electrical & Computer Engineering University of Illinois jesa@illinois.edu NMOS Transistor NMOS Transistor N-Channel MOSFET Built on p-type
More informationUNIT 5 KARNAUGH MAPS Spring 2011
UNIT 5 KRNUGH MPS Spring 2 Karnaugh Maps 2 Contents Minimum forms of switching functions Two- and three-variable Four-variable Determination of minimum expressions using essential prime implicants Five-variable
More informationCh 2. Combinational Logic. II - Combinational Logic Contemporary Logic Design 1
Ch 2. Combinational Logic II - Combinational Logic Contemporary Logic Design 1 Combinational logic Define The kind of digital system whose output behavior depends only on the current inputs memoryless:
More informationCHAPTER1: Digital Logic Circuits Combination Circuits
CS224: Computer Organization S.KHABET CHAPTER1: Digital Logic Circuits Combination Circuits 1 PRIMITIVE LOGIC GATES Each of our basic operations can be implemented in hardware using a primitive logic gate.
More informationL2: Combinational Logic Design (Construction and Boolean Algebra)
L2: Combinational Logic Design (Construction and oolean lgebra) cknowledgements: Materials in this lecture are courtesy of the following people and used with permission. - Randy H. Katz (University of
More informationEECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits)
EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) September 5, 2002 John Wawrzynek Fall 2002 EECS150 Lec4-bool1 Page 1, 9/5 9am Outline Review of
More informationLogic Design. Chapter 2: Introduction to Logic Circuits
Logic Design Chapter 2: Introduction to Logic Circuits Introduction Logic circuits perform operation on digital signal Digital signal: signal values are restricted to a few discrete values Binary logic
More informationLogic Gate Level. Part 2
Logic Gate Level Part 2 Constructing Boolean expression from First method: write nonparenthesized OR of ANDs Each AND is a 1 in the result column of the truth table Works best for table with relatively
More informationfor Digital Systems Simplification of logic functions Tajana Simunic Rosing Sources: TSR, Katz, Boriello & Vahid
SE140: omponents and Design Techniques for Digital Systems Simplification of logic functions Tajana Simunic Rosing 1 What we covered thus far: Number representations Where we are now inary, Octal, Hex,
More informationII. COMBINATIONAL LOGIC DESIGN. - algebra defined on a set of 2 elements, {0, 1}, with binary operators multiply (AND), add (OR), and invert (NOT):
ENGI 386 Digital Logic II. COMBINATIONAL LOGIC DESIGN Combinational Logic output of digital system is only dependent on current inputs (i.e., no memory) (a) Boolean Algebra - developed by George Boole
More informationLecture 4: More Boolean Algebra
Lecture 4: More Boolean Algebra Syed M. Mahmud, Ph.D ECE Department Wayne State University Original Source: Prof. Russell Tessier of University of Massachusetts Aby George of Wayne State University ENGIN2
More information211: Computer Architecture Summer 2016
211: Computer Architecture Summer 2016 Liu Liu Topic: Storage Project3 Digital Logic - Storage: Recap - Review: cache hit rate - Project3 - Digital Logic: - truth table => SOP - simplification: Boolean
More informationENG2410 Digital Design Combinational Logic Circuits
ENG240 Digital Design Combinational Logic Circuits Fall 207 S. Areibi School of Engineering University of Guelph Binary variables Binary Logic Can be 0 or (T or F, low or high) Variables named with single
More information