Overview Part 1 – Design Procedure Part 2 – Combinational Logic

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 2 – Combinational.
Other Gate Types COE 202 Digital Logic Design Dr. Aiman El-Maleh
Combinational Circuits
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.
CPT 310 Logic and Computer Design Instructor: David LublinerPhone Engineering Technology Dept.Cell
Overview Part 3 – Additional Gates and Circuits 2-8 Other Gate Types
Combinational Circuits
CPEN Digital System Design
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 –
Design Of Combinational Logic Circuits
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 3 – Combinational Logic Design Part 1 –
Overview Part 1 – Design Procedure 3-1 Design Procedure
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.
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.
Combinational Logic Design BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 3 – Combinational Logic Design Part 1 –
Chapter 33 Basic Logic Gates. 2 Objectives –After completing this chapter, the student should be able to: Identify and explain the function of the basic.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
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.
Design Concepts By Deepika Chaudhary.
Chapter 0 deSiGn conCepTs EKT 221 / 4 DIGITAL ELECTRONICS II.
Technology Mapping. 2 Technology mapping is the phase of logic synthesis when gates are selected from a technology library to implement the circuit. Technology.
EE 5900 Advanced Algorithms for Robust VLSI CAD, Spring 2009 Combinational Circuits.
CS151 Introduction to Digital Design Chapter 2: Combinational Logic Circuits 2-9 Exclusive-OR Operator and Gates 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.
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR and parity check Circuits.
Logic Gates Chapter 5 Subject: Digital System Year: 2009.
Chapter 0 ComBinaTionaL loGic deSign ComBinaTionaL loGic deSign EKT 221 / 4 DIGITAL ELECTRONICS II.
1 CS151: Digital Design Chapter 3: Combinational Logic Design 3-2 Beginning Hierarchical Design 3-3 Technology Mapping.
Chapter 33 Basic Logic Gates. Objectives After completing this chapter, you will be able to: –Identify and explain the function of the basic logic gates.
Combinational Logic Design. 2 Combinational Circuits A combinational logic circuit has: ♦ A set of m Boolean inputs, ♦ A set of n Boolean outputs ♦ n.
2016/7/21 Haifeng Liu 2014 Fall College of Computer Science and Technology, Zhejiang University Chapter 3 Combinational Logic Design.
Overview Part 1 - Implementation Technology and Logic Design
MULTI-LEVEL GATE CIRCUITS / NAND AND NOR GATES
Combinational Logic Design
Combinational Logic Design
ECE 3130 Digital Electronics and Design
Overview Part 1 – Logic Circuits and Boolean Functions
Lecture #6 EGR 277 – Digital Logic
EE2174: Digital Logic and Lab
2-6 Exclusive-OR Operator and Gates
Overview Part 1 – Gate Circuits and Boolean Equations
PROPAGATION DELAY.
Exclusive OR Gate.
Overview Part 1 – Design Procedure Beginning Hierarchical Design
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Principles & Applications
Figure 5. 1 An example of AND-OR logic
King Fahd University of Petroleum and Minerals
CSE 370 – Winter Combinational Implementation - 1
Chapter 3 – Combinational Logic Design
Chapter 3 – Combinational Logic Design
Sungho Kang Yonsei University
Overview Part 3 – Additional Gates and Circuits
KS4 Electricity – Electronic systems
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
DIGITAL ELECTRONICS B.SC FY
Overview Part 3 – Additional Gates and Circuits 2-8 Other Gate Types
Chapter 10.3 and 10.4: Combinatorial Circuits
Combinational Circuits
This chapter in the book includes: Objectives Study Guide
Combinational Circuits
Department of Electronics
Logic Gates By: Asst Lec. Besma Nazar Nadhem
Combinational Circuit Design
Course Title : Digital Electronics -1 Course No.: 6841 Course Teacher:Engr: Suvadra Chowdhury Chief Instructor Chittagong Mohila –Polytechnic Institute.
Presentation transcript:

Overview Part 1 – Design Procedure Part 2 – Combinational Logic Beginning Hierarchical Design Technology Mapping - AND, OR, and NOT to NAND or NOR Part 2 – Combinational Logic Part 3 – Arithmetic Functions

3-1 Beginning Hierarchical Design To control the complexity of the function 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 Example: 9-input parity tree (see next slide) Top Level: 9 inputs, one output 2nd Level: Four 3-bit odd parity trees in two levels 3rd Level: Two 2-bit exclusive-OR functions Primitives: Four 2-input NAND gates Design requires 4 X 2 X 4 = 32 2-input NAND gates

Hierarchy for Parity Tree Example 3-1 Beginning Hierarchical Design Hierarchy for Parity Tree Example X X X 1 X 2 9-Input X 3 odd Z X 4 O X 5 function X 6 A X 3-Input X 7 X A odd 8 1 1 B O function (a) Symbol for circuit X A 2 2 X A A 3 3-Input 3-Input X A odd 4 1 B O A odd 1 B Z function function O O X A A 5 2 2 X A 6 3-Input X A odd 7 1 B O function X A 8 2 (b) Circuit as interconnected 3-input odd function blocks A A B 1 O A 2 (c) 3-input odd function circuit as interconnected exclusive-OR blocks (d) Exclusive-OR block as interconnected NANDs

3-1 Beginning Hierarchical Design Reusable Functions Whenever possible, we try to decompose a complex design into common, reusable function blocks These blocks are verified and well-documented placed in libraries for future use

Example 3-1 Design of 4-Bit Equality Comparator

Hierarchical Diag. for 4-bit Equality Comparator

Top-Down versus Bottom-Up 3-1 Beginning Hierarchical Design Top-Down versus Bottom-Up A top-down design proceeds from an abstract, high-level specification to a more and more detailed design by decomposition and successive refinement A bottom-up design starts with detailed primitive blocks and combines them into larger and more complex functional blocks Design usually proceeds top-down to known building blocks ranging from complete CPUs to primitive logic gates or electronic components. Much of the material in this chapter is devoted to learning about combinational blocks used in top-down design.

3-2 Technology Mapping Mapping Procedures To NAND gates To NOR gates Mapping to multiple types of logic blocks covered in the reading supplement: Advanced Technology Mapping.

Mapping to NAND gates Assumptions: The mapping is accomplished by: 3-2 Technology Mapping Mapping to NAND gates Assumptions: Gate loading and delay are ignored Cell library contains an inverter and n-input NAND gates, n = 2, 3, … An AND, OR, inverter schematic for the circuit is available The mapping is accomplished by: Replacing AND and OR symbols, Pushing inverters through circuit fan-out points, and Canceling inverter pairs

NAND Mapping Algorithm 3-2 Technology Mapping NAND Mapping Algorithm Replace ANDs and ORs: Repeat the following pair of actions until there is at most one inverter between : A circuit input or driving NAND gate output, and The attached NAND gate inputs.

NAND Mapping Example (Example 3-2) 3-2 Technology Mapping NAND Mapping Example (Example 3-2)

Mapping to NOR gates Assumptions: The mapping is accomplished by: 3-2 Technology Mapping Mapping to NOR gates Assumptions: Gate loading and delay are ignored Cell library contains an inverter and n-input NOR gates, n = 2, 3, … An AND, OR, inverter schematic for the circuit is available The mapping is accomplished by: Replacing AND and OR symbols, Pushing inverters through circuit fan-out points, and Canceling inverter pairs

NOR Mapping Algorithm Replace ANDs and ORs: 3-2 Technology Mapping NOR Mapping Algorithm Replace ANDs and ORs: Repeat the following pair of actions until there is at most one inverter between : A circuit input or driving NAND gate output, and The attached NAND gate inputs.

NOR Mapping Example (Example 3-3) 3-2 Technology Mapping NOR Mapping Example (Example 3-3) A A B B 2 X 1 F C C F 3 D D E E (a) A (b) B C F D E (c)