L OGIC G ATES Computer Organization – week 3. W HAT ’ S ALU? 1. ALU stands for: Arithmetic Logic Unit 2. ALU is a digital circuit that performs Arithmetic.

Slides:



Advertisements
Similar presentations
Chapter 4 Gates and Circuits.
Advertisements

Chapter 4 Gates and Circuits Nell Dale • John Lewis.
Chapter 4 Gates and Circuits.
Logic Gates.
Gates and Circuits Nell Dale & John Lewis (adaptation by Erin Chambers and Michael Goldwasser)
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Chapter 4 Gates and Circuits.
Cosc 2150: Computer Organization Chapter 3: Boolean Algebra and Digital Logic.
Chapter 4 Gates and Circuits.
9/19/06 Hofstra University – Overview of Computer Science, CSC005 1 Chapter 4 Gates and Circuits.
9/19/06 Hofstra University – Overview of Computer Science, CSC005 1 Chapter 4 Gates and Circuits.
Gates CS105. Electrical Signals Transmission of data Any electrical signal has a level of voltage – Interpretation of 1s and 0s Generally speaking: –
Lecture 3. Boolean Algebra, Logic Gates
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
Lecture 3. Boolean Algebra, Logic Gates Prof. Sin-Min Lee Department of Computer Science 2x.
Chapter 4 Gates and Circuits. 4–2 Chapter Goals Identify the basic gates and describe the behavior of each Describe how gates are implemented using transistors.
Chapter 4 Gates and Circuits.
Lecture 3. Error Detection and Correction, Logic Gates Prof. Sin-Min Lee Department of Computer Science 2x.
Quiz # 2 Chapters 4, 5, & 6.
1 CHAPTER 4: PART I ARITHMETIC FOR COMPUTERS. 2 The MIPS ALU We’ll be working with the MIPS instruction set architecture –similar to other architectures.
Chapter 4 Gates and Circuits. Integrated Circuits aka CHIPS What’s in this thing???? 4–2.
Chapter 4 Gates and Circuits.
Binary Addition CSC 103 September 17, 2007.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
CPS120: Introduction to Computer Science
The Digital Logic Level
Digital Logic. 4 Why is 32-bit or 64-bit significant in terms of speed, efficiency? 4 Difference between OR and XOR 4 What is a mux for? PLA 4 Two kinds.
 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.
Week 6: Gates and Circuits: PART I READING: Chapter 4.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
Digital Logic. 2 Abstractions in CS (gates) Basic Gate: Inverter IO IO GNDI O Vcc Resister (limits conductivity) Truth Table.
Logic Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
1 EG 32 Digital Electronics Thought for the day You learn from your mistakes..... So make as many as you can and you will eventually know everything.
1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
COMPUTER ARCHITECTURE TRUTH TABLES AND LOGIC GATES.
Digital Computers Logic Gates & Applications. Digital Computers Types of Material (Electric Conductivity) – Insulator Rubber / wood – Conductor Copper.
Digital electronics 4–1 Gates and Circuits SANJAYBHAI RAJGURU COLLEGE OF ENGG.
Logic Gates Dr.Ahmed Bayoumi Dr.Shady Elmashad. Objectives  Identify the basic gates and describe the behavior of each  Combine basic gates into circuits.
4–1. BSCS 5 th Semester Introduction Logic diagram: a graphical representation of a circuit –Each type of gate is represented by a specific graphical.
C OMBINATIONAL L OGIC D ESIGN 1 Eng.Maha AlGubali.
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
Logic Gates Learning Objectives Learn that there is a one-to-one relationship between logic gates and Boolean expressions Learn how logic gates are combined.
Week 1: Introduction and Logic gates IT3002 – Computer Architecture
CSIS-110 Introduction to Computer Science
Basics of Logic gates - Part 1
Dr.Ahmed Bayoumi Dr.Shady Elmashad
Chapter 3 - Binary Numbering System
Dr.Ahmed Bayoumi Dr.Shady Elmashad
ECE 3130 Digital Electronics and Design
CSIS-110 Introduction to Computer Science
Circuits Logic in Hardware.
Logic Gates.
Digital Signals Digital Signals have two basic states:
Fundamentals & Ethics of Information Systems IS 201
Chapter 4 Gates and Circuits.
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Agenda – 2/12/18 Questions? Readings: CSI 4, P
Schematics 201 Lecture Topic: Electrical Symbols
Logic Gates.
Boolean Algebra.
Week 7: Gates and Circuits: PART II
Logic Gates.
Digital Logic.
Logic Gates.
Digital Logic.
DIGITAL ELECTRONICS B.SC FY
Logic Gates.
Chapter 4 Gates and Circuits.
XOR Function Logic Symbol  Description  Truth Table 
What are Logic Gates?.
Presentation transcript:

L OGIC G ATES Computer Organization – week 3

W HAT ’ S ALU? 1. ALU stands for: Arithmetic Logic Unit 2. ALU is a digital circuit that performs Arithmetic (Add, Sub,...) and Logical (AND, OR, NOT) operations.

C OMPUTERS AND E LECTRICITY A gate is a device that performs a basic operation on electrical signals Gates are combined into circuits to perform more complicated tasks

G ATES Let’s examine the processing of the following six types of gates NOT AND OR XOR NAND NOR

B ASIC LOGIC GATES Not And Or Nand Nor Xor

D ESCRIBING G ATES AND C IRCUITS There are three different, but equally powerful, notational methods for describing the behavior of gates and circuits Boolean expressions logic diagrams truth tables

D ESCRIBING G ATES AND C IRCUITS Boolean algebra : expressions in this algebraic notation are an elegant and powerful way to demonstrate the activity of electrical circuits Basic propositional statements are unambiguously either True or False Operations such as AND or NOT are then performed on these values A gate is simply a mechanical way to perform such a boolean operation

D ESCRIBING G ATES AND C IRCUITS Logic diagram: a graphical representation of a circuit Each type of gate is represented by a specific graphical symbol Truth table: defines the function of a gate by listing all possible input combinations that the gate could encounter, and the corresponding output

NOT G ATE a NOT gate accepts one input value and produces one output value a NOT gate is sometimes referred to as an inverter because it inverts the input value

AND G ATE An AND gate accepts two input signals If the two input values for an AND gate are both 1, the output is 1; otherwise, the output is 0

OR G ATE If the two input values are both 0, the output value is 0; otherwise, the output is 1

XOR G ATE XOR, or exclusive OR, gate An XOR gate produces 0 if its two inputs are the same, and a 1 otherwise Note the difference between the XOR gate and the OR gate; they differ only in one input situation When both input signals are 1, the OR gate produces a 1 and the XOR produces a 0

NAND AND NOR G ATES The NAND and NOR gates are essentially the opposite of the AND and OR gates, respectively

G ATES WITH M ORE I NPUTS Gates can be designed to accept three or more input values A three-input AND gate, for example, produces an output of 1 only if all input values are 1

C ONVERTING BETWEEN CIRCUITS AND EQUATIONS Find the output of the following circuit x+yx+y (x+y)y(x+y)y y

C ONVERTING BETWEEN CIRCUITS AND EQUATIONS Write the circuits for the following Boolean algebraic expressions a) x + y

C ONSTRUCTING G ATES A transistor is a device that acts, depending on the voltage level of an input signal, either as a wire that conducts electricity or as a resistor that blocks the flow of electricity A transistor has no moving parts, yet acts like a switch It is made of a semiconductor material, which is neither a particularly good conductor of electricity, such as copper, nor a particularly good insulator, such as rubber

P ROPERTIES OF B OOLEAN A LGEBRA

A DDERS At the digital logic level, addition is performed in binary Addition operations are carried out by special circuits called, appropriately, adders

A DDERS The result of adding two binary digits could produce a carry value Recall that = 10 in base two A circuit that computes the sum of two bits and produces the correct carry bit is called a half adder

A DDERS Circuit diagram representing a half adder Two Boolean expressions: sum = A  B carry = AB

A DDERS A circuit called a full adder takes the carry-in value into account

M ULTIPLEXERS Multiplexer is a general circuit that produces a single output signal The output is equal to one of several input signals to the circuit The multiplexer selects which input signal is used as an output signal based on the value represented by a few more input signals, called select signals or select control lines

M ULTIPLEXERS The control lines S0, S1, and S2 determine which of eight other input lines (D0 through D7) are routed to the output (F)