Having read this workbook you should be able to: design a logic circuit from its Boolean equation or truth table.
|
|
- Quentin Ford
- 5 years ago
- Views:
Transcription
1 Objectives Having read this workbook you should be able to: analyse a given logic circuit by deriving its oolean equation and completing its truth table. design a logic circuit from its oolean equation or truth table. draw logic diagrams showing how NND gates can be used to make up NOT, ND, OR, NND and EXOR gates. reduce a given logic circuit down to NND gates only. 1
2 OOLEN EUTION FOR LOGIC CIRCUIT In Chapter 1 you discovered how symbols (operators) are used to represent the function of NOT, ND, OR, NND, NOR and EXOR logic gates. a dot. is used as an operator to represent ND, a plus sign + is used to represent OR, a bar, on top of the variables, is used to represent NOT, a + is used to represent exclusive OR (EXOR). The following table should remind you of how the operators are used to represent the functions of logic gates. GTE SYMOL OOLEN EUTION NOT = ND =. OR = + NND =. NOR = + EXOR = + EXNOR = + 2 Logic gates are often combined together to provide a logic function not available from a single type of gate.
3 NLYSING LOGIC CIRCUIT EXMPLE 1 We shall now consider examples of how oolean algebra can be used to analyse a given system. Full guidance is provided with the first example. Derive an equation, and form a truth table, representing the logic function of the following circuit. = +.. We start by following the inputs to where they enter gates and labelling these points. Provided all input points are labelled, we can use oolean notation to label the output. The output of the NOT gate is labelled, and the output of the ND gate labelled.. These can now be followed through to the OR gate. The OR gate has at one of its inputs and. at the other. The output of the OR gate is given by: = +. The oolean equations tells us that is at logic level 1 when: = 0 (the in the equation) OR when: = 1 ND = 1 (the. in the equation) We can now complete a truth table for the logic arrangement Covers situations where = Covers = 1 ND = 1 Later on you will see how the rules of oolean algebra can be used to simplify a circuit i.e. how to provide the same function using fewer gates. 3
4 EXMPLE 2 Derive the oolean equation and form a truth table which represents the function of the following logic system.. C (a) Try using oolean algebra to label your way from the inputs to the output. You should be able to show that the output can be represented in terms of the inputs, and C by the equation: = C The equation tells us that the output will be at logic level 1 when: = 0 ND = 1 (the. in the equation) OR when: = 1 ND = 0 (the. in the equation) OR when: = 1 ND = 1 (the. in the equation) OR when: C = 1 (b) Now place 1's in the output column of the following truth table, where required, for each of the four conditions. The. term has been done for you. 1 has been inserted in the output column where ( = 0, = 1, C = 0) and where ( = 0, = 1, C = 1) 4
5 s you work your way through the conditions producing an output at logic level 1, you will often find that the previous condition has already filled the space. This suggests that there is an overlap between the conditions and that the system can be simplified. Simplifying techniques will be covered in Chapters 3 and 4. C Cover (c) Fill any empty output boxes with a 0. If you have successfully completed the task there should only be one box with a 0 in it. Study the truth table carefully and try to decide what single 3-input logic gate could be used to produce the same function. complete solution is provided on page 12 of this chapter. 5
6 DESIGNING LOGIC CIRCUITS The following sequence illustrates the steps involved in designing a logic circuit. form a truth table representing the required logic function; derive the oolean equation from the truth table; if possible, simplify the equation; draw a logic diagram showing how the circuit could be made up from ND, OR and NOT gates; reduce the system down to NND gates only; Let us now consider these steps in some detail. FROM TRUTH TLE TO OOLEN EUTION Suppose that the function of a logic circuit could be represented by the following truth table. C C C C The oolean equation covers situations when the output is at logic level 1. In this case, output is a 1 when: = 1, ND = 0, ND C = 0 (represented by..c) OR when: = 1, ND = 1, ND C = 0 (represented by..c) OR when: = 1, ND = 1, ND C = 1 (represented by..c) 6
7 The full oolean equation for the circuit becomes: =..C +..C +..C It will be shown in the next Chapter that the equation simplifies down to: =.( + C) FROM OOLEN EUTION TO LOGIC CIRCUIT DIGRM The oolean equation for the circuit is: =.( + C) We start by drawing a logic circuit diagram for the term inside the bracket. This part of the circuit must produce an output at logic level 1 when: is at logic level 1, OR when: C is NOT at logic level 1. suitable arrangement is shown below. C C ( + C) To complete the equation, ( + C) is NDed with input. The complete circuit diagram becomes: C Note that the complete contents of the brackets are NDed with input. 7
8 SOLUTION FOR EXMPLE 2 (Page 6) C.. C C rrangement forms a 3-input OR gate. 8
9 Student ssessment The following equations are used with questions 1 and 2. =. + C =. + C C =. + C D =. + C 1. C Which oolean equation represents the function of the logic circuit shown above? 2. C Which oolean equation represents the function of the logic circuit shown above? 9
10 The following truth tables are used with questions 3 and 4. C C C C D C Which truth table represents the function of the logic circuit in question 1? 4. Which truth table represents the function of the logic circuit in question 2? The following equations are used with questions =. =. +. C =. D = + E = + F =
11 5. Which equation applies to this truth table? Which equation applies to this truth table? Which equation applies to this truth table? Which equation applies to this truth table? Which equation applies to this truth table? Which equation applies to this truth table?
12 Exercise Objectives Having complete this Exercise you should be able to: set up a logic circuit and complete its truth table. construct 2-input ND, OR, NOR and EXOR gates using only NND gates. reduce a logic arrangement made up of different gates down to NND gates only. 12
13 CTIVITY 1 1a. Set up the following logic gate arrangement: CTIVITY 2 1b. Use the arrangement to enable you to complete the truth table. 2a. Set up the following logic gate arrangements: b. Use the arrangement to enable you to complete the truth table
14 CTIVITY 3 Let us now consider how we can make other types of gates from NND gates only. 3a. Set up the following arrangements, in turn and complete their truth table. 3b. INPUT 0 1 OUTPUT 3c d
15 3e f
CHAPTER 3 LOGIC GATES & BOOLEAN ALGEBRA
CHPTER 3 LOGIC GTES & OOLEN LGER C H P T E R O U T C O M E S Upon completion of this chapter, student should be able to: 1. Describe the basic logic gates operation 2. Construct the truth table for basic
More informationNew Students Day Activity
Course: S ELECTRONICS New Students Day ctivity Introduction: In S Level Electronics you need to gain an understanding of the electronic circuits so that you can then start to design your own circuits like
More informationDigital electronic systems are designed to process voltage signals which change quickly between two levels. Low time.
DIGITL ELECTRONIC SYSTEMS Digital electronic systems are designed to process voltage signals which change quickly between two levels. High Voltage Low time Fig. 1 digital signal LOGIC GTES The TTL digital
More informationIntroduction. 1854: Logical algebra was published by George Boole known today as Boolean Algebra
oolean lgebra Introduction 1854: Logical algebra was published by George oole known today as oolean lgebra It s a convenient way and systematic way of expressing and analyzing the operation of logic circuits.
More informationTheorem/Law/Axioms Over (.) Over (+)
material prepared by: MUKESH OHR Follow me on F : http://www.facebook.com/mukesh.sirji4u OOLEN LGER oolean lgebra is a set of rules, laws and theorems by which logical operations can be mathematically
More informationChapter 7 Combinational Logic Networks
Overview Design Example Design Example 2 Universal Gates NND-NND Networks NND Chips Chapter 7 Combinational Logic Networks SKEE223 Digital Electronics Mun im/rif/izam KE, Universiti Teknologi Malaysia
More informationLOGIC GATES (PRACTICE PROBLEMS)
LOGIC GTES (PRCTICE PROLEMS) Key points and summary First set of problems from Q. Nos. 1 to 9 are based on the logic gates like ND, OR, NOT, NND & NOR etc. First four problems are basic in nature. Problems
More informationEGC221: Digital Logic Lab
Division of Engineering Programs EGC221: Digital Logic Lab Experiment #1 Basic Logic Gate Simulation Student s Name: Student s Name: Reg. no.: Reg. no.: Semester: Fall 2016 Date: 07 September 2016 Assessment:
More informationPart 5: Digital Circuits
Characteristics of any number system are: Part 5: Digital Circuits 5.: Number Systems & Code Conversions. ase or radix is equal to the number of possible symbols in the system 2. The largest value of digit
More informationLogic Gates and Boolean Algebra
Logic Gates and oolean lgebra The ridge etween Symbolic Logic nd Electronic Digital Computing Compiled y: Muzammil hmad Khan mukhan@ssuet.edu.pk asic Logic Functions and or nand nor xor xnor not 2 Logic
More informationExperiment 7: Magnitude comparators
Module: Logic Design Lab Name:... University no:.. Group no: Lab Partner Name: Experiment 7: Magnitude comparators Mr. Mohamed El-Saied Objective: Realization of -bit comparator using logic gates. Realization
More informationDigital Fundamentals
Digital Fundamentals Tenth Edition Floyd hapter 5 Modified by Yuttapong Jiraraksopakun Floyd, Digital Fundamentals, 10 th 2008 Pearson Education ENE, KMUTT ed 2009 2009 Pearson Education, Upper Saddle
More informationChapter 1: Logic systems
Chapter 1: Logic systems 1: Logic gates Learning Objectives: At the end of this topic you should be able to: identify the symbols and truth tables for the following logic gates: NOT AND NAND OR NOR XOR
More informationLecture 10: 09//25/03 A.R. Neureuther Version Date 09/14/03 EECS 42 Introduction to Digital Electronics Andrew R. Neureuther
EECS 42 Intro. Digital Electronics Fall 23 Lecture : 9//25/3.R. Neureuther Version Date 9/4/3 EECS 42 Introduction to Digital Electronics ndrew R. Neureuther Lecture # Prof. King: asic Digital locks 2
More informationDigital Logic (2) Boolean Algebra
Digital Logic (2) Boolean Algebra Boolean algebra is the mathematics of digital systems. It was developed in 1850 s by George Boole. We will use Boolean algebra to minimize logic expressions. Karnaugh
More informationDigital Circuits. 1. Inputs & Outputs are quantized at two levels. 2. Binary arithmetic, only digits are 0 & 1. Position indicates power of 2.
Digital Circuits 1. Inputs & Outputs are quantized at two levels. 2. inary arithmetic, only digits are 0 & 1. Position indicates power of 2. 11001 = 2 4 + 2 3 + 0 + 0 +2 0 16 + 8 + 0 + 0 + 1 = 25 Digital
More informationMealy & Moore Machines
Mealy & Moore Machines Moore Machine is a finite-state machine whose output values are determined solely by its current state and can be defined as six elements (S, S 0, Σ, Λ, T, G), consisting of the
More informationBoolean algebra. Examples of these individual laws of Boolean, rules and theorems for Boolean algebra are given in the following table.
The Laws of Boolean Boolean algebra As well as the logic symbols 0 and 1 being used to represent a digital input or output, we can also use them as constants for a permanently Open or Closed circuit or
More informationAppendix A: Logic Gates and Boolean Algebra Used in the Book
ppendix : Logic Gates and oolean lgebra Used in the ook This appendix provides a brief set of notes on oolean algebra laws and their use. It is assumed that the reader already has knowledge of these laws.
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 informationENGR 303 Introduction to Logic Design Lecture 3. Dr. Chuck Brown Engineering and Computer Information Science Folsom Lake College
Introduction to Logic Design Lecture 3 Dr. Chuck rown Engineering and Computer Information Science Folsom Lake College Outline for Todays Lecture Logic Circuits SOP / POS oolean Theorems DeMorgan s Theorem
More informationA B is shaded A B A B
NION: Let and be subsets of a universal set. The union of sets and is the set of all elements in that belong to or to or to both, and is denoted. Symbolically: = {x x or x } EMMPLE: Let = {a, b, c, d,
More informationIntroduction to Karnaugh Maps
Introduction to Karnaugh Maps Review So far, you (the students) have been introduced to truth tables, and how to derive a Boolean circuit from them. We will do an example. Consider the truth table for
More informationBoolean Algebra & Digital Logic
Boolean Algebra & Digital Logic Boolean algebra was developed by the Englishman George Boole, who published the basic principles in the 1854 treatise An Investigation of the Laws of Thought on Which to
More informationSIMPLIFICATION OF BOOLEAN ALGEBRA. Presented By: Ms. Poonam Anand
SIMPLIFITION OF OOLEN LGER Presented y: Ms. Poonam nand SIMPLIFITION USING OOLEN LGER simplified oolean expression uses the fewest gates possible to implement a given expression. ()() SIMPLIFITION USING
More information1.10 (a) Function of AND, OR, NOT, NAND & NOR Logic gates and their input/output.
Chapter 1.10 Logic Gates 1.10 (a) Function of AND, OR, NOT, NAND & NOR Logic gates and their input/output. Microprocessors are the central hardware that runs computers. There are several components that
More informationBoole Algebra and Logic Series
S1 Teknik Telekomunikasi Fakultas Teknik Elektro oole lgebra and Logic Series 2016/2017 CLO1-Week2-asic Logic Operation and Logic Gate Outline Understand the basic theory of oolean Understand the basic
More information12/31/2010. Overview. 05-Boolean Algebra Part 3 Text: Unit 3, 7. DeMorgan s Law. Example. Example. DeMorgan s Law
Overview 05-oolean lgebra Part 3 Text: Unit 3, 7 EEGR/ISS 201 Digital Operations and omputations Winter 2011 DeMorgan s Laws lgebraic Simplifications Exclusive-OR and Equivalence Functionally omplete NND-NOR
More informationLOGIC GATES A Y=A+B. Logic symbol of OR gate B The Boolean expression of OR gate is Y = A + B, read as Y equals A 'OR' B.
LOGIC GTS J-Physics INTRODUCTION : logic gate is a digital circuit which is based on certain logical relationship between the input and the output voltages of the circuit. The logic gates are built using
More informationLecture 2. Notes. Notes. Notes. Boolean algebra and optimizing logic functions. BTF Electronics Fundamentals August 2014
Lecture 2 Electronics ndreas Electronics oolean algebra and optimizing logic functions TF322 - Electronics Fundamentals ugust 24 Exercise ndreas ern University of pplied Sciences Rev. 946f32 2. of oolean
More informationChapter 5. Digital systems. 5.1 Boolean algebra Negation, conjunction and disjunction
Chapter 5 igital systems digital system is any machine that processes information encoded in the form of digits. Modern digital systems use binary digits, encoded as voltage levels. Two voltage levels,
More informationLecture 1. Notes. Notes. Notes. Introduction. Introduction digital logic February Bern University of Applied Sciences
Output voltage Input voltage 3.3V Digital operation (Switch) Lecture digital logic February 26 ern University of pplied Sciences Digital vs nalog Logic =? lgebra Logic = lgebra oolean lgebra Exercise Rev.
More informationStudents should be able to (a) produce a truth table from a given logic diagram
Truth tables Teacher s Notes Lesson Plan Length 60 mins Specification Link 2.1.2/f inary logic Learning objective Students should be able to (a) produce a truth table from a given logic diagram Time (min)
More informationCombinational logic systems
Combinational logic systems Learners should be able to: (a) recognise 1/0 as two-state logic levels (b) identify and use NOT gates and 2-input AND, OR, NAND and NOR gates, singly and in combination (c)
More informationChapter 2. Digital Logic Basics
Chapter 2 Digital Logic Basics 1 2 Chapter 2 2 1 Implementation using NND gates: We can write the XOR logical expression B + B using double negation as B+ B = B+B = B B From this logical expression, we
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 informationGoals for Lecture. Binary Logic and Gates (MK 2.1) Binary Variables. Notation Examples. Logical Operations
Introduction to Electrical Engineering, II LETURE NOTES #2 Instructor: Email: Telephone: Office: ndrew. Kahng (lecture) abk@ucsd.edu 858-822-4884 office 3802 P&M lass Website: http://vlsicad.ucsd.edu/courses/ece20b/wi04/
More informationCOMP2611: Computer Organization. Introduction to Digital Logic
1 OMP2611: omputer Organization ombinational Logic OMP2611 Fall 2015 asics of Logic ircuits 2 its are the basis for binary number representation in digital computers ombining bits into patterns following
More informationProve that if not fat and not triangle necessarily means not green then green must be fat or triangle (or both).
hapter : oolean lgebra.) Definition of oolean lgebra The oolean algebra is named after George ool who developed this algebra (854) in order to analyze logical problems. n example to such problem is: Prove
More informationSimplifying Logic Circuits with Karnaugh Maps
Simplifying Logic Circuits with Karnaugh Maps The circuit at the top right is the logic equivalent of the Boolean expression: f = abc + abc + abc Now, as we have seen, this expression can be simplified
More informationLearning Objectives:
Learning Objectives: t the end of this topic you will be able to; draw a block diagram showing how -type flip-flops can be connected to form a synchronous counter to meet a given specification; explain
More informationNumber System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary
Number System Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary BOOLEAN ALGEBRA BOOLEAN LOGIC OPERATIONS Logical AND Logical OR Logical COMPLEMENTATION
More informationWhy digital? Overview. Number Systems. Binary to Decimal conversion
Why digital? Overview It has the following advantages over analog. It can be processed and transmitted efficiently and reliably. It can be stored and retrieved with greater accuracy. Noise level does not
More informationLecture 9: Digital Electronics
Introduction: We can classify the building blocks of a circuit or system as being either analog or digital in nature. If we focus on voltage as the circuit parameter of interest: nalog: The voltage can
More information1 Boolean Algebra Simplification
cs281: Computer Organization Lab3 Prelab Our objective in this prelab is to lay the groundwork for simplifying boolean expressions in order to minimize the complexity of the resultant digital logic circuit.
More informationPossible logic functions of two variables
ombinational logic asic logic oolean algebra, proofs by re-writing, proofs by perfect induction logic functions, truth tables, and switches NOT, ND, OR, NND, NOR, OR,..., minimal set Logic realization
More informationGates. Quiz 1 will cover up to and including this lecture. The book says something about NAND... maybe an in-law. Is he talking about BILL??? 6.
Gates Is he talking about ILL??? The book says something about NND... maybe an in-law. WRD & HLSTED 6.4 NERD KIT Quiz will cover up to and including this lecture 6.4 - Fall 22 9/7/2 L4 - Gates Quick Review
More informationGates and Flip-Flops
Gates and Flip-Flops Chris Kervick (11355511) With Evan Sheridan and Tom Power December 2012 On a scale of 1 to 10, how likely is it that this question is using binary?...4? What s a 4? Abstract The operation
More informationBasic Gate Repertoire
asic Gate Repertoire re we sure we have all the gates we need? Just how many two-input gates are there? ND OR NND NOR SURGE Hmmmm all of these have 2-inputs (no surprise) each with 4 combinations, giving
More informationDigital Electronics. Delay Max. FF Rate Power/Gate High Low (ns) (MHz) (mw) (V) (V) Standard TTL (7400)
P57/67 Lec9, P Digital Electronics Introduction: In electronics we can classify the building blocks of a circuit or system as being either analog or digital in nature. If we focus on voltage as the circuit
More informationDepartment of Electrical and Computer Engineering University of Wisconsin - Madison. ECE/CS 352 Digital System Fundamentals.
Last (family) name: First (given) name: Student I.D. #: Circle section: Lipasti Kim Department of Electrical and Computer Engineering University of Wisconsin - Madison ECE/CS 352 Digital System Fundamentals
More informationDigital Logic Design ABC. Representing Logic Operations. Dr. Kenneth Wong. Determining output level from a diagram. Laws of Boolean Algebra
Digital Logic Design ENGG1015 1 st Semester, 2011 Representing Logic Operations Each function can be represented equivalently in 3 ways: Truth table Boolean logic expression Schematics Truth Table Dr.
More informationXOR - XNOR Gates. The graphic symbol and truth table of XOR gate is shown in the figure.
XOR - XNOR Gates Lesson Objectives: In addition to AND, OR, NOT, NAND and NOR gates, exclusive-or (XOR) and exclusive-nor (XNOR) gates are also used in the design of digital circuits. These have special
More informationDIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA (CONT.)
DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA (CONT.) 1 Learning Objectives 1. Apply the laws and theorems of Boolean algebra to to the manipulation of algebraic expressions to simplifying an expression, finding
More informationProf.Manoj Kavedia 2 Algebra
` Logic Gates and Boolean 2 Algebra Chapter-2 (Hours:06 Marks:14 )( 12064 Digital Techniques) Logic Gates And Boolean Algebra 2.1 Logical symbol, logical expression and truth table of AND, OR, NOT, NAND,
More informationCombinational logic. Possible logic functions of two variables. Minimal set of functions. Cost of different logic functions.
Combinational logic Possible logic functions of two variables Logic functions, truth tables, and switches NOT, ND, OR, NND, NOR, OR,... Minimal set xioms and theorems of oolean algebra Proofs by re-writing
More informationDesigning Information Devices and Systems II Fall 2017 Miki Lustig and Michel Maharbiz Homework 1. This homework is due September 5, 2017, at 11:59AM.
EECS 16 Designing Information Devices and Systems II Fall 017 Miki Lustig and Michel Maharbiz Homework 1 This homework is due September 5, 017, at 11:59M. 1. Fundamental Theorem of Solutions to Differential
More informationElectronics. Overview. Introducction to Synthetic Biology
Electronics Introducction to Synthetic iology E Navarro Montagud P Fernandez de Cordoba JF Urchueguía Overview Introduction oolean algebras Logical gates Representation of boolean functions Karnaugh maps
More information2.4. Characterising Functions. Introduction. Prerequisites. Learning Outcomes
Characterising Functions 2.4 Introduction There are a number of different terms used to describe the ways in which functions behave. In this Section we explain some of these terms and illustrate their
More informationLearning Objectives. Boolean Algebra. In this chapter you will learn about:
Ref. Page Slide /78 Learning Objectives In this chapter you will learn about: oolean algebra Fundamental concepts and basic laws of oolean algebra oolean function and minimization Logic gates Logic circuits
More informationDigital Design 2. Logic Gates and Boolean Algebra
Digital Design 2. Logic Gates and oolean lgebra József Sütő ssistant Lecturer References: [1] D.M. Harris, S.L. Harris, Digital Design and Computer rchitecture, 2nd ed., Elsevier, 213. [2] T.L. Floyd,
More informationWheels Radius / Distance Traveled
Mechanics Teacher Note to the teacher On these pages, students will learn about the relationships between wheel radius, diameter, circumference, revolutions and distance. Students will use formulas relating
More informationFrequency and Histograms
Warm Up Lesson Presentation Lesson Quiz Algebra 1 Create stem-and-leaf plots. Objectives Create frequency tables and histograms. Vocabulary stem-and-leaf plot frequency frequency table histogram cumulative
More informationA linear equation in two variables is generally written as follows equation in three variables can be written as
System of Equations A system of equations is a set of equations considered simultaneously. In this course, we will discuss systems of equation in two or three variables either linear or quadratic or a
More informationPart 1: You are given the following system of two equations: x + 2y = 16 3x 4y = 2
Solving Systems of Equations Algebraically Teacher Notes Comment: As students solve equations throughout this task, have them continue to explain each step using properties of operations or properties
More informationCSE 140 Midterm I - Solution
CSE 140 Midterm I - Solution 1. Answer the following questions given the logic circuit below. (15 points) a. (5 points) How many CMOS transistors does the given (unsimplified) circuit have. b. (6 points)
More informationEE40 Lec 15. Logic Synthesis and Sequential Logic Circuits
EE40 Lec 15 Logic Synthesis and Sequential Logic Circuits Prof. Nathan Cheung 10/20/2009 Reading: Hambley Chapters 7.4-7.6 Karnaugh Maps: Read following before reading textbook http://www.facstaff.bucknell.edu/mastascu/elessonshtml/logic/logic3.html
More informationBoolean Algebra & Logic Gates. By : Ali Mustafa
Boolean Algebra & Logic Gates By : Ali Mustafa Digital Logic Gates There are three fundamental logical operations, from which all other functions, no matter how complex, can be derived. These Basic functions
More informationBoolean Logic Prof. James L. Frankel Harvard University. Version of 3:20 PM 29-Aug-2017 Copyright 2017, 2016 James L. Frankel. All rights reserved.
Boolean Logic Prof. James L. Frankel Harvard University Version of 3:20 PM 29-Aug-2017 Copyright 2017, 2016 James L. Frankel. All rights reserved. Logic Levels Logic 0 Also called GND Low Off False Logic
More informationLecture 3. Title goes here 1. level Networks. Boolean Algebra and Multi-level. level. level. level. level
Lecture 3 Dr Richard Reilly Dept. of Electronic & Electrical Engineering Room 53, Engineering uilding oolean lgebra and Multi- oolean algebra George oole, little formal education yet was a brilliant scholar.
More informationCombinational Logic. By : Ali Mustafa
Combinational Logic By : Ali Mustafa Contents Adder Subtractor Multiplier Comparator Decoder Encoder Multiplexer How to Analyze any combinational circuit like this? Analysis Procedure To obtain the output
More informationEureka Lessons for 6th Grade Unit FIVE ~ Equations & Inequalities
Eureka Lessons for 6th Grade Unit FIVE ~ Equations & Inequalities These 2 lessons can easily be taught in 2 class periods. If you like these lessons, please consider using other Eureka lessons as well.
More informationExercise booklet - Logic
Name: Class: Date:......... Exercise booklet Logic BCD Counter Worksheet with excercises and repetitive tasks for students and learners Find the seven logic gates in the puzzle. The words can be hidden
More informationProblem Set 4 Solutions
SE 26 igital omputers: Organization and Logical esign Jon Turner Problem Set 4 Solutions 1. Find a minimal logic expression for the NN/NOR circuit shown below. The circuit implements the expression ((()
More informationLogic. Basic Logic Functions. Switches in series (AND) Truth Tables. Switches in Parallel (OR) Alternative view for OR
TOPIS: Logic Logic Expressions Logic Gates Simplifying Logic Expressions Sequential Logic (Logic with a Memory) George oole (85-864), English mathematician, oolean logic used in digital computers since
More informationUSING THE QUADRATIC FORMULA and 9.1.3
Chapter 9 USING THE QUADRATIC FORMULA 9.1.2 and 9.1.3 When a quadratic equation is not factorable, another method is needed to solve for x. The Quadratic Formula can be used to calculate the roots of a
More informationChapter 3 Combinational Logic Design
Logic and Computer Design Fundamentals Chapter 3 Combinational Logic Design Part 1- Implementation Technology and Logic Design Overview Part 1-Implementation Technology and Logic Design Design Concepts
More informationUNIVERSITY OF CALIFORNIA College of Engineering Department of Electrical Engineering and Computer Sciences. Professor Oldham Fall 1999
UNIVERSITY OF CLIFORNI College of Engineering Department of Electrical Engineering and Computer Sciences Professor Oldham Fall 1999 EECS 40 FINL EXM 13 December 1999 Name: Last, First Student ID: T: Kusuma
More informationBoolean Algebra. Boolean Variables, Functions. NOT operation. AND operation. AND operation (cont). OR operation
oolean lgebra asic mathematics for the study of logic design is oolean lgebra asic laws of oolean lgebra will be implemented as switching devices called logic gates. Networks of Logic gates allow us to
More informationUnit II Chapter 4:- Digital Logic Contents 4.1 Introduction... 4
Unit II Chapter 4:- Digital Logic Contents 4.1 Introduction... 4 4.1.1 Signal... 4 4.1.2 Comparison of Analog and Digital Signal... 7 4.2 Number Systems... 7 4.2.1 Decimal Number System... 7 4.2.2 Binary
More informationApplying Mathematical Processes. Symmetry. Resources. The Clothworkers Foundation
Symmetry Applying Mathematical Processes In this investigation pupils make different symmetrical shapes, using one or m ore of three given shapes. Suitability Pupils working in pairs or small groups Time
More informationBoolean Algebra and Digital Logic
All modern digital computers are dependent on circuits that implement Boolean functions. We shall discuss two classes of such circuits: Combinational and Sequential. The difference between the two types
More information4 Switching Algebra 4.1 Axioms; Signals and Switching Algebra
4 Switching Algebra 4.1 Axioms; Signals and Switching Algebra To design a digital circuit that will perform a required function, it is necessary to manipulate and combine the various input signals in certain
More informationAdequate set of connectives, logic gates and circuits
Adequate set of connectives, logic gates and circuits Lila Kari University of Waterloo Adequate set of connectives, logic gates and circuits CS245, Logic and Computation 1 / 59 Connectives We have mentioned
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 informationCHAPTER 7 MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES
CHAPTER 7 MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES This chapter in the book includes: Objectives Study Guide 7.1 Multi-Level Gate Circuits 7.2 NAND and NOR Gates 7.3 Design of Two-Level Circuits Using
More informationCSE370 HW3 Solutions (Winter 2010)
CSE370 HW3 Solutions (Winter 2010) 1. CL2e, 4.9 We are asked to implement the function f(a,,c,,e) = A + C + + + CE using the smallest possible multiplexer. We can t use any extra gates or the complement
More informationAlan Bundy. Automated Reasoning LTL Model Checking
Automated Reasoning LTL Model Checking Alan Bundy Lecture 9, page 1 Introduction So far we have looked at theorem proving Powerful, especially where good sets of rewrite rules or decision procedures have
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 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 informationBOOLEAN ALGEBRA INVESTIGATIONS
OOLEN LGER INVESTIGTIONS NMES: dapted from http://educ.queensu.ca/~compsci/resources/oollogic/assocdistrib.html 1 1. If one of the inputs is always 1 (true), what is the output? 1 Therefore, + 1 = 1 0
More informationObjectives: Review open, closed, and mixed intervals, and begin discussion of graphing points in the xyplane. Interval notation
MA 0090 Section 18 - Interval Notation and Graphing Points Objectives: Review open, closed, and mixed intervals, and begin discussion of graphing points in the xyplane. Interval notation Last time, we
More informationThe course web site s notes entitled Switches, Gates and Circuits which can be found at will be useful to you throughout the lab.
Circuits Lab Names: Objectives Learn how circuits work, different properties of circuits, and how to derive truth tables, circuits from functions and simply circuits using Boolean circuit equivalence..
More informationMath 1 Variable Manipulation Part 5 Absolute Value & Inequalities
Math 1 Variable Manipulation Part 5 Absolute Value & Inequalities 1 ABSOLUTE VALUE REVIEW Absolute value is a measure of distance; how far a number is from zero: 6 is 6 away from zero, and " 6" is also
More informationCS61c: Representations of Combinational Logic Circuits
CS61c: Representations of Combinational Logic Circuits J. Wawrzynek March 5, 2003 1 Introduction Recall that synchronous systems are composed of two basic types of circuits, combination logic circuits,
More informationDivision Algorithm B1 Introduction to the Division Algorithm (Procedure) quotient remainder
A Survey of Divisibility Page 1 SECTION B Division Algorithm By the end of this section you will be able to apply the division algorithm or procedure Our aim in this section is to show that for any given
More information2 Truth Tables, Equivalences and the Contrapositive
2 Truth Tables, Equivalences and the Contrapositive 12 2 Truth Tables, Equivalences and the Contrapositive 2.1 Truth Tables In a mathematical system, true and false statements are the statements of the
More informationSchool of Computer Science and Electrical Engineering 28/05/01. Digital Circuits. Lecture 14. ENG1030 Electrical Physics and Electronics
Digital Circuits 1 Why are we studying digital So that one day you can design something which is better than the... circuits? 2 Why are we studying digital or something better than the... circuits? 3 Why
More informationContents. basic algebra. Learning outcomes. Time allocation. 1. Mathematical notation and symbols. 2. Indices. 3. Simplification and factorisation
basic algebra Contents. Mathematical notation and symbols 2. Indices 3. Simplification and factorisation 4. Arithmetic of algebraic fractions 5. Formulae and transposition Learning outcomes In this workbook
More informationAdditional Gates COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals
Additional Gates COE 202 Digital Logic Design Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals Presentation Outline Additional Gates and Symbols Universality of NAND and NOR gates NAND-NAND
More information