SOP and POS Forms Notation.

Slides:



Advertisements
Similar presentations
Switching circuits Composed of switching elements called “gates” that implement logical blocks or switching expressions Positive logic convention (active.
Advertisements

L14: Boolean Logic and Basic Gates
Chapter3: Gate-Level Minimization Part 2
Introduction to Logic Circuits
Combinational Logic Word Problems
Combinational Circuits
Documentation Standards
Functions and Functional Blocks
CSIS 3510 Computer Organization and Architecture Topics covered in this lecture: –Review of De’Morgan’s Theorem –Using De’Morgan’s Theorem –Building a.
Logical Systems Synthesis.
Boolean Algebra and Combinational Logic
CS 151 Digital Systems Design Lecture 6 More Boolean Algebra A B.
Contemporary Logic Design Two-Level Logic © R.H. Katz Transparency No. 3-1 Chapter #2: Two-Level Combinational Logic Section 2.1, Logic Functions.
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.

Combinational Logic Design Process
Digital Design Copyright © 2006 Frank Vahid 1 Digital Design Chapter 2: Combinational Logic Design Slides to accompany the textbook Digital Design, First.
CSCE 211: Digital Logic Design
Digital Design - Combinational Logic Design Chapter 2 - Combinational Logic Design.
Chapter 2 Combinational Systems And / Or / Not. TRIAD PRINCIPLE: Combinational is about And / Or / Not combinations As well as equivalent functions. It.
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices Decoders.
1 COMBINATIONAL LOGIC One or more digital signal inputs One or more digital signal outputs Outputs are only functions of current input values (ideal) plus.
CS 352 : Computer Organization and Design University of Wisconsin-Eau Claire Dan Ernst Elementary Digital Logic Apps O/S Arch  Arch Logic Digital Analog.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Transistors and Logic Circuits. Transistor control voltage in voltage out control high allows current to flow -- switch is closed (on) control low stops.
Logic Gates How Boolean logic is implemented. Transistors used as switches to implement Boolean logic: ANDOR Logic with Transistors.
 Seattle Pacific University EE Logic System DesignSOP-POS-1 The Connection: Truth Tables to Functions abcF abcF
1 Digital Logic Design Week 5 Simplifying logic expressions.
Apr. 3, 2000Systems Architecture I1 Systems Architecture I (CS ) Lecture 3: Review of Digital Circuits and Logic Design Jeremy R. Johnson Mon. Apr.
EEL-3705 TPS QUIZZES. Quiz 2-1 Use a Venn Diagram to show.
Logic and Computer Design Simon Petruc-Naum CS 147 – Dr. S.M. Lee.
IT253: Computer Organization Lecture 7: Logic and Gates: Digital Design Tonga Institute of Higher Education.
Chapter 2 Two- Level Combinational Logic. Chapter Overview Logic Functions and Switches Not, AND, OR, NAND, NOR, XOR, XNOR Gate Logic Laws and Theorems.
Unit 1 Minimization Techniques and Logic Gates. Introduction to Digital Systems Analog devices and systems process time-varying signals that can take.
Computer Organization and Design Transistors & Logic - II Montek Singh Wed, Oct 16, 2013 Lecture 10.
ENGIN112 L6: More Boolean Algebra September 15, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 6 More Boolean Algebra A B.
1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.
Fundamentals of digital electronics Prepared by - Anuradha Tandon Assistant Professor, Instrumentation & Control Engineering Branch, IT, NU.
CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.
CEC 220 Digital Circuit Design SOP and POS forms Friday, Sept 11 CEC 220 Digital Circuit Design Slide 1 of 17.
Discrete Systems I Lecture 09 Minterms and Decoders Profs. Koike and Yukita.
Digital Logic & Design Dr. Waseem Ikram Lecture 09.
CHAPTER 7 MULTI-LEVEL GATE CIRCUITS / NAND AND NOR GATES
COSC3330 Computer Architecture Lecture 2. Combinational Logic
Logic Gates and Boolean Algebra
Transistors and Logic Circuits
CS 105 Digital Logic Design
Logic Gates.
Boolean Algebra and Combinational Logic
Lecture 9 Logistics Last lecture Today HW3 due Wednesday
Princess Sumaya University
CHAPTER 3 SETS AND BOOLEAN ALGEBRA
Jeremy R. Johnson Wed. Sept. 29, 1999
ECE 331 – Digital System Design
Reading: Hambley Chapters
Digital Logic and Design
Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan
Boolean Algebra.
Digital Logic & Design Dr. Waseem Ikram Lecture 13.
Lecture 8 Logistics Last lecture Last last lecture Today
CSE 370 – Winter Combinational Implementation - 1
Functions Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways: We can represent.
Logic Gates.
Logic Gates.
3-Variable K-map AB/C AB/C A’B’ A’B AB AB’
Digital System Design Combinational Logic
Analysis of Logic Circuits Example 1
Chapter 2 Digital Design and Computer Architecture, 2nd Edition
ECE 352 Digital System Fundamentals
Presentation transcript:

SOP and POS Forms Notation

SOP Given a Table of Combinations What is the SOP form for the following 3 input / 1 output digital device? S A B f 1

Computing the SOP (2) This SOP has 4 minterms: f = S'AB' + S'AB + SA'B + SAB S A B f minterm name 1 m2 m3 m5 m7

Canonical SOP Boolean functions can use shorthand notation when in SOP form: f = S'AB' + S'AB + SA'B + SAB f(S,A,B) = (m2,m3,m5,m7) or f(S,A,B) = m(2,3,5,7)

Canonical SOP Example f(x1,x2,x3) = m(1,4,5,6) f = minterm x1 x2 x3 f 1 2 3 4 5 6 7 x1'x2'x3 + x1x2'x3' + x1x2'x3 + x1x2x3'

Product of Sums Form An alternate canonical “two-level” format “Product of sums”  POS Two levels OR level followed by AND level Again, NOT doesn’t count as a level Not a common as SOP, but can be useful in some situations Which ones?

Computing the POS Identify rows with “0” on output (f = 0) Represent the input for each 0 row as a maxterm A logical “sum” of the input bits which guarantees that term will be “0” (sum of literals) A B f 1

Canonical POS Example f(x1,x2,x3) = (M0,M2,M3,M7) = M(0,2,3,7) f = maxterm x1 x2 x3 f 1 2 3 4 5 6 7 (x1+x2+x3)(x1+x2'+x3)(x1+x2'+x3')(x1'+x2'+x3')

Example: 3 Way Light Control L(A,B,C) = m(5,6) or L(A,B,C) = M(0,1,2,3,4,7) SOP: L = POS: A B C L 1 (A B' C)+(A B C') (A+B+C)(A+B+C') (A+B'+C)(A+B'+C') (A'+B+C)(A'+B'+C')

Question: Under what conditions would POS form be better? (assuming we aren’t doing further reductions)

Inverters in Two-Level Circuits Inverters are not always required for two-level logic This is why we do not always count them among the cost of a circuit Later, we will see that many variables will be available to us in both normal and inverted form  don't need to invert them We show them only for completeness at this point

NAND/NOR Circuits

Completeness of NAND Any Boolean function can be implemented using just NAND gates. Why? Need AND, OR, and NOT NOT: 1-input NAND (or 2-input NAND with inputs tied together) AND: NAND followed by NOT OR: NAND preceded by NOTs Likewise for NOR

Using NAND as Universal Logic NOT AND OR

SOP Using NORs & POS Using NANDs NANDs are natural for SOP networks You can extend this idea to multi-level circuits as long as the levels alternate AND/OR/AND/OR ending with OR You can implement an SOP circuit using only NOR gates All gates become NORs; just add an extra “inverter” following the final NOR NORs are natural for POS networks You can extend this idea to multi-level circuits as long as the levels alternate OR/AND/OR/AND ending with AND You can implement a POS circuit using only NAND gates All gates become NANDs; just add an extra inverter following the final NAND

SOP Using NAND Networks SOP can be implemented with just NAND gates “pushing the bubbles” Every gate just becomes a NAND! x 1 2 3 4 5

2x1 MUX Using NANDs Implement f = S'A + SB with NAND gates only This one is complicated by the inverter on S!

POS Using NOR Networks POS can be implemented with just NOR gates Every gate just becomes a NOR x 1 2 3 4 5

Schematics of DeMorgan’s Laws (x ∙ y)' = x' + y' (x + y)' = x' ∙ y'

Universal Logic Families Any logic function can be designed using only: AND, OR, NOT NAND NOR These are called “universal logic families” Actual components are often designed using either NAND or NOR gates only NAND and NOR require fewer transistors to build Just having a single gate design is simpler than having 3!

AND/OR Networks  NAND/NAND Convert multi-level AND/OR net  NAND/NAND

And Again … But Be Careful conserve the polarity of the input/output signals

Some Useful Circuits

Decoders and Multiplexors Decoder: Popular combinational logic building block, in addition to logic gates Converts input binary number to one high output 2-input decoder: four possible input binary numbers So has four outputs, one for each possible input binary number Internal design AND gate for each output to detect input combination Decoder with enable e Outputs all 0 if e=0 Regular behavior if e=1 n-input decoder: 2n outputs i0 i1 d0 d1 d2 d3 1 i0 d0 d1 d2 d3 i1 i0 i1 d0 d1 d2 d3 e 1 i1’i0’ i1’i0 i1i0’ i1i0

Multiplexor (Mux) Mux: Another popular combinational building block Routes one of its N data inputs to its one output, based on binary value of select inputs 4 input mux  needs 2 select inputs to indicate which input to route through 8 input mux  3 select inputs N inputs  log2(N) selects Like a railyard switch

Mux Internal Design 2x1 mux 4x1 mux i0 (1*i0=i0) 1 i0 (0+i0=i0) s0 d × 1 2 × 1 2 × 1 i1 i0 s0 d 1 i0 (0+i0=i0) i0 i0 d d i1 i1 s0 s0 a 2x1 mux i0 4 × 1 i2 i1 i3 s1 s0 d 4x1 mux

Muxes Commonly Together -- N-bit Mux 2 × 1 a3 i0 Simplifying notation: d b3 i1 s0 4 4-bit 2 × 1 4 C a2 i0 2x1 d A I 4 b2 i1 s0 4 D C is short B I 1 f or 2 × 1 a1 i0 s0 d b1 i1 c3 s0 s0 c2 2 × 1 a0 i0 d c1 b0 i1 s0 s0 c0 Ex: Two 4-bit inputs: A (a3 a2 a1 a0) and B (b3 b2 b1 b0) 4-bit 2x1 mux (just four 2x1 muxes sharing a select line) can select between A or B

N-bit Mux Example Four possible display items Temperature (T), Average miles-per-gallon (A), Instantaneous mpg (I), and Miles remaining (M) -- each is 8-bits wide Choose which to display using two inputs x and y Use 8-bit 4x1 mux