Designing Combinational Logic Circuits

Slides:



Advertisements
Similar presentations
Digital Circuits.
Advertisements

COE 202: Digital Logic Design Combinational Circuits Part 1
1 Combinational Logic Design&Analysis. 2 Introduction We have learned all the prerequisite material: – Truth tables and Boolean expressions describe functions.
ECE 331 – Digital System Design
08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:
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.
DIGITAL SYSTEMS TCE OTHER COMBINATIONAL LOGIC CIRCUITS WEEK 7 AND WEEK 8 (LECTURE 1 OF 3) COMPARATORS CODE CONVERTERS.
Chapter 3 Combinational Logic Design
Boolean Algebra. Introduction 1854: Logical algebra was published by George Boole  known today as “Boolean Algebra” 1854: Logical algebra was published.
ENGG 1203 Tutorial Combinational Logic (I) 1 Feb Learning Objectives
The NAND gate as a universal gate Logic function NAND gate only AA A B A.BA.B A B A+B A B A B A B A A A B A.BA.B B A A B A B A B.
Dr. Ahmed El-Bialy, Dr. Sahar Fawzy Combinational Circuits Dr. Ahmed El-Bialy Dr. Sahar Fawzy.
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.
KARNAUGH MAP – Digital Circuit 1 Choopan Rattanapoka.
Logic Design A Review. Binary numbers Binary numbers to decimal  Binary 2 decimal  Decimal 2 binary.
 Seattle Pacific University EE Logic System DesignSOP-POS-1 The Connection: Truth Tables to Functions abcF abcF
Computer Science 210 Computer Organization Introduction to Boolean Algebra.
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. Outline  Logic Gates  The Inverter  The AND Gate  The OR Gate  The NAND Gate  The NOR Gate  The XOR Gate  The XNOR Gate  Drawing.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
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.
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.
1 EG 32 Digital Electronics Thought for the day You learn from your mistakes..... So make as many as you can and you will eventually know everything.
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
1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.
Karnaugh Maps (K-Maps)
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
THE K-MAP.
Circuits & Boolean Expressions. A ABC BC ABC C B A Example # 1: Boolean Expression: Develop a Boolean expression from a circuit.
1 3- De-Morgan’s Theorems 1.The complement of a product of variables is equal to the sum of the complements of the variables. 2. The complement of a sum.
Karnaugh Maps (K maps).
Review. Boolean Algebra.
ECE DIGITAL LOGIC LECTURE 8: BOOLEAN FUNCTIONS Assistant Prof. Fareena Saqib Florida Institute of Technology Spring 2016, 02/11/2016.
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.
1’S COMPLEMENT REPRESENTATION 1’s complement of a number (binary) is obtained by changing all 1’s to 0 and all 0’s to 1. If one of these numbers is positive.
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?
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.
Lecture 1 Gunjeet kaur Dronacharya group of institutions.
Logic Gates and Boolean Algebra
Computer Science 210 Computer Organization
De Morgan’s Theorem,.
CHAPTER 1 : INTRODUCTION
Combinational Circuit Design
Boolean Algebra.
Boolean Expressions Lecture No. 10.
Computer Architecture CST 250
ECE 331 – Digital System Design
Circuits & Boolean Expressions
CSE 140 : Components and Design Techniques for Digital Systems
Digital Logic and Design
Karnaugh Maps (K-Maps)
BASIC & COMBINATIONAL LOGIC CIRCUIT
Circuits, Truth Tables & Boolean Algebra
Optimization Algorithm
Boolean Algebra.
ECB2212-Digital Electronics K-Map
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
3-Variable K-map AB/C AB/C A’B’ A’B AB AB’
Circuits, Truth Tables & Boolean Algebra
Principles & Applications
Laws & Rules of Boolean Algebra
Circuits & Boolean Expressions
Presentation transcript:

Designing Combinational Logic Circuits Unit 3 Designing Combinational Logic Circuits

Design of logic circuit is possible when the desired output level of the logic circuit is displayed in a truth table. From the truth table, the Boolean expression is derived and using Boolean algebra to simplify the expression.

Example 1 Circuit design Output X is only for the case where A = 0 & B = 1. A/An AND gate is used with inputs A & B, so that X = AB Circuit design

Example 2 Circuit design Output X is 1 when A = 0, B = 1 OR A = 1, B = 0 Circuit design

Example 3 Circuit design

General procedure for obtaining the output expression (SOP form) from a truth table: Write an AND term for each case in the table where the output is 1. Each AND term contains each input variable in either inverted or non-inverted form. If the variable is ‘0’ for that particular case in the table, it is inverted in the AND term. All the AND terms are then ORed together to produce the final expression for the output.

Exercises Design a logic circuit that has three inputs A, B and C and whose output will be high only when a majority of the input is high. Solution: Truth table Boolean Algebra X = ABC + ABC + ABC + ABC X = ABC + ABC + AB X = ABC + A(BC + B) A(C + B) X = ABC + AC + AB X = AC C(AB + A) C(B + A) + BC + AB

K Map AB + AC + BC Circuit Design AB AC = AB + AC + BC BC

Four logic signal lines A, B, C and D are used to represent a 4-bit binary number with A as MSB and D the LSB. The binary inputs are fed to a logic circuit that produces a HIGH output only when the binary number is greater than 01102 = 610. Design this circuit. Truth table Boolean Algebra X = ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD X = ABC + ABC + ABC + ABC + ABC X = ABC + AB + AB X = ABC + A

K Map A + AC Circuit Design A = A + AC AC

END