Chapter 2: The Logic of Compound Statements 2.4 Application: Digital Logic Circuits 1 Only connect! – E. M. Forster, 1879 – 1970 Howards End, 1910.

Slides:

Advertisements

Similar presentations

Date of Birth Design Problem

Advertisements

A Simple ALU Binary Logic.

EET 1131 Unit 5 Boolean Algebra and Reduction Techniques

Truth Tables and Logic Gates. What are Logic Gates? Logic gates are components used in making logic circuits. Each gate has one or more inputs and produces.

ENGIN112 L7: More Logic Functions September 17, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 7 More Logic Functions: NAND, NOR,

Basics Combinational Circuits Sequential Circuits

Chapter 3 Logic Gates and Boolean Algebra – Part 1

Programmable Logic Controllers.

Lecture 6 More Logic Functions: NAND, NOR, XOR and XNOR

Logic Gates. Digital Signals Logic Gates NOT (Inverter) Gate AND Gate OR Gate NAND Gate NOR Gate XOR Gate.

Logic Gates Some Most All Learning Objective

(CSC 102) Discrete Structures Lecture 5.

Logic Gates & Circuits. AND Gate Input AInput BOutput X AND Logic Gate AND Truth Table X = A. B AND Boolean Expression.

Lesson Objectives Understand and produce simple logic diagrams using the operation NOT, AND and OR Produce a truth table from a given logic diagram.

Topics Adders Half Adder Full Adder Subtracter Half Subtracter

ADDER, HALF ADDER & FULL ADDER

CS1022 Computer Programming & Principles

ELECTRONICS TECHNOLOGY Digital Devices I Karnaugh Maps

ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.

CS 151 Digital Systems Design Lecture 7 More Logic Functions: NAND, NOR, XOR.

08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:

SYEN 3330 Digital SystemsJung H. Kim Chapter SYEN 3330 Digital Systems Chapter 2 – Part 1.

Logic Gate Level Combinational Circuits, Part 1. Circuits Circuit: collection of devices physically connected by wires to form a network Net can be: –

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

Copyright © Cengage Learning. All rights reserved. CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS THE LOGIC OF COMPOUND STATEMENTS.

The Logic of Compound Statements

1 Introduction to Abstract Mathematics Applications : Digital Logic Circuits 2.4 and Number Systems 2.5 Instructor: Hayk Melikya

XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.

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.

Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7.1 – 7.2 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Boolean.

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.

4. Electrons and electronics 4.5 Digital electronics.

Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.

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

Logic Gates. The Inverter The inverter (NOT circuit) performs the operation called inversion or complementation. Standard logic symbols: 1 1 input output.

1 CS 151: Introduction to Digital Design Chapter 2-10 High Impedance Outputs.

Module 7.  In Module 3 we have learned about NAND gate – it is a combination of AND operation followed by NOT operation  Symbol A. B = Y  Logic Gate.

CHAPTER 5 Combinational Logic Analysis

ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR and parity check Circuits.

CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC. De Morgan’s Theorem De Morgan’s Theorem.

Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Boolean 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.

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

Digital Logic Design. Truth Table  Logic Circuit 1. Start with truth table 2. When your output is a 1, figure out the combination of inputs, ANDs, and.

Logic Gates Review. Logic Gates OR gate – 1 if either input is 1 – 0 if they both are 0.

Truth Table to Statement Form

Logic Gates Practical Objective: to develop an understanding of logic circuits and truth tables.

Combinational Logic Circuits

Logic Gates Benchmark Companies Inc PO Box Aurora CO

EI205 Lecture 5 Dianguang Ma Fall 2008.

KS4 Electricity – Electronic systems

KS4 Electricity – Electronic systems

How Boolean logic is implemented

Circuits, Truth Tables & Boolean Algebra

JC Technology Logic Gates.

KS4 Electricity – Electronic systems

Combinational Circuits

Chapter 4 Gates and Circuits.

Circuits, Truth Tables & Boolean Algebra

XOR Function Logic Symbol  Description  Truth Table 

Truth tables Mrs. Palmer.

Copyright © Cengage Learning. All rights reserved.

Agenda Lecture Content: Combinatorial Circuits Boolean Algebras

SYEN 3330 Digital Systems Chapter 2 – Part 1 SYEN 3330 Digital Systems.

Presentation transcript:

Chapter 2: The Logic of Compound Statements 2.4 Application: Digital Logic Circuits 1 Only connect! – E. M. Forster, 1879 – 1970 Howards End, 1910

A NOT-gate (or inverter) is a circuit with one input signal and one output signal. The NOT-gate signals correspond exactly to the logical connector ~ if the symbol 1 is identified with T and the symbol 0 is identified with F. P NOT R 2.4 Application: Digital Logic Circuits2 INPUT P OUTPUT R 1 0

An AND-gate is a circuit with two input signals and one output signal. The AND-gate signals correspond exactly to the logical connector if the symbol 1 is identified with T and the symbol 0 is identified with F. 2.4 Application: Digital Logic Circuits3 AND P Q R INPU T P INPU T Q OUTPU T R

The OR-gate also has two input signals and one output signal. The AND-gate signals correspond exactly to the logical connector if the symbol 1 is identified with T and the symbol 0 is identified with F. 2.4 Application: Digital Logic Circuits4 OR Q P R INPU T P INPU T Q OUTPU T R

Gates can be combined into circuits in a variety of ways. When we follow the rules below, we create a combinational circuit, one whose output at anytime is determined entirely by its input at that time without regard to previous inputs. Rules: 1.Never combine two input wires. 2.A single input wire can be split partway and used as input for two separate gates. 3.An output wire can be used as an input. 4.No output of a gate can eventually feed back into that gate. 2.4 Application: Digital Logic Circuits5

Give the output signals for the circuits if the input signals are as indicated. 2.4 Application: Digital Logic Circuits6

Find the Boolean expression that corresponds to the circuit. 2.4 Application: Digital Logic Circuits7

Construct circuits for the Boolean expression. P ( P Q) 2.4 Application: Digital Logic Circuits8

For the given table, construct (a) a Boolean expression having the given table as its truth table and (b) a circuit having the given table as its input/output table. 2.4 Application: Digital Logic Circuits9 PQRS

Use the properties listed in Theorem to show that each pair of circuits have the same input/output table. Find the Boolean expressions for the circuits and show that they are logically equivalent when regarded as statement forms. 2.4 Application: Digital Logic Circuits10