4. Computer Maths and Logic 4.2 Boolean Logic 4.2.4 Logic Circuits.

Slides:



Advertisements
Similar presentations
(CSC 102) Discrete Structures Lecture 5.
Advertisements

ADDER, HALF ADDER & FULL ADDER
التصميم المنطقي Second Course
CSE-221 Digital Logic Design (DLD)
Fall 2005 L15: Combinational Circuits Lecture 15: Combinational Circuits Complete logic functions Some combinational logic functions –Half adders –Adders.
Fall 2007 L15: Combinational Circuits Lecture 15: Combinational Circuits Complete logic functions Some combinational logic functions –Half adders –Adders.
Section 10.3 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.
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Building Functions.
XOR, XNOR, and Binary Adders
Boolean Logic By: Arthur Brooks February 25, 2003 Think, Speak, and Write Computer Science.
Binary Numbers.
Binary Addition CSC 103 September 17, 2007.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
+ CS 325: CS Hardware and Software Organization and Architecture Combinational Circuits 1.
Using building blocks to make bigger circuits
1 Logic Gates. 2 Review of Boolean algebra Just like Boolean logic Variables can only be 1 or 0 Instead of true / false Instead of true / false.
1 The Chinese University of Hong Kong Faculty of Education Diploma in Education (Part-Time) Winter 1997 Educational Communications and Technology Assignment.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
1 Boolean Algebra & Logic Gates. 2 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple.
Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.
Digital Electronics and Computer Interfacing
Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.
Logic Gates Logic gates are electronic digital circuit perform logic functions. Commonly expected logic functions are already having the corresponding.
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.
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.
Arithmetic Circuits. Half Adder ABSumCarry
Half-Adder: A combinational circuit which adds two one-bit binary numbers is called a half-adder. The sum column resembles like an output of the XOR gate.
Universal college of engineering & technology. .By Harsh Patel)
1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
Logic and computers 2/6/12. Binary Arithmetic /6/ Only two digits: the bits 0 and 1 (Think: 0 = F, 1.
Digital Logic Design (CSNB163)
How computers calculate How binary operations yield complex capabilities.
COMBINATIONAL LOGIC.
1 Ethics of Computing MONT 113G, Spring 2012 Session 4 Binary Addition.
How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B A B
1 Logic Gates CS 202, Spring 2008 Epp, sections 1.4 and 1.5.
WORKING PRINCIPLE OF DIGITAL LOGIC
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.
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
1 Review of Boolean algebra Just like Boolean logic Variables can only be 1 or 0 Instead of true / false Instead of true / false.
Programming for GCSE Topic 9.2: Circuits for Adding T eaching L ondon C omputing William Marsh School of Electronic Engineering and Computer Science Queen.
1 Review of Boolean algebra Not is a horizontal bar above the number –0 = 1 –1 = 0 Or is a plus –0+0 = 0 –0+1 = 1 –1+0 = 1 –1+1 = 1 And is multiplication.
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.
Combinational Circuits
ECE 3130 Digital Electronics and Design
Combinational Circuits
Summary Half-Adder Basic rules of binary addition are performed by a half adder, which has two binary inputs (A and B) and two binary outputs (Carry out.
XOR, XNOR, and Binary Adders
Digital System Design Review.
Computer Science 210 Computer Organization
XOR, XNOR, & Binary Adders
Boolean Algebra.
Week 7: Gates and Circuits: PART II
Digital Logic.
Number Systems and Circuits for Addition
Logic Gates.
Logic Gates.
Digital Logic.
DIGITAL ELECTRONICS B.SC FY
Chapter 10.3 and 10.4: Combinatorial Circuits
XOR, XNOR, and Binary Adders
Combinational Circuits
XOR Function Logic Symbol  Description  Truth Table 
LOGIC Circuits.
Adder Circuits By: Asst Lec. Basma Nazar
XOR, XNOR, and Binary Adders
Half & Full Subtractor Half Subtractor Full Subtractor.
Half & Full Subtractor Half Subtractor Full Subtractor.
Presentation transcript:

4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits

Logic gates Each logical operator is performed physically by a logic circuit (logic gate) ‏

NOT gate

AND gate

OR gate

NAND gate

NOR gate

XOR gate

Computers contain very large arrays of logic gates combined to form circuits such as adders, decoders or flip-flops. Boolean expressions are reduced to their simplest form before building these circuits Uses of logic gates

A simple AND gate can be used as a switch, one input is the control, the other the data - when the control is 0, output is always 0 (switch is off), when the control is 1, output is always the same as the data: Switches

A half adder takes two data inputs and adds them producing two outputs, the sum and the carry. This represents what happens in binary addition: 1 plus 1 is 0 carry 1. Half adder

CarrySumBA OutputsInputs

So in a half adder, the sum is A  B and the carry is A B The logic circuit is: Half adder

When adding binary numbers, the carry must be added to the next column on the left A full adder does this by putting together two half adders and an OR gate: Full adder

So a full adder takes three inputs (two data inputs and the previous carry input) and produces two outputs, the sum and the carry These can be cascaded to make parallel adders (i.e. adds multiple- bit numbers e.g. bytes, etc.) ‏ Full adder

Parallel adder

What does this do?

A circuit that is stable in one state until flipped into the other. Can act as memory cells i.e. retain a 0 or 1 until changed. Flip-flop