Computer Science 101 Logic Gates and Simple Circuits.

Slides:



Advertisements
Similar presentations
Basics Combinational Circuits Sequential Circuits
Advertisements

CT455: Computer Organization Logic gate
Computer Science 210 Computer Organization Introduction to Logic Circuits.
L14: Boolean Logic and Basic Gates
Programming for GCSE Topic 9.1: Logic Circuits T eaching L ondon C omputing William Marsh School of Electronic Engineering and Computer Science Queen Mary.
EECS 40 Spring 2003 Lecture 11S. Ross and W. G. OldhamCopyright Regents of the University of California TO REVIEW AMPLIFIERS… Prove formulas for various.
Logic Gate Level Combinational Circuits, Part 1. Circuits Circuit: collection of devices physically connected by wires to form a network Net can be: –
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.
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
Propositional Calculus Math Foundations of Computer Science.
Boolean Algebra and Logic Simplification
Binary Logic and Gates COE 202 Digital Logic Design Dr. Aiman El-Maleh
Logic Gate A logic gate is an electronic circuit which makes logic decisions. It has one output and one or more inputs. The output signal appears only.
Digital Logic Circuits – Chapter 1 Section 1-3, 1-2.
CPSC 171 Introduction to Computer Science Boolean Logic, Gates, & Circuits.
CS 1308 – Computer Literacy and the Internet. It’s Not Magic  The goal of the next series of lectures is to show you exactly how a computer works. 
At the bottom, all data is binary
Data Manipulation CSCI130 Instructor: Dr. Imad Rahal.
Transistors and Logic Circuits. Transistor control voltage in voltage out control high allows current to flow -- switch is closed (on) control low stops.
Chapter 3.5 Logic Circuits. How does Boolean algebra relate to computer circuits? Data is stored and manipulated in a computer as a binary number. Individual.
CSCI-235 Micro-Computers in Science Hardware Design Part I.
DeMorgan Theorem, Computer Simulation Exercises
Digital Logic Basics Chapter 2 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer, 
1 The Chinese University of Hong Kong Faculty of Education Diploma in Education (Part-Time) Winter 1997 Educational Communications and Technology Assignment.
Apr. 3, 2000Systems Architecture I1 Systems Architecture I (CS ) Lecture 3: Review of Digital Circuits and Logic Design Jeremy R. Johnson Mon. Apr.
 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.
Computer Science 210 Computer Organization Introduction to Boolean Algebra.
LOGIC GATES.
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.
Week 6: Gates and Circuits: PART I READING: Chapter 4.
Computer Science 101 Circuit Design - Examples. Sum of Products Algorithm Identify each row of the output that has a 1. Identify each row of the output.
CSCI-100 Introduction to Computing Hardware Design Part I.
Circuit Simplification Truth Table  Minimized Logic Gates.
IT253: Computer Organization Lecture 7: Logic and Gates: Digital Design Tonga Institute of Higher Education.
Logic Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
Linear Algebra. Circuits The circuits in computers and other input devices have inputs, each of which is either a 0 or 1, the output is also 0s and 1s.
ITEC 352 Lecture 3 Low level components(2). Low-level components Review Electricity Transistors Gates Really simple circuit.
Karnaugh Maps Ellen Spertus MCS 111 September 2, 2003.
IB Computer Science – Logic
CS 1308 – Computer Literacy and the Internet Building the CPU.
CHAPTER 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs
5 - Digital Logic with Boolean Algebra
Chapter 4 Fundamentals of Computer Logic 1 Chapter 4: Fundamental of Computer Logic - IE337.
Logic Gates M. AL-Towaileb1. Introduction Boolean algebra is used to model the circuitry of electronic devices. Each input and each output of such a device.
CMOS Logic Gates. NMOS transistor acts as a switch 2 When gate voltage is 0 V No channel is formed current does not flow easily “open switch” When gate.
Logic Gates and Boolean Algebra Introduction to Logic II.
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
Digital Logic.
Eng. Mai Z. Alyazji October, 2016
Logic Gates and Boolean Algebra
Computer Science 210 Computer Organization
Transistors and Logic Circuits
CHAPTER 2 Boolean Algebra
CSCI-100 Introduction to Computing
CHAPTER 3 SETS AND BOOLEAN ALGEBRA
Jeremy R. Johnson Wed. Sept. 29, 1999
Basics Combinational Circuits Sequential Circuits
Karnaugh Maps (K-Maps)
Computer Science 210 Computer Organization
Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan
Logic Gates L Al-zaid Math110.
Lecture 20: Combinatorial Circuits I
Logic Gates.
ECB2212-Digital Electronics K-Map
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
Logic Gates Dr.Halimah Alshehri.
Truth tables Mrs. Palmer.
Digital Logic Design Basics Combinational Circuits Sequential Circuits.
Eng. Ahmed M Bader El-Din October, 2018
Agenda Lecture Content: Combinatorial Circuits Boolean Algebras
Presentation transcript:

Computer Science 101 Logic Gates and Simple Circuits

Transistor - Electronic Switch Collector Base EmitterSwitch Base High (+5v or 1) Makes connection Base High (+5v or 1) Makes connection Base Low (0v or 0) Disconnects Base Low (0v or 0) Disconnects Say, 500 million transistors on a chip 1 cm 2 Say, 500 million transistors on a chip 1 cm 2 Change states in billionth of sec Change states in billionth of sec Solid state Solid state

Moore’s Law In 1965, Intel co-founder Gordon Moore saw the future. His prediction, now popularly known as Moore's Law, states that the number of transistors on a chip doubles about every two years.

Gates A gate is an electronic device that takes 0/1 inputs and produces a 0/1 result. A gate is an electronic device that takes 0/1 inputs and produces a 0/1 result.

NOT Gate +5v Input Ground Input High (+5v or 1) Output Low (0v or 0) Input High (+5v or 1) Output Low (0v or 0) Input Low (0v or 0) Output High (+5v or 1) Input Low (0v or 0) Output High (+5v or 1) Output is opposite of Input Output is opposite of Input Output NOT Gate A _A_A

AND Gate +5v Output is 1 only if Output is 1 only if Input-1 is 1 and Input-2 is 1 Output = Input1 AND Input2 Output = Input1 AND Input2 Output Input-1Input-2 AND Gate A ABB

OR Gate Output is 1 if Output is 1 if A is 1 or if B is 1 Output = A OR B Output = A OR B +5v Output A B OR Gate A A + B B

Boolean Expression  Python Logical operators Logical operators AND  and (Python)AND  and (Python) OR  or (Python)OR  or (Python) NOT  not (Python)NOT  not (Python) NOT ((x>y) AND ((x=5) OR (y=3)) NOT ((x>y) AND ((x=5) OR (y=3)) not((x>y) and ((x==5)or(y==3))) not((x>y) and ((x==5)or(y==3))) while (not((x>y) and ((x==5)or(y==3)))) : … while (not((x>y) and ((x==5)or(y==3)))) : …

Abstraction In computer science, the term abstraction refers to the practice of defining and using objects or systems based on the high level functions they provide. In computer science, the term abstraction refers to the practice of defining and using objects or systems based on the high level functions they provide. We suppress the fine details of how these functions are carried out or implemented. We suppress the fine details of how these functions are carried out or implemented. In this way, we are able to focus on the big picture. In this way, we are able to focus on the big picture. If the implementation changes, our high level work is not affected. If the implementation changes, our high level work is not affected.

Abstraction Examples Boolean algebra - we can work with the Boolean expressions knowing only the properties or laws - we do not need to know the details of what the variables represent. Boolean algebra - we can work with the Boolean expressions knowing only the properties or laws - we do not need to know the details of what the variables represent. Gates - we can work with the logic gates knowing only their function (output is 1 only if inputs are …). Don’t have to know how gate is constructed from transistors. Gates - we can work with the logic gates knowing only their function (output is 1 only if inputs are …). Don’t have to know how gate is constructed from transistors.

Boolean Exp  Logic Circuit To draw a circuit from a Boolean expression: To draw a circuit from a Boolean expression: From the left, make an input line for each variable. From the left, make an input line for each variable. Next, put a NOT gate in for each variable that appears negated in the expression. Next, put a NOT gate in for each variable that appears negated in the expression. Still working from left to right, build up circuits for the subexpressions, from simple to complex. Still working from left to right, build up circuits for the subexpressions, from simple to complex.

Logic Circuit: _ ____ AB+(A+B)B A B Input Lines for Variables

Logic Circuit: _ ____ AB+(A+B)B A B NOT Gate for B _B_B

Logic Circuit: _ ____ AB+(A+B)B A B _ Subexpression AB _B_B _ AB

Logic Circuit: _ ____ AB+(A+B)B A B Subexpression A+B _B_B _ AB A+B

Logic Circuit: _ ____ AB+(A+B)B A B ___ Subexpression A+B _B_B _ AB A+B ____ A+B

Logic Circuit: _ ____ AB+(A+B)B A B ___ Subexpression (A+B)B _B_B _ AB A+B ____ A+B ____ (A+B)B

Logic Circuit: _ ____ AB+(A+B)B A B Entire Expression _ AB A+B ____ A+B _B_B ____ (A+B)B

Logic Circuit  Boolean Exp In the opposite direction, given a logic circuit, we can write a Boolean expression for the circuit. In the opposite direction, given a logic circuit, we can write a Boolean expression for the circuit. First we label each input line as a variable. First we label each input line as a variable. Then we move from the inputs labeling the outputs from the gates. Then we move from the inputs labeling the outputs from the gates. As soon as the input lines to a gate are labeled, we can label the output line. As soon as the input lines to a gate are labeled, we can label the output line. The label on the circuit output is the result. The label on the circuit output is the result.

Logic Circuit  Boolean Exp A B _A_A _B_B A+B _ AB _ AB _ AB+AB _ AB+AB ______ _ _ (AB+AB)(A+B) ______ Entire Expression

Simplification Revisited Once we have the BE for the circuit, perhaps we can simplify. Once we have the BE for the circuit, perhaps we can simplify.

Logic Circuit  Boolean Exp Reduces to:

The Boolean Triangle Boolean Expression Truth Table Logic Circuit

The Boolean Triangle Boolean Expression Truth Table Logic Circuit