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.

Slides:

Advertisements

Similar presentations

Advertisements

Digital Circuits.

ECE 301 – Digital Electronics Minterm and Maxterm Expansions and Incompletely Specified Functions (Lecture #6) The slides included herein were taken from.

Relationship Between Basic Operation of Boolean and Basic Logic Gate The basic construction of a logical circuit is gates Gate is an electronic circuit.

Lecture 14 Today we will Learn how to implement mathematical logical functions using logic gate circuitry, using Sum-of-products formulation NAND-NAND.

Chapter 5 Boolean Algebra and Reduction Techniques 1.

Introduction to Computer Science David Goldschmidt, Ph.D. Computer Science The College of Saint Rose CIS September 6, 2007.

KARNAUGH MAP – Digital Circuit 1 Choopan Rattanapoka.

Digital Electronics Lecture 4 Simplification using Boolean Algebra, Combinational Logic Circuit Design.

Digital Circuits. Review – Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every.

Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.

Erik Jonsson School of Engineering and Computer Science FEARLESS Engineeringwww.utdallas.edu/~pervin EE/CE 2310 – HON/002 Introduction to Digital Systems.

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.

Circuit Simplification Truth Table  Minimized Logic Gates.

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

Combination of logic gates  Logic gates can be combined to produce more complex functions.  They can also be combined to substitute one type of gate.

Basic Gates 3.1 Basic Digital Logic: NAND and NOR Gates ©Paul Godin Created September 2007 Last Update Sept 2009.

CH51 Chapter 5 Combinational Logic By Taweesak Reungpeerakul.

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

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

Basic Digital Logic: NAND and NOR Gates Technician Series ©Paul Godin Last Update Dec 2014.

ITEC 352 Lecture 3 Low level components(2). Low-level components Review Electricity Transistors Gates Really simple circuit.

COMBINATIONAL LOGIC Circuit Design. Steps Create the truth table Extract the Boolean Expression from the truth table or create a K-Map Simplify the expression.

Steering Gates, Timing Diagrams & Combinational Logic Technician Series Steering 1.1 ©Paul Godin Created Jan 2014.

Basic Gates 2.1 Basic Digital Logic: Application of Digital Gates using AND / OR / NOT ©Paul Godin Created August 2007 Last Update Sept 2013 Basic Gates.

Combinational Logic Digital Design Department of Software Development Faculty of Information Technology Islamic University of Gaza Dr. Rebhi Baraka

CEC 220 Digital Circuit Design Boolean Algebra I Wed, Sept 2 CEC 220 Digital Circuit Design Slide 1 of 13.

Assoc. Prof. Dr. Ahmet Turan ÖZCERİT.  Boolean postulate  Simplifying boolean equations  Truth tables You will learn: 2.

Designing Combinational Logic Circuits

Karnaugh Maps (K-Maps)

C.S. Choy21 BOOLEAN ALGEGRA The Mathematics of logic Boolean variables have only two possible values (binary) Operators:. Product+ SumComplement A.B A+B.

Circuits & Boolean Expressions. A ABC BC ABC C B A Example # 1: Boolean Expression: Develop a Boolean expression from a circuit.

Computer Organization CSC 405 Decoders and Multiplexers.

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

DE MORGAN’S THEOREM. De Morgan’s Theorem De Morgan’s Theorem.

B OOLEAN A LGEBRA AND LOGIC GATES Chapter2-Lecture5.

Circuits, Truth Tables & Boolean Algebra. Expressions Can describe circuits in terms of Boolean expression.

ACOE161Digital Circuit Design1 Design Of Combinational Logic Circuits.

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.

Logic Gates and Boolean Algebra

Computer Science 210 Computer Organization

De Morgan’s Theorem,.

Boolean Algebra & De Morgan's Theorems

Logic Gates Benchmark Companies Inc PO Box Aurora CO

CHAPTER 1 : INTRODUCTION

Boolean Expressions Lecture No. 10.

Circuits & Boolean Expressions

Karnaugh Maps (K-Maps)

COMBINATIONAL LOGIC Circuit Design

Digital Circuits.

Circuits, Truth Tables & Boolean Algebra

Homework Reading Tokheim, Section 5-10, 7-4.

Reading: Hambley Ch. 7 through 7.5

Princess Sumaya University

ECB2212-Digital Electronics K-Map

Circuits, Truth Tables & Boolean Algebra

Combinational Logic Practice Problems gmail.com Jan 2015.

Evaluating Boolean expressions

Principles & Applications

Half & Full Subtractor Half Subtractor Full Subtractor.

Laws & Rules of Boolean Algebra

Half & Full Subtractor Half Subtractor Full Subtractor.

Digital Circuits.

Circuits & Boolean Expressions

Digital Circuits.

Presentation transcript:

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 NOTs Example:A = 0, B = 1, C = 0  A’·B·C’ A = 1, B = 1, C = 0  A·B·C’ 3. When you have all your “miniterms,” OR all of them together Example:f = A’·B·C’ + A·B·C’ 4. Simplify your boolean expression 5. Build your digital circuit

Example What is the boolean function for the truth table below? miniterms: A’·B’·C A’·B·C A·B’·C’ A·B’·C A·B·C f = A’·B’·C + A’·B·C + A·B’·C’ + A·B’·C + A·B·C ABCf

Example Simplify the boolean expression f = A’·B’·C + A’·B·C + A·B’·C’ + A·B’·C + A·B·C f = A’·C + A·B’ + A·B·C f = A’·C + A ( B’ + C ) Build the digital circuit from the simplified expression

Your Turn Design the digital circuit for the following truth table: ABCf

1) Get the Boolean expression? ABCf Hint: What are the miniterms?

2) Simplify! f = A’·B·C + A·B’·C’ + A·B’·C + A·B·C’ + A·B·C

3) Build the Digital Circuit f = A + B·C

Done! f = A + B·C