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.

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

Karnaugh Maps. What are karnaugh maps? Boolean algebra can be represented in a variety of ways. These include: Boolean expressions Truth tables Circuit.
ECE 2373 Modern Digital System Design Exam 2. ECE 2372 Exam 2 Thursday March 5 You may use two 8 ½” x 11” pages of information, front and back, write.
Microprocessors vs. Custom Digital Circuits
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
ENGG 1203 Tutorial Combinational Logic (I) 1 Feb Learning Objectives

Digital Logic and Design Vishal Jethva Lecture No. 10 svbitec.wordpress.com.
Digital Logic ENEL 111. Digital systems A digital system is a system whose inputs and outputs fall within a discrete, finite set of values Two main types.
At the bottom, all data is binary
DeMorgan Theorem, Computer Simulation Exercises
Unit IV Fundamentals of Logic Design by Roth and Kinney.
1 Digital Logic Design Week 5 Simplifying logic expressions.
Digital Electronics Lecture 4 Simplification using Boolean Algebra, Combinational Logic Circuit Design.
Digital Systems I EEC 180A Lecture 4 Bevan M. Baas.
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 Lecture 6 Combinational Logic Circuit Design.
Why? What’s Boolean algebra used for? –“The purpose of Boolean algebra is to facilitate the analysis and design of digital circuits.” Express a truth table.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
Circuit Simplification Truth Table  Minimized Logic Gates.
ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.
Logic Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
CH51 Chapter 5 Combinational Logic By Taweesak Reungpeerakul.
Using De’Morgan’s On of the most useful principles in boolean algebra is De’Morgan’s Theorem, which allows one to switch between ANDs and NORs and ORs.
Logic Gates. The Inverter The inverter (NOT circuit) performs the operation called inversion or complementation. Standard logic symbols: 1 1 input output.
XOR Operator A short digression… … to introduce another Boolean operation: exclusive- OR (XOR) ABA + B XOR.
ITEC 352 Lecture 3 Low level components(2). Low-level components Review Electricity Transistors Gates Really simple circuit.
Combinational Logic Design Process © 2014 Project Lead The Way, Inc.Digital Electronics.
IB Computer Science – Logic
Combinational Logic Digital Design Department of Software Development Faculty of Information Technology Islamic University of Gaza Dr. Rebhi Baraka
Designing Combinational Logic Circuits
DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor
Karnaugh Maps (K-Maps)
Boolean 4.1 Boolean Logic 4 ©Paul Godin Created September 2007 gmail.com.
THE K-MAP.
Circuits & Boolean Expressions. A ABC BC ABC C B A Example # 1: Boolean Expression: Develop a Boolean expression from a circuit.
Karnaugh Map (K-Map) By Dr. M. Khamis Mrs. Dua’a Al Sinari.
CHAPTER 5 Combinational Logic Analysis
School of Computer and Communication Engineering, UniMAP DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan.
Circuit Design Process © 2014 Project Lead The Way, Inc.Digital Electronics.
Logic Gates and Boolean Algebra Introduction to Logic II.
Circuits, Truth Tables & Boolean Algebra. Expressions Can describe circuits in terms of Boolean expression.
ACOE161Digital Circuit Design1 Design Of Combinational Logic Circuits.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC:K-Map. K-Map (1)  Karnaugh Map provides a systematic method for simplifying Boolean expressions and may produce.
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 The processor is made up of millions of logic gates. These are used to make decisions. Each gate takes an electric input and outputs a result.
Eng. Mai Z. Alyazji October, 2016
Logic Gates and Boolean Algebra
Logic Gates, Boolean Algebra and Karnaugh Maps
Logic Gates.
Logic Gates Benchmark Companies Inc PO Box Aurora CO
Digital Logic.
Computer Architecture CST 250
Circuits & Boolean Expressions
Karnaugh Maps (K-Maps)
COMBINATIONAL LOGIC Circuit Design
Combinational Logic Design Process
Circuits, Truth Tables & Boolean Algebra
Logic Gates.
EET 1131 Unit 3 Basic Logic Gates
ECB2212-Digital Electronics K-Map
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
De Morgan’s laws presentation
Today You are Learning simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT.
Circuits, Truth Tables & Boolean Algebra
Principles & Applications
Eng. Ahmed M Bader El-Din October, 2018
Circuits & Boolean Expressions
Simplifying Expressions
Presentation transcript:

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 Draw the schematic Build the circuit

Design a safety alarm system for a car that alerts the driver when the seatbelts have not been fastened, or when the door is ajar while the key is in the ignition. A=KeyB=DoorC=Seatbelt ABC X ABC Boolean Expression Is: ABC + ABC + ABC=X Logic Problem

K-Map Dist. Th. 4 Th. 6 Dist. Th. 11 Dist. Boolean Simplification AB C Create Expression & Simplify

Create Circuit Schematic X

NAND Only Solution

MultiSIM Demo