Boole Algebra and Logic Series

Similar documents
Digital Circuits. 1. Inputs & Outputs are quantized at two levels. 2. Binary arithmetic, only digits are 0 & 1. Position indicates power of 2.

Logic Gates and Boolean Algebra

Lecture 9: Digital Electronics

Digital- or Logic Circuits. Outline Logic Circuits. Logic Voltage Levels. Binary Representation

Digital Electronics. Delay Max. FF Rate Power/Gate High Low (ns) (MHz) (mw) (V) (V) Standard TTL (7400)

Boolean Algebra. Boolean Variables, Functions. NOT operation. AND operation. AND operation (cont). OR operation

Prove that if not fat and not triangle necessarily means not green then green must be fat or triangle (or both).

New Students Day Activity

Experiment 7: Magnitude comparators

Lab 3 Revisited. Zener diodes IAP 2008 Lecture 4 1

XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.

LOGIC 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.

CHAPTER 3 LOGIC GATES & BOOLEAN ALGEBRA

Gates and Flip-Flops

Digital electronic systems are designed to process voltage signals which change quickly between two levels. Low time.

Fundamentals of Digital Design

Binary addition (1-bit) P Q Y = P + Q Comments Carry = Carry = Carry = Carry = 1 P Q

Why digital? Overview. Number Systems. Binary to Decimal conversion

Lecture 10: 09//25/03 A.R. Neureuther Version Date 09/14/03 EECS 42 Introduction to Digital Electronics Andrew R. Neureuther

Section 1A. Introduction & Basic Principles. Engineering Areas

Boolean algebra. Examples of these individual laws of Boolean, rules and theorems for Boolean algebra are given in the following table.

Chapter 2. Digital Logic Basics

Digital Logic (2) Boolean Algebra

Digital Fundamentals

NTE74LS181 Integrated Circuit TTL Arithmetic Logic Unit/Function Generator

CHAPTER1: Digital Logic Circuits Combination Circuits

Lecture 3. Title goes here 1. level Networks. Boolean Algebra and Multi-level. level. level. level. level

Implementation of Boolean Logic by Digital Circuits

Appendix A: Digital Logic. Principles of Computer Architecture. Principles of Computer Architecture by M. Murdocca and V. Heuring

Theorem/Law/Axioms Over (.) Over (+)

Combinational logic. Possible logic functions of two variables. Minimal set of functions. Cost of different logic functions.

Logic. Basic Logic Functions. Switches in series (AND) Truth Tables. Switches in Parallel (OR) Alternative view for OR

Chapter 7 Combinational Logic Networks

Boolean Algebra. The Building Blocks of Digital Logic Design. Section. Section Overview. Binary Operations and Their Representation.

Additional Gates COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals

Part 5: Digital Circuits

12/31/2010. Overview. 05-Boolean Algebra Part 3 Text: Unit 3, 7. DeMorgan s Law. Example. Example. DeMorgan s Law

Looking at a two binary digit sum shows what we need to extend addition to multiple binary digits.

10/14/2009. Reading: Hambley Chapters

COMP2611: Computer Organization. Introduction to Digital Logic

XOR - XNOR Gates. The graphic symbol and truth table of XOR gate is shown in the figure.

Number System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary

Chapter 2 Boolean Algebra and Logic Gates

Review: Additional Boolean operations

CMSC 313 Lecture 16 Postulates & Theorems of Boolean Algebra Semiconductors CMOS Logic Gates

Realizing Logic in Hardware

COSC3330 Computer Architecture Lecture 2. Combinational Logic

Chapter 5. Digital systems. 5.1 Boolean algebra Negation, conjunction and disjunction

Binary addition example worked out

EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits)

Binary Logic and Gates

Lecture 1. Notes. Notes. Notes. Introduction. Introduction digital logic February Bern University of Applied Sciences

Introduction. 1854: Logical algebra was published by George Boole known today as Boolean Algebra

Outline. EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) Combinational Logic (CL) Defined

Chapter 2: Switching Algebra and Logic Circuits

Floating Point Representation and Digital Logic. Lecture 11 CS301

EC-121 Digital Logic Design

Lecture 21: Boolean Logic. To Wrap up AVR

University of Toronto Faculty of Applied Science and Engineering Department of Electrical and Computer Engineering Midterm Examination

Binary Logic and Gates. Our objective is to learn how to design digital circuits.

Algebraic Methods for the Analysis and Synthesis

Digital Techniques. Figure 1: Block diagram of digital computer. Processor or Arithmetic logic unit ALU. Control Unit. Storage or memory unit

Signals and Systems Digital Logic System

E&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev. Section 2: Boolean Algebra & Logic Gates

The Digital Logic Level

MM74C150 MM82C19 16-Line to 1-Line Multiplexer 3-STATE 16-Line to 1-Line Multiplexer

Chapter 2 (Lect 2) Canonical and Standard Forms. Standard Form. Other Logic Operators Logic Gates. Sum of Minterms Product of Maxterms

Learning Objectives. Boolean Algebra. In this chapter you will learn about:

Switches: basic element of physical implementations

Total Time = 90 Minutes, Total Marks = 50. Total /50 /10 /18

Computer Organization: Boolean Logic

Digital Design 2. Logic Gates and Boolean Algebra

Chapter 1: Logic systems

MM74C00 MM74C02 MM74C04 Quad 2-Input NAND Gate Quad 2-Input NOR Gate Hex Inverter

CSC9R6 Computer Design. Practical Digital Logic

Chap 2. Combinational Logic Circuits

Chapter 2: Boolean Algebra and Logic Gates

EECS Variable Logic Functions

Binary addition by hand. Adding two bits

Goals for Lecture. Binary Logic and Gates (MK 2.1) Binary Variables. Notation Examples. Logical Operations

Overview. Multiplexor. cs281: Introduction to Computer Systems Lab02 Basic Combinational Circuits: The Mux and the Adder

E40M. Binary Numbers. M. Horowitz, J. Plummer, R. Howe 1

SN74LS151D LOW POWER SCHOTTKY

211: Computer Architecture Summer 2016

Intro To Digital Logic

. T SHREE MAHAPRABHU PUBLIC SCHOOL & COLLEGE NOTES FOR BOARD EXAMINATION SUBJECT COMPUTER SCIENCE (Code: 083) Boolean Algebra

UNIT 8A Computer Circuitry: Layers of Abstraction. Boolean Logic & Truth Tables

Building a Computer Adder

Unit 8A Computer Organization. Boolean Logic and Gates

L2: Combinational Logic Design (Construction and Boolean Algebra)

Possible logic functions of two variables

NAND, NOR and XOR functions properties

Boolean Algebra & Digital Logic

DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA (CONT.)

Boolean Algebra, Gates and Circuits

Cs302 Quiz for MID TERM Exam Solved

NTE74HC173 Integrated Circuit TTL High Speed CMOS, 4 Bit D Type Flip Flop with 3 State Outputs

Logic Gate Level. Part 2

Digital Logic. Lecture 5 - Chapter 2. Outline. Other Logic Gates and their uses. Other Logic Operations. CS 2420 Husain Gholoom - lecturer Page 1

Computer organization

Transcription:

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 algebra law in oolean based on set theory Understand how to operate algebra law by using basic logic operation Knowing about asic Logic Gate to express asic Operation 2

oolean lgebra oolean algebra provides the operations and the rules for working with the set = {0, 1} Why only 0 and 1? oolean algebra is a mathematical system for the manipulation of variables that can have one of two values. In formal logic, these values are true and false. In digital systems, these values are on and off, 1 and 0, or high and low. 3

Operation Union / OR Set Operation - Union union is the set of all elements that are in, or, or both oolean Operation - OR The OR operator is the oolean sum Operator: + Logic Gate: Z S + 4

Operation Intersection / ND Set Operation - Intersect intersect is the set of all elements that are in both and. oolean Operation - ND The ND operator is also known as a oolean product Operator:. Logic Gate: Z S. 5

Operation Complement / NOT Set Operation - Complement complement, or not is the set of all elements not in S oolean Operation - NOT The NOT operation is most often designated by an overbar. It s also called inverter Operator: or Operator gate: Z 6

Operation Comp. Of Union / NOR Set Operation Is the complement of union S ( ) oolean Operator - NOR The NOR operation is combination of NOT and OR operation Operator : Logic Gate: Z + 7

Operation Comp. Of Intersect / NND Set Operation Is the complement of intersect S ( ). oolean Operation - NND The NND operation is combination of NOT and ND operation Operator : Logic Gate: Z 8

Operation Symmetric Differece / XOR Set Operation Sym. Diff. ( ) - ( ) S oolean Operation - XOR The output of the XOR operation is true only when the values of the inputs differ Operator: Logic Gate: Z 9

oolean Function oolean function has: t least one oolean variable, t least one oolean operator, and t least one input from the set {0,1}. It produces an output that is also a member of the set {0,1}. Now you know why the binary numbering system is so handy in digital systems Digital System is based on PULSE SIGNL, which valued 0 or 1 10

Combination in oolean Function Multiple Inputs? (>2 inputs) Multiple Inputs-Outputs? Multiple Gate/Operator? 11

Let s start from the simplest The three simplest gates are the ND, OR, and NOT gates. They correspond directly to their respective oolean operations, as you can see by their truth tables. 12

3.3 Logic Gates nother very useful gate is the exclusive OR (XOR) gate. The output of the XOR operation is true only when the values of the inputs differ. Note the special symbol for the XOR operation. 13

3.3 Logic Gates NND and NOR are two very important gates. Their symbols and truth tables are shown at the right. 14

ND and OR gate with 3 inputs C..C 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 C ++C 0 0 0 0 0 0 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 1 15 1 1

Example of Simple Series? 16

Truth table of the Series 0 0 1 1 1 0 0 1 1 0 0 1 1 0 0 1 0 1 1 1 0 0 0 1 17

Example in Implementation f f 0 0 0 0 0 0 1 0 1 1 1 0 1 0 1 1 1 0 0 0 18

Example in Implementation f f 19

Chips/ IC Digital Dasar To implement the logic diagram, we use the digital electronic series of logic IC/chips The kind of Logic Chip there are in market is IC TTL (Transistortransistor Logic) or MOS Those Chip are identified by part number or model number. IC type of standard digital series is started by number 74, 4, or 14. 7404 is an inverter 7408 is an ND 7432 is an OR 4011 is a NND 20

Chips asic Logic Chip is in DIP form (dual in package) with even pins. The usual form has 14-pins Pin 1 marked by dot or halfcircle The next pin is read by CCW way Pin 14 Pin 8 Pin 1 Pin 7 21

Chips Chips need voltage to be operated Vcc is used to interface of 5 volts and VCC pin usually placed at last number of pins (for DIP14 so, VCC is at pin-14) Ground Pin usually placed at last pin at same side of first pin (for DIP14, so GND is at no.7) Voltage Ground 22

Example of asic Logic IC TTL 74LS00 : Quad 2 input NND Gate 74LS08 : Quad 2 input ND Gate VCC 14 13 12 11 10 9 8 VCC 14 13 12 11 10 9 8 1 2 3 4 5 6 7 GND 1 2 3 4 5 6 7 GND 23

Example of asic Logic IC TTL 74LS02 : Quad 2 input NOR Gate 74LS32 : Quad 2 input OR Gate VCC 14 13 12 11 10 9 8 VCC 14 13 12 11 10 9 8 1 2 3 4 5 6 7 1 2 3 4 5 6 7 GND GND 24

Example of asic Logic IC TTL 74LS04 : Hex Inverter 74LS86 : Quad 2 input XOR Gate VCC 14 13 12 11 10 9 8 VCC 14 13 12 11 10 9 8 1 2 3 4 5 6 7 GND 1 2 3 4 5 6 7 GND 25

3.3 Logic Gates NND and NOR are known as universal gates because they are inexpensive to manufacture and any oolean function can be constructed using only NND or only NOR gates. 26

3.3 Logic Gates Gates can have multiple inputs and more than one output. second output can be provided for the complement of the operation. We ll see more of this later. 27

3.4 Digital Components The main thing to remember is that combinations of gates implement oolean functions. The circuit below implements the oolean function: We simplify our oolean expressions so that we can create simpler circuits. 28

3.5 Combinational Circuits Combinational logic circuits give us many useful devices. One of the simplest is the half adder, which finds the sum of two bits. We can gain some insight as to the construction of a half adder by looking at its truth table, shown at the right. 29

3.5 Combinational Circuits s we see, the sum can be found using the XOR operation and the carry using the ND operation. 30

3.5 Combinational Circuits We can change our half adder into to a full adder by including gates for processing the carry bit. The truth table for a full adder is shown at the right. 31

3.5 Combinational Circuits How can we change the half adder shown below to make it a full adder? 32

3.5 Combinational Circuits Here s our completed full adder. 33

34