Mixed Logic A B A B. 1. Ignore all bubbles on logic gates and inverters. This means



Similar documents
1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.

Basic Logic Gates Richard E. Haskell

Gates, Circuits, and Boolean Algebra

Lecture 5: Gate Logic Logic Optimization

ENGI 241 Experiment 5 Basic Logic Gates

Elementary Logic Gates

earlier in the semester: The Full adder above adds two bits and the output is at the end. So if we do this eight times, we would have an 8-bit adder.

Gates & Boolean Algebra. Boolean Operators. Combinational Logic. Introduction

Lecture 12: More on Registers, Multiplexers, Decoders, Comparators and Wot- Nots

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

Binary Adders: Half Adders and Full Adders

Flip-Flops, Registers, Counters, and a Simple Processor

Ladder and Functional Block Programming

So far we have investigated combinational logic for which the output of the logic devices/circuits depends only on the present state of the inputs.

Sum-of-Products and Product-of-Sums expressions

ELEC EXPERIMENT 1 Basic Digital Logic Circuits

Digital circuits make up all computers and computer systems. The operation of digital circuits is based on

(1) /30 (2) /30 (3) /40 TOTAL /100

Adder.PPT(10/1/2009) 5.1. Lecture 13. Adder Circuits

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

These help quantify the quality of a design from different perspectives: Cost Functionality Robustness Performance Energy consumption

Topics of Chapter 5 Sequential Machines. Memory elements. Memory element terminology. Clock terminology

NEW adder cells are useful for designing larger circuits despite increase in transistor count by four per cell.

1.6 The Order of Operations

Chapter 2 Logic Gates and Introduction to Computer Architecture

Lecture 8: Synchronous Digital Systems

Having read this workbook you should be able to: recognise the arrangement of NAND gates used to form an S-R flip-flop.

Chapter 10 Advanced CMOS Circuits

Sequential Logic: Clocks, Registers, etc.

Let s explore the content and skills assessed by Heart of Algebra questions.

Measurement with Ratios

Two's Complement Adder/Subtractor Lab L03

Digital Logic Design. Basics Combinational Circuits Sequential Circuits. Pu-Jen Cheng

L4: Sequential Building Blocks (Flip-flops, Latches and Registers)

Solution to Exercise 2.2. Both m and n are divisible by d, som = dk and n = dk. Thus m ± n = dk ± dk = d(k ± k ),som + n and m n are divisible by d.

CSE140 Homework #7 - Solution

Hypothesis Testing for Beginners

ModuMath Basic Math Basic Math Naming Whole Numbers Basic Math The Number Line Basic Math Addition of Whole Numbers, Part I

CHAPTER 11: Flip Flops

BOOLEAN ALGEBRA & LOGIC GATES

Gates. J. Robert Jump Department of Electrical And Computer Engineering Rice University Houston, TX 77251

Digital Electronics Detailed Outline

Lab 1: Full Adder 0.0

Small Signal Analysis of a PMOS transistor Consider the following PMOS transistor to be in saturation. Then, 1 2

3.1. RATIONAL EXPRESSIONS

Step Response of RC Circuits

Combinational Logic Design Process

Series and Parallel Circuits

Using Logic to Design Computer Components

COMBINATIONAL CIRCUITS

Counters and Decoders

Click on the links below to jump directly to the relevant section

Let s put together a Manual Processor

7.7 Solving Rational Equations

Set Theory: Shading Venn Diagrams

To give it a definition, an implicit function of x and y is simply any relationship that takes the form:

Chapter 4 Register Transfer and Microoperations. Section 4.1 Register Transfer Language

Solving Systems of Linear Equations

SEQUENTIAL CIRCUITS. Block diagram. Flip Flop. S-R Flip Flop. Block Diagram. Circuit Diagram

Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)

CS311 Lecture: Sequential Circuits

Part 1 Expressions, Equations, and Inequalities: Simplifying and Solving

Factorizations: Searching for Factor Strings

Introduction to CMOS VLSI Design

2 SYSTEM DESCRIPTION TECHNIQUES

2011, The McGraw-Hill Companies, Inc. Chapter 5

Cartesian Products and Relations

GETTING STARTED WITH PROGRAMMABLE LOGIC DEVICES, THE 16V8 AND 20V8

Digital Logic Elements, Clock, and Memory Elements

ECE410 Design Project Spring 2008 Design and Characterization of a CMOS 8-bit Microprocessor Data Path

Relative and Absolute Change Percentages

A Short Discussion on Summing Busses and Summing Amplifiers By Fred Forssell Copyright 2001, by Forssell Technologies All Rights Reserved

WRITING PROOFS. Christopher Heil Georgia Institute of Technology

OA3-10 Patterns in Addition Tables

Mathematics Task Arcs

7. Latches and Flip-Flops

The 104 Duke_ACC Machine

Scatter Plots with Error Bars

Chapter 11 Number Theory

6. BOOLEAN LOGIC DESIGN

Simple Regression Theory II 2010 Samuel L. Baker

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Algebra. Exponents. Absolute Value. Simplify each of the following as much as possible. 2x y x + y y. xxx 3. x x x xx x. 1. Evaluate 5 and 123

Optimization and Comparison of 4-Stage Inverter, 2-i/p NAND Gate, 2-i/p NOR Gate Driving Standard Load By Using Logical Effort

FORDHAM UNIVERSITY CISC Dept. of Computer and Info. Science Spring, Lab 2. The Full-Adder

Integer Operations. Overview. Grade 7 Mathematics, Quarter 1, Unit 1.1. Number of Instructional Days: 15 (1 day = 45 minutes) Essential Questions

Introduction to Digital System Design

2.1 Increasing, Decreasing, and Piecewise Functions; Applications

The Deadly Sins of Algebra

Introduction to Fractions

Analog & Digital Electronics Course No: PH-218

Product Mix as a Framing Exercise: The Role of Cost Allocation. Anil Arya The Ohio State University. Jonathan Glover Carnegie Mellon University

Voltage, Current, Resistance, Capacitance and Inductance

Two-level logic using NAND gates

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

Functions. MATH 160, Precalculus. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Functions

Karnaugh Maps. Circuit-wise, this leads to a minimal two-level implementation

EGR 278 Digital Logic Lab File: N278L3A Lab # 3 Open-Collector and Driver Gates

Fourth generation techniques (4GT)

Gate Delay Model. Estimating Delays. Effort Delay. Gate Delay. Computing Logical Effort. Logical Effort

Transcription:

Mixed Logic Introduction Mixed logic is a gate-level design methodology used in industry. It allows a digital logic circuit designer the functional description of the circuit from its physical implementation. or example, consider the function: = This is a functional description. Two possible physical implementations are listed below, one using a NN gate and inverters, the other using a gate and inverters: NN oth of the above circuits implement the same function, but are different physical implementations. Which is easier to read? Ideally, the implementation of the circuit should not affect your ability to figure out what the circuit does. The goal of mixed logic design is to:. Separate what the circuit does from how it does it ; and 2. support self-documenting circuits. nalysis efore getting into the details of how to design a mixed-logic circuit, let us modify the circuit of the preceeding example to see how mixed-logic notation works. Using mixed-logic notation, the above circuits are now illustrated as: NN Note the vertical bars with the bubbles in both circuits. They do not represent physical circuit elements they are simply a form of notation. To read a circuit using mixed logic notation:. Ignore all bubbles on logic gates and inverters. This means (a) Read all NNs and Ns as Ns ; (b) read all s and ORs as ORs ; and (c) ignore all inverters. 2. Wherever you see a vertical bar with a bubble, take the complement.

invert input Thus when reading the circuit left to right, a bar should exist everywhere that a complement exists in the corresponding logic equation. y not worry about everywhere a physical inversion takes place, it is much easier to read the function implemented by the circuit. In both examples above, is complemented yielding. Ignoring all inverters and treating both logic gates as an N, the output of the gate is. Inverting the output by the vertical bar after the logic gates results in. esign Mixed logic design is based on the key observation of emorgan s theorem: logical operations have equivalencies when their inputs and outputs are inverted. emorgan s square, shown below, illustrates the equivalencies of the four basic gate types. invert output N NN OR Inverting the output of the gate moves horizontally in the square. Moving vertically is accomplished by inverting all gate inputs (turning the truth table upside down). Each of the four fundamental gates types has both an N-based and OR-based functional equivalency, based on emorgan s theorem. You have already seen this for NN and gates, but it applies to N and OR gates as well. While it may seem counterintuitive to draw an N gate as an OR body with inverted inputs and outputs, this variation makes mixed logic design possible. 2

esign Example esign a logic circuit for the function = + ( ) If implemented in a straightforward manner using traditional gate symbols, its implementation would be: What if we wanted to implement it using just NN gates? Or only NN and gates? Or any other constraint on what logic gates are used for the physical implementation? The basic design rules for implementing a mixed logic design are:. ll logic operations in the function (sum and product) become gate bodies in the circuit. (a) implement all OR operations in the logical function using the OR equivalency of the logic gate ; and (b) implement all N operations in the logical function using the N equivalency of the logic gate. Note that you can use any of the basic logic gates (NN//N/OR), depending on your design constraints. 2. raw vertical bars in the circuit where all complements in the logical function occur. raw a bubble on each bar. 3. ll bubbles in the circuit should be paired so that they cancel out. bubble may be paired with: (a) another bubble on a logic gate ; or (b) a bubble on a vertical bar. The vertical bars with bubble do not represent physical devices (like inverters), they are just a form of notation to represent a complement in the underlying function. nywhere a pairing of a bubble is not possible, place an inverter. Now your circuit implementation is complete. To illustrate mixed logic design, we will implement the function above four different ways: using NN gates and inverters, gates and inverters, N gates and inverters, and OR gates and inverters. irst, draw the circuit graphically (this is not a physical implementation), using N/OR gates for the operations and the vertical bars for the complement. s a reminder, = + ( ). 3

Now let s design it using just NN gates and inverters.. Implement the N and OR operations of the circuit using the corresponding equivalencies of the NN gate. 2. raw vertical bars (with bubble) in the circuit where all complements of the logic function occur. raw a bubble on each bar. 3. ll bubbles in the circuit should be paired so that they cancel out. bubble may be paired with: (a) another bubble on a logic gate ; or (b) a bubble on a vertical bar. You re done! You ve now implemented the circuit using 2 NN gates and 3 inverters, which requires 4 transistors (4 each for the NN gates, 2 each for the inverters). The circuit is also self-documenting, in that by ignoring the inverters and bubbles on the gates and just paying attention to the vertical bars, you can easily read off the function being implemented. The figure below shows 4 different circuit implementations of this function, each using a different type of gate (NN,, N, OR). ll circuits implement the same function. The first is the example that you just saw. lso shown with each circuit is the transistor count for that particular implementation. 4

NN (4) (4) N (8) OR (4) Note that three of the four circuits have similar transistor counts, while the N-based implementation requires more. Why would you choose a particular implementation? There are three general reasons.. To reduct transistor count. 2. omponent reuse. Prior to the development of programmable logic, digital circuit boards were implemented entirely with chips (integrated circuits, or Is) that would have a fixed number of gates on them. or example, an I called a 74 is a quad 2-input NN gate. It has 4 NN gates on it that can be wired up to other Is. If the designer had one spare NN gate unallocated on an I, she may choose to fit it into a circuit design rather than add another chip to the circuit board. While this is not used as much in practice today, many real-world design projects today often require re-designing or reverse engineering older circuit implementations that have used such techniques. 3. More component reuse. Today, technologies such as programmable devices, field-programmable gates arrays (PGs), and very-large scale integrated circuits (VLSI), allow very high density logic programming on individual chips. t this level of density, logic design is typically done using software development tools, and designers typically have libraries of parts pre-designed for particular sub-circuits or functional implementations. esign Example 2 onsider implementing the function using just gates. = ( + ) ( + ) gain, the form of the functional expression is independent of implementation. irst represent the function graphically: 5

While not an implementation, this circuit shows the logical combination of the inputs that yields the appropriate output. The bars represent where an inversion of the signal is required, and correspond to the complementing bars in the actual function. This basic structure remains unchanged regardless of the gate types used to implement it. To realize an implementation using gates, again follow the mixed-logic design procedure. irst, replace all the gates with the N/OR equivalency for the gate. Second, place vertical bars with bubbles where each complement should occur. Third, add inverters where necessary so that all bubbles are paired up. Your final implementation should look like: you can draw an inverter like this if you wish... There is no reason why we are constrained to using one particular type of gate. The circuit below implements the same function using NN gates for the OR terms and gates for the N terms. NN NN esign Example 3 Here s another example, showing a circuit implemented with just gates using mixed-logic notation. 6

Thanks to mixed-logic notation, it is relatively easy to extract the implemented function. Reading the circuit from left to right, ignoring all bubble and complementing where vertical bars occur: = ( + ( )) (( ) + ) The fact that this implementation includes only gates neither changes nor distorts the behavior of the circuit. Not the common subexpression (( ) used in two places in the circuit. When bubbles are added to an output wire that is used in multiple places (fanout > ), multiple bubbles on the consumerend must be added to match the bubble on the producer-end. This can be seen when this circuit is re-implemented using just NN gates. Summary In summary, mixed logic design:. ecouples the behavior of a circuit from its physical implementation ; 2. supports self-documenting circuits ; 3. provides a simple process to re-implement a circuit using different gate types. 7