COMBINATIONAL LOGIC Circuit Design

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

ECE 238L Computer Logic Design Spring 2010
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
1 Homework Reading –Tokheim, Section 5-1, 5-2, 5-3, 5-7, 5-8 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.
Lecture 14 Today we will Learn how to implement mathematical logical functions using logic gate circuitry, using Sum-of-products formulation NAND-NAND.
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
Design Of Combinational Logic Circuits
ENGG 1203 Tutorial Combinational Logic (I) 1 Feb Learning Objectives

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.
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 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.
Logic Gates. The Inverter The inverter (NOT circuit) performs the operation called inversion or complementation. Standard logic symbols: 1 1 input output.
Combinational Logic Design Process © 2014 Project Lead The Way, Inc.Digital Electronics.
+ CS 325: CS Hardware and Software Organization and Architecture Gates and Boolean Algebra Part 3.
IB Computer Science – Logic
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.
Combinational Logic Digital Design Department of Software Development Faculty of Information Technology Islamic University of Gaza Dr. Rebhi Baraka
1 Digital Logic Design Week 5&6 cont’d Revision for Quiz 2/Exam.
1 Homework Reading –Tokheim, Section 5-1, 5-2, 5-3, 5-7, 5-8 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.
Designing Combinational Logic Circuits
Karnaugh Maps (K-Maps)
Circuits & Boolean Expressions. A ABC BC ABC C B A Example # 1: Boolean Expression: Develop a Boolean expression from a circuit.
CHAPTER 5 Combinational Logic Analysis
Logic Gates and Boolean Algebra Introduction to Logic II.
Logic Gates, Boolean Algebra and Karnaugh Maps. Challenge! By the end of todays session can you complete the following?
Circuits, Truth Tables & Boolean Algebra. Expressions Can describe circuits in terms of Boolean expression.
ACOE161Digital Circuit Design1 Design Of Combinational Logic Circuits.
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.
Homework Reading Machine Projects Labs
Eng. Mai Z. Alyazji October, 2016
Logic Gates and Boolean Algebra
Minimization of Circuits
Logic Gates, Boolean Algebra and Karnaugh Maps
Logic Gates.
Logic Gates Benchmark Companies Inc PO Box Aurora CO
Digital Logic.
Digital Logic Design 1st Exam Solution
Boolean Expressions Lecture No. 10.
Computer Architecture CST 250
Circuits & Boolean Expressions
CSE 140 : Components and Design Techniques for Digital Systems
Karnaugh Maps (K-Maps)
Computer Science 210 Computer Organization
Combinational Logic Design Process
Circuits, Truth Tables & Boolean Algebra
Example Question: Consider the expressions: (a) F = XY + XY'
Logic Gates.
ECB2212-Digital Electronics K-Map
1 Analysis and design for combinational logic circuit
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
Laws & Rules of Boolean Algebra
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

Logic Problem 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=Key B=Door C=Seatbelt A B C X 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 Boolean Expression Is: ABC + ABC + ABC=X 1 ABC 1 ABC 1 ABC

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

Create Circuit Schematic X

NAND Only Solution

CircuitMaker Demo