1 Digital Fundamentals Tenth Edition Floyd Chapter 3 Modified by Yuttapong Jiraraksopakun Floyd, Digital Fundamentals, th 28 Pearson Education ENE, KMUTT ed 29
2 The Inverter Summary The inverter performs the oolean NOT operation. When the input is LOW, the output is HIGH; when the input is HIGH, the output is LOW. Input Output LOW () HIGH () HIGH () LOW() The NOT operation (complement) is shown with an overbar. Thus, the oolean expression for an inverter is =.
3 The Inverter Summary Example waveforms: group of inverters can be used to form the s complement of a binary number: inary number s complement
4 The ND Gate Summary The ND gate produces a HIGH output when all inputs are HIGH; otherwise, the output is LOW. For a 2-input gate, the truth table is Inputs Output The ND operation is usually shown with a dot between the variables but it may be implied (no dot). Thus, the ND operation is written as =. or =. &
5 Summary The ND Gate & Example waveforms: The ND operation is used in computer programming as a selective mask. If you want to retain certain bits of a binary number but reset the other bits to, you could set a mask with s in the position of the retained bits. If the binary number is NDed with the mask, what is the result?
6 The OR Gate Summary The OR gate produces a HIGH output if any input is HIGH; if all inputs are LOW, the output is LOW. For a 2-input gate, the truth table is Inputs Output The OR operation is shown with a plus sign (+) between the variables. Thus, the OR operation is written as = +.
7 Summary The OR Gate Example waveforms: The OR operation can be used in computer programming to set certain bits of a binary number to. SCII letters have a in the bit 5 position for lower case letters and a in this position for capitals. (it positions are numbered from right to left starting with.) What will be the result if you OR an SCII letter with the 8-bit mask? The resulting letter will be lower case.
8 The NND Gate Summary The NND gate produces a LOW output when all inputs are HIGH; otherwise, the output is HIGH. For a 2-input gate, the truth table is Inputs Output The NND operation is shown with a dot between the variables and an overbar covering them. Thus, the NND operation is written as =. (lternatively, =.) &
9 Summary The NND Gate & Example waveforms: The NND gate is particularly useful because it is a universal gate all other basic gates can be constructed from NND gates. How would you connect a 2-input NND gate to form a basic inverter?
10 Negative-OR Equivalent Summary
11 The NOR Gate Summary The NOR gate produces a LOW output if any input is HIGH; if all inputs are HIGH, the output is LOW. For a 2-input gate, the truth table is Inputs Output The NOR operation is shown with a plus sign (+) between the variables and an overbar covering them. Thus, the NOR operation is written as = +.
12 Summary The NOR Gate Example waveforms: The NOR operation will produce a LOW if any input is HIGH. When is the LED is ON for the circuit shown? +5. V 33 Ω The LED will be on when any of the four inputs are HIGH. C D
13 Negative-ND Equivalent Summary
14 The OR Gate Summary The OR gate produces a HIGH output only when both inputs are at opposite logic levels. The truth table is = Inputs Output The OR operation is written as = +. lternatively, it can be written with a circled plus sign between the variables as = +.
15 Summary The OR Gate = Example waveforms: Notice that the OR gate will produce a HIGH only when exactly one input is HIGH. If the and waveforms are both inverted for the above waveforms, how is the output affected? There is no change in the output.
16 The NOR Gate Summary The NOR gate produces a HIGH output only when both inputs are at the same logic level. The truth table is = Inputs Output The NOR operation shown as = +. lternatively, the NOR operation can be shown with a circled dot between the variables. Thus, it can be shown as =..
17 Summary The NOR Gate = Example waveforms: Notice that the NOR gate will produce a HIGH when both inputs are the same. This makes it useful for comparison functions. If the waveform is inverted but remains the same, how is the output affected? The output will be inverted.
18 Summary Fixed Function Logic Two major fixed function logic families are TTL and CMOS. third technology is icmos, which combines the first two. Packaging for fixed function logic is shown in in ±. in in Pin no. identifiers 4 Lead no. identifier DIP package SOIC package
19 Summary Fixed Function Logic Some common gate configurations are shown. V CC V CC V CC V CC ' GND ' GND ' GND ' GND V CC V CC V CC V CC ' GND ' GND ' GND ' GND V CC V CC V CC V CC ' GND ' GND ' GND ' GND
20 Fixed Function Logic Summary Logic symbols show the gates and associated pin numbers. () (2) (4) (5) (9) () (2) (3) V CC (4) (3) (6) (8) () () & (3) (2) (4) (5) (6) (9) () (8) (2) (3) () (7) GND
21 Fixed Function Logic Summary Data sheets include limits and conditions set by the manufacturer as well as DC and C characteristics. For example, some maximum ratings for a 74HC are: V CC MIMUM RTINGS Symbol Parameter Value Unit DC Supply Voltage (Referenced to GND).5 to + 7. V V V in DC Input Voltage (Referenced to GND).5 to V CC +.5 V V V out DC Output Voltage (Referenced to GND).5 to V CC +.5 V V I in DC Input Current, per pin ± 2 m DC Output Current, per pin ± 25 m I CC DC Supply Current, V CC and GND pins ± 5 m P D Power Dissipation in Still ir, Plastic or Ceramic DIP 75 mw T stg SOIC Package TSSOP Package Storage Temperature to + 5 C T L Lead Temperature, mm from Case for Seconds C Plastic DIP, SOIC, or TSSOP Package 26 Ceramic DIP 3
22 Digital Fundamentals Tenth Edition Floyd Chapter 4 Modified by Yuttapong Jiraraksopakun Floyd, Digital Fundamentals, th 28 Pearson Education ENE, KMUTT ed 29
23 Summary oolean ddition In oolean algebra, a variable is a symbol used to represent an action, a condition, or data. single variable can only have a value of or. The complement represents the inverse of a variable and is indicated with an overbar. Thus, the complement of is. literal is a variable or its complement. ddition is equivalent to the OR operation. The sum term is if one or more if the literals are. The sum term is zero only if each literal is. Determine the values of,, and C that make the sum term of the expression + + C =? Each literal must = ; therefore =, = and C =.
24 oolean Multiplication Summary In oolean algebra, multiplication is equivalent to the ND operation. The product of literals forms a product term. The product term will be only if all of the literals are. What are the values of the, and C if the product term of.. C =? Each literal must = ; therefore =, = and C =.
25 Summary Commutative Laws The commutative laws are applied to addition and multiplication. For addition, the commutative law states In terms of the result, the order in which variables are ORed makes no difference. + = + For multiplication, the commutative law states In terms of the result, the order in which variables are NDed makes no difference. =
26 Summary ssociative Laws The associative laws are also applied to addition and multiplication. For addition, the associative law states When ORing more than two variables, the result is the same regardless of the grouping of the variables. + ( +C) = ( + ) + C For multiplication, the associative law states When NDing more than two variables, the result is the same regardless of the grouping of the variables. (C) = ()C
27 Summary Distributive Law The distributive law is the factoring law. common variable can be factored from an expression just as in ordinary algebra. That is + C = (+ C) The distributive law can be illustrated with equivalent circuits: C + C (+ C) C C + C
29 Rules of oolean lgebra Summary Rules of oolean algebra can be illustrated with Venn diagrams. The variable is shown as an area. The rule + = can be illustrated easily with a diagram. dd an overlapping area to represent the variable. The overlap region between and represents. = The diagram visually shows that + =. Other rules can be illustrated with the diagrams as well.
30 Summary Rules of oolean lgebra Illustrate the rule + = + with a Venn diagram. This time, is represented by the blue area and again by the red circle. The intersection represents. Notice that + = +
31 Rules of oolean lgebra Summary Rule 2, which states that ( + )( + C) = + C, can be proven by applying earlier rules as follows: ( + )( + C) = + C + + C = + C + + C = ( + C + ) + C =. + C = + C This rule is a little more complicated, but it can also be shown with a Venn diagram, as given on the following slide
32 Summary Three areas represent the variables,, and C. The area representing + is shown in yellow. The area representing + C is shown in red. The overlap of red and yellow is shown in orange. The overlapping area between and C represents C. ORing with gives the same area as before. + + C = C ( + )( + C) + C C C
33 DeMorgan s Theorem DeMorgan s st Theorem Summary The complement of a product of variables is equal to the sum of the complemented variables. = + pplying DeMorgan s first theorem to gates: + Inputs Output + NND Negative-OR
34 Summary DeMorgan s Theorem DeMorgan s 2 nd Theorem The complement of a sum of variables is equal to the product of the complemented variables. + =. pplying DeMorgan s second theorem to gates: + Inputs Output + NOR Negative-ND
35 DeMorgan s Theorem Summary pply DeMorgan s theorem to remove the overbar covering both terms from the expression = C + D. To apply DeMorgan s theorem to the expression, you can break the overbar covering both terms and change the sign between the terms. This results in = = C. D. Deleting the double bar gives = C. D.
36 C D Summary oolean nalysis of Logic Circuits Combinational logic circuits can be analyzed by writing the expression for each gate and combining the expressions according to the rules for oolean algebra. pply oolean algebra to derive the expression for. Write the expression for each gate: ( + ) C ( + ) = C ( + )+ D pplying DeMorgan s theorem and the distribution law: = C ( ) + D = C + D
37 Summary SOP and POS forms oolean expressions can be written in the sum-of-products form (SOP) or in the product-of-sums form (POS). These forms can simplify the implementation of combinational logic, particularly with PLDs. In both forms, an overbar cannot extend over more than one variable. n expression is in SOP form when two or more product terms are summed as in the following examples: C + C + C D C D + E n expression is in POS form when two or more sum terms are multiplied as in the following examples: ( + )( + C) ( + + C)( + D) ( + )C
38 Summary SOP Standard form In SOP standard form, every variable in the domain must appear in each term. This form is useful for constructing truth tables or for implementing logic in PLDs. You can expand a nonstandard term to standard form by multiplying the term by a term consisting of the sum of the missing variable and its complement. Convert = + C to standard form. The first term does not include the variable C. Therefore, multiply it by the (C + C), which = : = (C + C) + C = C + C + C
39 Summary POS Standard form In POS standard form, every variable in the domain must appear in each sum term of the expression. You can expand a nonstandard POS expression to standard form by adding the product of the missing variable and its complement (rule 8: =) and applying rule 2, which states that ( + )( + C) = + C. Convert = ( + )( + + C) to standard form. The first sum term does not include the variable C. Therefore, add C C and expand the result by rule 2. = ( + + C C)( + + C) = ( + + C )( + + C)( + + C)
40 Summary Converting Standard SOP to Standard POS C = ++C C = ++C C = ++C C = ++C SOP active-high logic POS active-low logic
41 Karnaugh maps Summary The Karnaugh map (K-map) is a tool for simplifying combinational logic with 3 or 4 variables. For 3 variables, 8 cells are required (2 3 ). The map shown is for three variables labeled,, and C. Each cell represents one possible product term. Each cell differs from an adjacent cell by only one variable. C C C C C C C C
42 Summary Gray code Karnaugh maps Cells are usually labeled using s and s to represent the variable and its complement. C The numbers are entered in gray code, to force adjacent cells to be different by only one variable. Ones are read as the true variable and zeros are read as the complemented variable.
43 Summary Karnaugh maps lternatively, cells can be labeled with the variable letters. This makes it simple to read, but it takes more time preparing the map. Read the terms for the yellow cells. C C C C C C C C C The cells are C and C. C C C C
44 Summary SOP Standard form in Karnaugh Map
45 Summary Karnaugh maps K-maps can simplify combinational logic by grouping cells and eliminating variables that change. Group the s on the map and read the minimum logic. changes across this boundary C C changes across this boundary. Group the s into two overlapping groups as indicated. 2. Read each group by eliminating any variable that changes across a boundary. 3. The vertical group is read C. 4. The horizontal group is read. = C +
46 Karnaugh maps 4-variable map has an adjacent cell on each of its four boundaries as shown. CD CD CD CD Summary Each cell is different only by one variable from an adjacent cell. Grouping follows the rules given in the text. The following slide shows an example of reading a four variable map using binary numbers for the variables
47 Summary Karnaugh maps Group the s on the map and read the minimum logic. changes changes CD C changes across outer boundary C changes. Group the s into two separate groups as indicated. 2. Read each group by eliminating any variable that changes across a boundary. 3. The upper (yellow) group is read as D. 4. The lower (green) group is read as D. = D +D
48 Summary Converting Standard SOP to Standard POS with Karnaugh SOP = C + + C POS = (+C) (+) (+C) SOP = C+ C+
Summary Boolean Addition In Boolean algebra, a variable is a symbol used to represent an action, a condition, or data. A single variable can only have a value of or 0. The complement represents the inverse
Lecture 7 Logic Simplification Simplification Using oolean lgebra simplified oolean expression uses the fewest gates possible to implement a given expression. +(+)+(+) Simplification Using oolean lgebra
Company LOGO DKT 122/3 DIGITAL SYSTEM 1 BOOLEAN ALGEBRA (PART 2) Boolean Algebra Contents Boolean Operations & Expression Laws & Rules of Boolean algebra DeMorgan s Theorems Boolean analysis of logic circuits
University of Illinois at Urbana-Champaign Dept. of Electrical and Computer Engineering ECE 120: Introduction to Computing Two-Level Logic SOP Form Gives Good Performance s you know, one can use a K-map
Assignment (3-6) Boolean Algebra and Logic Simplification - General Questions 1. Convert the following SOP expression to an equivalent POS expression. 2. Determine the values of A, B, C, and D that make
Lecture No:5 Boolean Expressions and Definitions Boolean Algebra Boolean Algebra is used to analyze and simplify the digital (logic) circuits. It uses only the binary numbers i.e. 0 and 1. It is also called
IT 201 Digital System Design Module II Notes BOOLEAN OPERATIONS AND EXPRESSIONS Variable, complement, and literal are terms used in Boolean algebra. A variable is a symbol used to represent a logical quantity.
Digital Fundamentals Tenth Edition Floyd Chapter 1 Modified by Yuttapong Jiraraksopakun Floyd, Digital Fundamentals, 10 th 2008 Pearson Education ENE, KMUTT ed 2009 Analog Quantities Most natural quantities
Introduction to Microprocessors and Digital (ME262) lgebra and Spring 2 Outline. lgebra 2. 3. Karnaugh Maps () 4. Two-variable 5. 6. 7. 2 lgebra s of Simplifying equations are defined in terms of inary
Points missed: Student's Name: Total score: /100 points East Tennessee State University Department of Computer and Information Sciences CSCI 2150 (Tarnoff) Computer Organization TEST 1 for Fall Semester,
EEE130 Digital Electronics I Lecture #4_1 - Boolean Algebra and Logic Simplification - By Dr. Shahrel A. Suandi 4-6 Standard Forms of Boolean Expressions There are two standard forms: Sum-of-products form
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 3 Additional Gates and Circuits Charles Kime & Thomas Kaminski 28 Pearson Education, Inc. (Hyperlinks are active in View
Get Free notes at Module-I One s Complement: Complement all the bits.i.e. makes all 1s as 0s and all 0s as 1s Two s Complement: One s complement+1 SIGNED BINARY NUMBERS Positive integers (including zero)
Experiment 4 Boolean Functions Implementation Introduction: Generally you will find that the basic logic functions AND, OR, NAND, NOR, and NOT are not sufficient to implement complex digital logic functions.
2.6 BOOLEAN FUNCTIONS Binary variables have two values, either 0 or 1. A Boolean function is an expression formed with binary variables, the two binary operators AND and OR, one unary operator NOT, parentheses
ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, firstname.lastname@example.org Dr. Eng. Wassim Alexan, email@example.com Lecture 3 Following the slides of Dr. Ahmed H. Madian ذو الحجة 1438 ه Winter
3.1 Objectives To write Boolean functions in their standard Min and Max terms format. To simplify Boolean expressions using. 3.2 Sum of Products & Product of Sums Any Boolean expression can be simplified
Points Addressed in this Lecture Lecture 4: Logic Simplication & Karnaugh Map Professor Peter Cheung Department of EEE, Imperial College London Standard form of Boolean Expressions Sum-of-Products (SOP),
Chap-2 Boolean Algebra Contents: My name Outline: My position, contact Basic information theorem and postulate of Boolean Algebra. or project description Boolean Algebra. Canonical and Standard form. Digital
dam lank pring 27 E 3 Identity Pre-Lecture Problem Do it! Do it now! What are you waiting for?! Use Logical Equivalences to show!! $! & & $! p ^ T p p _ F p Domination p _ T T p ^ F F Idempotency p _ p
Module: Logic Design Name:... University no:.. Group no:. Lab Partner Name: Mr. Mohamed El-Saied Experiment : Logic Simplification Objective: How to implement and verify the operation of the logical functions
Topic.2.3 Karnaugh Maps Learning Objectives: t the end of this topic you will be able to; Draw a Karnaugh map for a logic system with up to four inputs and use it to minimise the number of gates required;
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active in View Show
Name EET 1131 Lab #5 Logic Simplification Techniques OBJECTIVES: Upon completing this lab, you ll be able to: 1) Obtain the experimental truth table of a logic circuit. 2) Use Boolean algebra to simplify
Combinational Circuits Digital Logic (Materials taken primarily from: http://www.facstaff.bucknell.edu/mastascu/elessonshtml/eeindex.html http://www.cs.princeton.edu/~cos126 ) Digital Systems What is a
CHAPTER-2 STRUCTURE OF BOOLEAN FUNCTION USING GATES, K-Map and Quine-McCluskey 2. Introduction Logic gates are connected together to produce a specified output for certain specified combinations of input
Ch. 5 : Boolean Algebra & Reduction firstname.lastname@example.org Objectives Should able to: Write Boolean equations for combinational logic applications. Utilize Boolean algebra laws and rules for simplifying
COURSE / CODE DIGITAL SYSTEMS FUNDAMENTAL (ECE 421) DIGITAL ELECTRONICS FUNDAMENTAL (ECE 422) BOOLEAN ALGEBRA Boolean Logic Boolean logic is a complete system for logical operations. It is used in countless
Digital Logic Circuits Logic Design (Part ) Combinational Logic Circuits (Chapter 3) ² We saw how we can build the simple logic gates using transistors ² Use these gates as building blocks to build more
University of Wisconsin - Madison EE/omp Sci 352 Digital Systems Fundamentals harles R. Kime Section 2 Fall 2 hapter 3 ombinational Logic Design Part 2 Tom Kaminski & harles R. Kime harles Kime & Thomas
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Overview Part Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra Standard
University of Illinois at Urbana-Champaign Dept. of Electrical and Computer Engineering ECE 120: Introduction to Computing To Simplify, Write Function as a Sum of Prime Implicants One way to simplify a
Boolean Algebra BME28 Logic Circuits Yalçın İŞLER email@example.com http://me.islerya.com 5 Boolean Algebra /2 A set of elements B There exist at least two elements x, y B s. t. x y Binary operators: +
Lecture (05) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee ١ Minterms and Maxterms consider two binary variables x and y combined with an AND operation. Since eachv ariable may appear in either
1. Mark the correct statement(s) 1.1 A theorem in Boolean algebra: a) Can easily be proved by e.g. logic induction b) Is a logical statement that is assumed to be true, c) Can be contradicted by another
University of Technology Lecturer: Dr. Sinan Majid Course Title: microprocessors 4 th year Lecture 5 & 6 Minimization with Karnaugh Maps Karnaugh maps lternate way of representing oolean function ll rows
Digital Techniques Lecture 1 1 st Class Digital Techniques Digital Computer and Digital System: Digital computer is a part of digital system, it based on binary system. A block diagram of digital computer
L T P C R.M.D. ENGINEERING COLLEGE R.S.M. Nagar, Kavaraipettai- 601206 DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC8392 UNIT - I 3 0 0 3 OBJECTIVES: To present the Digital fundamentals, Boolean
Gate-Level Minimization BME28 Logic Circuits Yalçın İŞLER firstname.lastname@example.org http://me.islerya.com Complexity of Digital Circuits Directly related to the complexity of the algebraic expression we use to
CprE 28: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Minimization CprE 28: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev Administrative
Objectives: 1. Design procedure. 2. undamental circuits. 1. Design procedure Design procedure has five steps: o Specification. o ormulation. o Optimization. o Technology mapping. o Verification. Specification:
Chapter 3 Gate-Level Minimization Introduction The Map Method Four-Variable Map Five-Variable Map Outlines Product of Sums Simplification Don t-care Conditions NAND and NOR Implementation Other Two-Level
Boolean relationships on Venn Diagrams The fourth example has A partially overlapping B. Though, we will first look at the whole of all hatched area below, then later only the overlapping region. Let's
LECTURE 4 Logic Design LOGIC DESIGN The language of the machine is binary that is, sequences of 1 s and 0 s. But why? At the hardware level, computers are streams of signals. These signals only have two
oolean lgebra oolean logic ased on symbolic logic, designed by George oole oolean variables take values as or. oolean expressions created from: NOT, ND, OR Introduction to Computer ung-u Chuang with slides
Digital Circuits ECS 37 Dr. Prapun Suksompong email@example.com Lecture 7 Office Hours: KD 36-7 Monday 9:-:3, :3-3:3 Tuesday :3-:3 Announcement HW2 posted on the course web site Chapter 4: Write down
Gate Level Minimization Map Method Complexity of hardware implementation is directly related to the complexity of the algebraic expression Truth table representation of a function is unique Algebraically
Midterm Exam Review CS 2420 :: Fall 2016 Molly O'Neil Midterm Exam Thursday, October 20 In class, pencil & paper exam Closed book, closed notes, no cell phones or calculators, clean desk 20% of your final
1 Module -7 Karnaugh Maps 1. Introduction 2. Canonical and Standard forms 2.1 Minterms 2.2 Maxterms 2.3 Canonical Sum of Product or Sum-of-Minterms (SOM) 2.4 Canonical product of sum or Product-of-Maxterms(POM)
UNIT 2 BOOLEN LGEBR Spring 2 2 Contents Introduction Basic operations Boolean expressions and truth tables Theorems and laws Basic theorems Commutative, associative, and distributive laws Simplification
ll the Gates There are only 6 possible 2-input gates Let s examine all of them. Some we already know, others are just silly. Do we really need all of these gates? How many of these gates can be implemented
Points ddressed in this Lecture Lecture 6: Signed Numbers rithmetic Circuits Professor Peter Cheung Department of EEE, Imperial College London (Floyd 2.5-2.7, 6.1-6.7) (Tocci 6.1-6.11, 9.1-9.2, 9.4) Representing
Homework Update on website issue Reading: hapter 7 Homework: All exercises at end of hapter 7 Due 9/26 opyright c 22 28 UMaine omputer Science Department / 2 OS 4: Foundations of omputer Science Karnaugh
CSE4: Components and Design Techniques for Digital Systems Specifying logic functions Instructor: Mohsen Imani Slides from: Prof.Tajana Simunic and Dr.Pietro Mercati We have seen various concepts: Last
LAB #1 BASIC DIGITAL CIRCUIT OBJECTIVES 1. To study the operation of basic logic gates. 2. To build a logic circuit from Boolean expressions. 3. To introduce some basic concepts and laboratory techniques
Gate-Level Minimization section instructor: Ufuk Çelikcan Compleity of Digital Circuits Directly related to the compleity of the algebraic epression we use to build the circuit. Truth table may lead to
Lecture (4) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee ١ Dr. Ahmed ElShafee, ACU : Spring 26, Logic Design Boolean algebra properties basic assumptions and properties: Closure law A set S is
Lecture (4) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee Boolean algebra properties basic assumptions and properties: Closure law A set S is closed with respect to a binary operator, for every
Pearson Education Limited Edinburgh Gate Harlow Essex M2 2JE England and Associated ompanies throughout the world Visit us on the World Wide Web at: www.pearsoned.co.uk Pearson Education Limited 24 All
Binary logic Binary logic deals with variables like (a, b, c,, x, y) that take on two discrete values (, ) and with operations that assume logic meaning ( AND, OR, NOT) Truth table is a table of all possible
EE 200: Digital Logic Circuit Design Dr Radwan E Abdel-Aal, COE Unit 6.Random Access Memory (RAM) Chapter 3 Combinational Logic Design 2. Logic Logic and Computer Design Fundamentals Part Implementation
Digital Logic Lecture 7 Gate Level Minimization By Ghada Al-Mashaqbeh The Hashemite University Computer Engineering Department Outline Introduction. K-map principles. Simplification using K-maps. Don t-care
University of Illinois at Urbana-Champaign Dept. of Electrical and Computer Engineering ECE 120: Introduction to Computing Boolean Properties and Optimization The Dual Form Swaps 0/1 and AND/OR Boolean
DIGITAL CIRCUIT LOGIC UNIT 7: MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES 1 iclicker Question 13 Considering the K-Map, f can be simplified as (2 minutes): A) f = b c + a b c B) f = ab d + a b d AB CD
Points missed: Student's Name: Total score: /100 points East Tennessee State University Department of Computer and Information Sciences CSCI 2150 (Tarnoff) Computer Organization TEST 1 for Spring Semester,
Assignment No. 1 1. State advantages of digital system over analog system. 2. Convert following numbers a. (138.56) 10 = (?) 2 = (?) 8 = (?) 16 b. (1110011.011) 2 = (?) 10 = (?) 8 = (?) 16 c. (3004.06)
Points missed: Student's Name: Total score: / points East Tennessee State University Department of Computer and Information Sciences CSCI 25 (Tarnoff) Computer Organization TEST 2 for Fall Semester, 25
Standard Forms of Expression Minterms and Maxterms Standard forms of expressions We can write expressions in many ways, but some ways are more useful than others A sum of products (SOP) expression contains:
4-5 Karnaugh Map Method A graphical method of simplifying logic equations or truth tables. Also called a K map. Theoretically can be used for any number of input variables, but practically limited to 5
EE210: Switching Systems Lecture 4: Implementation AND, OR, NOT Gates and Complement Prof. YingLi Tian Feb. 13, 2018 Department of Electrical Engineering The City College of New York The City University