Combinational Logic Design. 2 Combinational Circuits A combinational logic circuit has: ♦ A set of m Boolean inputs, ♦ A set of n Boolean outputs ♦ n.

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

Combinational Logic Word Problems
COE 202: Digital Logic Design Combinational Circuits Part 1
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.
1 Combinational Logic Design&Analysis. 2 Introduction We have learned all the prerequisite material: – Truth tables and Boolean expressions describe functions.
ECE2030 Introduction to Computer Engineering Lecture 9: Combinational Logic, Mixed Logic Prof. Hsien-Hsin Sean Lee School of Electrical and Computer Engineering.
Exclusive-OR and Exclusive-NOR Gates
Combinational Logic and Verilog. XORs and XNORs XOR.
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.
08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:
CPEN Digital System Design
Henry Hexmoor1 Chapter 3 Henry Hexmoor Types of Logic Circuits Combinational logic circuits: –Outputs depend only on its current inputs. –A combinational.
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 3 – Combinational.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 3 – Combinational Logic Design Part 1 –
COE 202: Digital Logic Design Combinational Circuits Part 1
Chapter 3 Combinational Logic Design
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 3 – Combinational Logic Design Part 1 –
Combinational Logic Design
Overview Part 1 – Design Procedure 3-1 Design Procedure
In this module you will learn: What the various logic gates do. How to represent logic gates on a circuit diagram. The truth tables for the logic gates.
Digital Logic Lecture 08 By Amr Al-Awamry. Combinational Logic 1 A combinational circuit consists of an interconnection of logic gates. Combinational.
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Lecture 11 – Design Concepts.
Combinational Logic Design CS341 Digital Logic and Computer Organization F2003.
Module 3.  Binary logic consists of :  logic variables  designated by alphabet letters, e.g. A, B, C… x, y, z, etc.  have ONLY 2 possible values:
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Lecture 12 – Design Procedure.
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.
NOCTI Review Lesson 4 Objectives:
SUPLEMENTARY CHAPTER 1: An Introduction to Digital Logic The Architecture of Computer Hardware and Systems Software: An Information Technology Approach.
Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.
Digital Components and Combinational Circuits Sachin Kharady.
1 Combinational Logic Design Digital Computer Logic Kashif Bashir
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 3 – Combinational Logic Design Part 1 –
Exclusive OR Gate. Logically, the exclusive OR (XOR) operation can be seen as either of the following operations:exclusive OR (XOR) 1. A AND NOT B OR.
+ CS 325: CS Hardware and Software Organization and Architecture Gates and Boolean Algebra Part 2.
Gates and Logic Dr John Cowell phones off (please)
Chapter 0 deSiGn conCepTs EKT 221 / 4 DIGITAL ELECTRONICS II.
EE 5900 Advanced Algorithms for Robust VLSI CAD, Spring 2009 Combinational Circuits.
1 CS 151: Digital Design Chapter 3: Combinational Logic Design 3-1Design Procedure CS 151: Digital Design.
CS151 Introduction to Digital Design Chapter 3: Combinational Logic Design 3-1 Design Procedure 1Created by: Ms.Amany AlSaleh.
Combinational Logic Design. 2 Combinational Circuits A combinational logic circuit has: ♦ A set of m Boolean inputs, ♦ A set of n Boolean outputs ♦ n.
CHAPTER 5 Combinational Logic Analysis
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR and parity check Circuits.
1 CS151: Digital Design Chapter 3: Combinational Logic Design 3-2 Beginning Hierarchical Design 3-3 Technology Mapping.
C OMBINATIONAL L OGIC D ESIGN 1 Eng.Maha AlGubali.
Logic Design (CE1111 ) Lecture 4 (Chapter 4) Combinational Logic Prepared by Dr. Lamiaa Elshenawy 1.
Circuit Synthesis A logic function can be represented in several different forms:  Truth table representation  Boolean equation  Circuit schematic 
Combinational Design, Part 2: Procedure. 2 Topics Positive vs. negative logic Design procedure.
Lecture 1 Gunjeet kaur Dronacharya group of institutions.
2016/7/21 Haifeng Liu 2014 Fall College of Computer Science and Technology, Zhejiang University Chapter 3 Combinational Logic Design.
CS151 Introduction to Digital Design Chapter 3: Combinational Logic Design 3-4 Verification 1Created by: Ms.Amany AlSaleh.
Overview Part 1 – Design Procedure Part 2 – Combinational Logic
Combinational Logic Design
Combinational Circuits
Transistors and Logic Circuits
Combinational Logic Design&Analysis.
Logic Gates.
Exclusive OR Gate.
Overview Part 1 – Design Procedure Beginning Hierarchical Design
Computer Architecture CST 250
Chapter 3 – Combinational Logic Design
Logic Gates.
Chapter 3 – Combinational Logic Design
Design Example “Date of Birth Problem”
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
Today You are Learning simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT.
Chapter 10.3 and 10.4: Combinatorial Circuits
Combinational Circuits
Combinational Circuits
Combinational Circuit Design
Presentation transcript:

Combinational Logic Design

2 Combinational Circuits A combinational logic circuit has: ♦ A set of m Boolean inputs, ♦ A set of n Boolean outputs ♦ n switching functions, each mapping the 2 m input combinations to an output such that the current output depends only on the current input values A block diagram m Boolean Inputs n Boolean Outputs Combinatorial Logic Circuit

3 Design Procedure 1.Specification Write a specification for the circuit if one is not already available 2.Formulation Derive a truth table or initial Boolean equations that define the required relationships between the inputs and outputs, if not in the specification Apply hierarchical design if appropriate (more later)

4 Design Procedure 3. Optimization Apply 2-level and multiple-level optimization Draw a logic diagram for the resulting circuit using ANDs, ORs, and inverters

5 Design Procedure 4.Technology Mapping Map the logic diagram or netlist to the implementation technology selected 5.Verification Verify the correctness of the final design manually or using simulation

6 Hierarchical Design  Objective: To control the complexity of each function which is mapping inputs to outputs Decompose the function into smaller pieces called blocks Decompose each block’s function into smaller blocks, repeating as necessary until all blocks are small enough Any block not decomposed is called a primitive block The collection of all blocks including the decomposed ones is a hierarchy

7 Spring 2008 Example: 9-input even parity checker Design a 9-input function to check even parity for byte ♦ Chapter 2: Use odd function circuit to check even parity

8 Spring 2008 We know how to design a 3- input odd function

9 We know how to design an XOR  A NAND only implementation is: X Y X Y

10 Spring 2008 Design Hierarchy

11 Spring 2008 Components in Design The blocks that must be designed

12 Spring input parity tree (continued) Top Level: 9 inputs, one output 2nd Level: Four 3-bit odd funcions in two levels 3rd Level: Two 2-bit exclusive-OR functions Primitive block, XOR gate: Four 2- input NAND gates Design requires {4 X (2 X 4)} = 32 2-input NAND gates

13 Spring 2008 Top Down Design Ideally you specify top level of design and work your way down Real life isn’t that way ♦ Work some at top ♦ Build/test some low-level blocks ♦ Go back to top level ♦ Just like real software programs Big projects (like Pentium) done with architecture and levels of simulators