COMPUTER ORGANIZATION AND ASSEMBLY LANGUAGE LECTURE BASED ON BOOLEAN EXPRESSIONS FOR COMBINATIONAL LOGIC SEPTEMBER 20, 2013.

Slides:

Advertisements

Similar presentations

INTRODUCTION LOGICAL OPERATIONS TRUTH TABLE AND RULES.

Advertisements

Logic Functions Logical functions can be expressed in several ways: ▫ Truth table ▫ Logical expressions ▫ Graphical form prepared by:eng.Rula Amjed.

1 Microprocessors vs. Custom Digital Circuits Why would anyone ever need to design new digital circuits? Microprocessors are readily available, inexpensive,

Cosc 2150: Computer Organization Chapter 3: Boolean Algebra and Digital Logic.

1 Boolean Algebra & Logic Design. 2 Developed by George Boole in the 1850s Mathematical theory of logic. Shannon was the first to use Boolean Algebra.

Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2 Dr. Costas Kyriacou and Dr. Konstantinos.

Computer Organization and Assembly Language: Chapter 7 The Karnaugh Maps September 30, 2013 By Engineer. Bilal Ahmad.

In this module you will learn: What the various logic gates do. How to represent logic gates on a circuit diagram. The truth tables for the logic gates.

Logic Gates Circuits to manipulate 0’s and 1’s. 0’s and 1’s used for numbers Also to make decisions within the computer. In that context, 1 corresponds.

XOR, XNOR, and Binary Adders

Digital Systems Presented by Prof Tim Johnson

Digital Logic Circuits – Chapter 1 Section 1-3, 1-2.

1 Why study Boolean Algebra? 4 It is highly desirable to find the simplest circuit implementation (logic) with the smallest number of gates or wires. We.

Data Manipulation CSCI130 Instructor: Dr. Imad Rahal.

Lecture 17: Digital Design Today’s topic –Intro to Boolean functions Reminders –HW 4 due Wednesday 10/8/2014 (extended) –HW 5 due Wednesday 10/15/2014.

 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.

CS1Q Computer Systems Lecture 6 Simon Gay. Lecture 6CS1Q Computer Systems - Simon Gay2 Algebraic Notation Writing AND, OR, NOT etc. is long-winded and.

Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.

Why? What’s Boolean algebra used for? –“The purpose of Boolean algebra is to facilitate the analysis and design of digital circuits.” Express a truth table.

Week 6: Gates and Circuits: PART I READING: Chapter 4.

LOGIC GATES AND CIRCUITS Digital systems are said to be constructed by using logic gates. These gates are the AND, OR, NOT, NAND, NOR, EXOR and EXNOR gates.

ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.

4. Computer Maths and Logic 4.2 Boolean Logic Simplifying Boolean Expressions.

June 11, 2002© Howard Huang1 Boolean algebra Last time we talked about Boolean functions, Boolean expressions, and truth tables. Today we’ll learn.

Computer Systems 1 Fundamentals of Computing Simplifying Boolean Expressions.

CS1Q Computer Systems Lecture 6 Simon Gay. Lecture 6CS1Q Computer Systems - Simon Gay2 Algebraic Notation Writing AND, OR, NOT etc. is long-winded and.

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.

CO5023 Building Circuits from Truth Tables. Build the following… Let’s say we want a circuit which acts as described by the following truth table: We.

Logic Gates and Boolean Algebra Introduction to Logic II.

CSE 461. Binary Logic Binary logic consists of binary variables and logical operations. Variables are designated by letters such as A, B, C, x, y, z etc.

Circuit Synthesis A logic function can be represented in several different forms:  Truth table representation  Boolean equation  Circuit schematic 

Lecture 1 Gunjeet kaur Dronacharya group of institutions.

Chapter 12. Chapter Summary Boolean Functions Representing Boolean Functions Logic Gates Minimization of Circuits (not currently included in overheads)

Unit 1 Logical operators.

GCSE OCR Computing A451 Binary logic Computing hardware 6.

Activity 1 5 minutes Grab a whiteboard and pen, come to the front and work out the Truth Table for the following circuit: R A B C Q.

Dr.Ahmed Bayoumi Dr.Shady Elmashad

Morgan Kaufmann Publishers

Component 1 Logical operators.

Department of Preparatory Year, Umm Al Qura University

Chapter 3 Notes – Part II Review Questions

Combinational Logic Circuits

Questions Describe the following gates

Logic Gates and Boolean Algebra

Component 1 – 2A, B, C Binary Logic

Jeremy R. Johnson Wed. Sept. 29, 1999

Dr. Clincy Professor of CS

XOR, XNOR, and Binary Adders

Propositional Calculus: Boolean Algebra and Simplification

Boolean Algebra & Logic Circuits

Elec 2607 Digital Switching Circuits

3.4 Computer systems Boolean logic Lesson 2.

BASIC & COMBINATIONAL LOGIC CIRCUIT

XOR, XNOR, & Binary Adders

Week 7: Gates and Circuits: PART II

CS Chapter 3 (3A and ) Part 3 of 8

Lecture 20: Combinatorial Circuits I

CS Chapter 3 (3A and ) – Part 2 of 5

GCSE Computer Science – Logic Gates & Boolean Expressions

Chapter 4 Gates and Circuits.

XOR Function Logic Symbol  Description  Truth Table 

Truth tables Mrs. Palmer.

XOR, XNOR, and Binary Adders

Digital Logic Design Basics Combinational Circuits Sequential Circuits.

Boolean Algebra and Gate Networks

Eng. Ahmed M Bader El-Din October, 2018

Agenda Lecture Content: Combinatorial Circuits Boolean Algebras

Presentation transcript:

COMPUTER ORGANIZATION AND ASSEMBLY LANGUAGE LECTURE BASED ON BOOLEAN EXPRESSIONS FOR COMBINATIONAL LOGIC SEPTEMBER 20, 2013

I MPORTANT NOTE Please fastened your seat belt as we have to reach our destination in one hour. Be as quick as you can, if we don’t reach our destination I have to throw you out of the aircraft and you will not be provided with the life saving jackets. The aircraft is a five star aircraft not like a local plane so you have all the facilities and you can’t complain about the services.

BOOLEAN ALGEBRA Because you all are competent and hardworking students I am positive that you all know the significance of Boolean Algebra specifically in the Computer Organization and Assembly Language context. Prove me right by letting me know what is your understanding regarding the Boolean Algebra and tell me its significance in terms of Design Complexity.

B OOLEAN EXPRESSIONS OF COMBINATIONAL LOGIC What is the role of Mathematical Algebra in Computer Organization? If it is said that Mathematical expressions are used to explain the complexity of a design by combining multiplication and addition, what would you say? You all must say yes because it is used. If not than raise your hand and I will not mark your presence. If you are asked to solve this expression how will you solve. Y= X. (X + 5) + 3

A NALYZE A CIRCUIT Given below is a sample of Multi-Level Combinational Logic. You have to write the Boolean Algebra form.

EXAMPLE Consider a comparison below, you will notice that if you don’t follow the appropriate rules your whole logic will collapse. Try to give inputs and perform the operation you will notice that both of the logical diagrams will give you entirely different outputs.

W HY TO UNDERSTAND ? To understand Boolean Algebra logic is very vital because normally as a user we think about mathematical solution. You will notice that some expressions that work perfect in mathematics are not applicable in Boolean expressions. Try to give inputs and solve it both in mathematical form and Boolean Algebra form.

E XAMPLE TIME Lets do an Example now. It is indeed a more complex example as compared to the previous one. Try to make the schematic diagram of the expression and analyze yourself what you have done, logically.

L AWS OF B OOLEAN ALGEBRA The manipulation of the algebraic expressions is based on the fundamental laws. Some of these laws extended to manipulation of the Boolean Expressions. Do you know what is a commutative law, if no raise your hands and I will send you back to govt. high school in class 8 but I can’t give you the surety they will accept you.

T O UNDERSTAND THE LOGIC OF A TRUTH TABLE Given below is a truth table presentation. Tell me what is the logic?

F UNDAMENTAL LAWS OF B OOLEAN A LGEBRA The three laws that are fundamental in Boolean Algebra are; 1. Associative law 2. Commutative law 3. Distributive law If you have three inputs A, B and C respectively and the Output is presented by X, Can you write the expressions for the above three laws for both addition and multiplication.

R ULES OF B OOLEAN A LGEBRA There are some rules for Boolean Algebra. The rules are for NOT, AND, OR and XOR Gates. Rule for NOT Gate? What you have to do is to have OR, AND & XOR Gates and solve this expressions by making truth tables. A+0= ? A+1 = ? A+ A = ? & A + A not =? A.0= ? A.1 = ? A. A = ? & A. A not =? Use the similar logic for XOR Gate.