Digital Circuits and Systems

Similar documents
Chapter 2: Boolean Algebra and Logic Gates. Boolean Algebra

Boolean Algebra Part 1

CSE140: Midterm 1 Solution and Rubric

Karnaugh Maps & Combinational Logic Design. ECE 152A Winter 2012

CSEE 3827: Fundamentals of Computer Systems. Standard Forms and Simplification with Karnaugh Maps

BOOLEAN ALGEBRA & LOGIC GATES

United States Naval Academy Electrical and Computer Engineering Department. EC262 Exam 1

CDA 3200 Digital Systems. Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012

CSE140: Components and Design Techniques for Digital Systems

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

Logic Reference Guide

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

Simplifying Logic Circuits with Karnaugh Maps

Polynomials. Jackie Nicholas Jacquie Hargreaves Janet Hunter

CH3 Boolean Algebra (cont d)

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

Boolean Algebra. Boolean Algebra. Boolean Algebra. Boolean Algebra

CHAPTER 7: FACTORING POLYNOMIALS

Logic in Computer Science: Logic Gates

Two-level logic using NAND gates

Gates, Circuits, and Boolean Algebra

Introduction. The Quine-McCluskey Method Handout 5 January 21, CSEE E6861y Prof. Steven Nowick

Switching Algebra and Logic Gates

A single register, called the accumulator, stores the. operand before the operation, and stores the result. Add y # add y from memory to the acc

Core Maths C2. Revision Notes

Solving Systems of Equations

Binary Adders: Half Adders and Full Adders

Boolean Algebra (cont d) UNIT 3 BOOLEAN ALGEBRA (CONT D) Guidelines for Multiplying Out and Factoring. Objectives. Iris Hui-Ru Jiang Spring 2010

FORDHAM UNIVERSITY CISC Dept. of Computer and Info. Science Spring, The Binary Adder

CM2202: Scientific Computing and Multimedia Applications General Maths: 2. Algebra - Factorisation

SOLUTIONS MANUAL DIGITAL DESIGN FOURTH EDITION M. MORRIS MANO California State University, Los Angeles MICHAEL D.

DESIGN OF GATE NETWORKS

Basic Logic Gates Richard E. Haskell

A Prime Investigation with 7, 11, and 13

Unit 3 Boolean Algebra (Continued)

CHAPTER 3 Boolean Algebra and Digital Logic

Scilab Textbook Companion for Digital Electronics: An Introduction To Theory And Practice by W. H. Gothmann 1

(b) (b) f 1 = x 1 x 2 ( x 3 v x 4 )

Understanding Logic Design

ELEC EXPERIMENT 1 Basic Digital Logic Circuits

Exponential and Logarithmic Functions

2.0 Chapter Overview. 2.1 Boolean Algebra

Elementary Logic Gates

x y The matrix form, the vector form, and the augmented matrix form, respectively, for the system of equations are

Karnaugh Maps (K-map) Alternate representation of a truth table

FACTORING ax 2 bx c WITH a 1

Incremental Reduction of Binary Decision Diagrams

Higher. Polynomials and Quadratics 64

SIMPLIFYING SQUARE ROOTS EXAMPLES

Combinational circuits

C H A P T E R. Logic Circuits

ENGI 241 Experiment 5 Basic Logic Gates

Lines and Planes 1. x(t) = at + b y(t) = ct + d

a. You can t do the simple trick of finding two integers that multiply to give 6 and add to give 5 because the a (a = 4) is not equal to one.

Mathematics Placement Packet Colorado College Department of Mathematics and Computer Science

How many of these intersection points lie in the interior of the shaded region? If 1. then what is the value of

A.3. Polynomials and Factoring. Polynomials. What you should learn. Definition of a Polynomial in x. Why you should learn it

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

Read-only memory Implementing logic with ROM Programmable logic devices Implementing logic with PLDs Static hazards

{ } Sec 3.1 Systems of Linear Equations in Two Variables

Definitions 1. A factor of integer is an integer that will divide the given integer evenly (with no remainder).

exclusive-or and Binary Adder R eouven Elbaz reouven@uwaterloo.ca Office room: DC3576

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

Chapter 7 Memory and Programmable Logic

SAMPLE. Polynomial functions

Combinational Logic Design Process

Combinational Logic Design

Chapter 3. if 2 a i then location: = i. Page 40

Mathematics More Visual Using Algebra Tiles

Answers to Basic Algebra Review

Properties of Real Numbers

Design Example: Counters. Design Example: Counters. 3-Bit Binary Counter. 3-Bit Binary Counter. Other useful counters:

EE360: Digital Design I Course Syllabus

Vocabulary. Term Page Definition Clarifying Example. biconditional statement. conclusion. conditional statement. conjecture.

CPM Educational Program

Digital Electronics Part I Combinational and Sequential Logic. Dr. I. J. Wassell

FACTORING ax 2 bx c. Factoring Trinomials with Leading Coefficient 1

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

Using the ac Method to Factor

A Course Material on DIGITAL PRINCIPLES AND SYSTEM DESIGN

Veterans Upward Bound Algebra I Concepts - Honors

Applications of Fermat s Little Theorem and Congruences

Exponents. Learning Objectives 4-1

Factoring Quadratic Expressions

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

2.4. Factoring Quadratic Expressions. Goal. Explore 2.4. Launch 2.4

SECTION 2.2. Distance and Midpoint Formulas; Circles

Simplifying Exponential Expressions

So let us begin our quest to find the holy grail of real analysis.

Matrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.

z 0 and y even had the form

Lesson 9: Radicals and Conjugates

x 4-1 = (x²)² - (1)² = (x² + 1) (x² - 1) = (x² + 1) (x - 1) (x + 1)

SAT Math Hard Practice Quiz. 5. How many integers between 10 and 500 begin and end in 3?

SECTION A-3 Polynomials: Factoring

THE POWER RULES. Raising an Exponential Expression to a Power

Adding and Subtracting Positive and Negative Numbers

Algebra II. Administered May 2013 RELEASED

Transcription:

Spring 2015 Week 1 odule 4 Digital Circuits and Sstems interms, aterms SoP and PoS forms Shankar Balachandran* Associate Professor, CSE Department Indian Institute of Technolog adras *Currentl a Visiting Professor at IIT Bomba

Some Definitions A literal is a complemented or uncomplemented boolean variable. Eamples: a and ā are distinct literals. ā+cd is not. A product term is a single literal or a logical product (AND) of two or more literals. Eamples: a, ā, ac, ācd, aaāb are product terms; ā+cd is not a product term. A sum term is a single literal or a logical sum (OR) of two or more literals. Eamples: a, ā, a+c, ā+c+d are sum terms; ā+cd is not a sum term. Digital Logic Fundamentals 2

Some Definitions A normal term is a product or sum term in which no variable appears more than once. Eamples: a, ā, a+c, ācd are normal terms; ā+a, āa are not normal terms. A minterm of n variables is a normal product term with n literals. There are 2 n such product terms. Eamples of 3-variable minterms: ābc, abc Eample: āb is not a 3-variable minterm. A materm of n variables is a normal sum term with n literals. There are 2 n such sum terms. Eamples of 3-variable materms: ā+b+c, a+b+c Digital Logic Fundamentals 3

Some Definitions A sum of products (SOP) epressions is a set of product (AND) terms connected with logical sum (OR) operators. Eamples: a, ā, ab+c, āc+bde, a+b are SOP epressions. A product of sum (POS) epressions is a set of sum (OR) terms connected with logical product (OR) operators. Eamples: a, ā, a+b+c, (ā+c)(b+d) are POS epressions. Digital Logic Fundamentals 4

Some Definitions The canonical sum of products (CSOP) form of an epression refers to rewriting the epression as a sum of minterms. Eamples for 3-variables: ābc + abc is a CSOP epression; āb + c is not. The canonical product of sums (CPOS) form of an epression refers to rewriting the epression as a product of materms. Eamples for 3-variables: (ā+b+c)(a+b+c) is a CPOS epression; (ā+b)c is not. There is a close correspondence between the truth table and minterms and materms. Digital Logic Fundamentals 5

Deorgan s Theorem (revisited) X X... X X X... X 1 2 n 1 2 n X X... X X X... X 1 2 n 1 2 n Complement of Sum of Products is equivalent to Product of Complements. Complement of Product of Sums is equivalent to Sum of Complements. Digital Logic Fundamentals 6

interms A minterm can be defined as a product term that is 1 in eactl one row of the truth table. n variable minterms are often represented b n- bit binar integers. How to associate minterms with integers? State an ordering on the variables Form a binar number Set bit i of the binar number to 1 if the i th the minterm in an uncomplemented form variable appears in Set bit i to 0 if the variable appears in the complemented form. Digital Logic Fundamentals 7

interm Eamples Assume a 3-variable epression, F,, min term 000 min term 011 min term111 m m m 000 011 111 m 0 m m 3 7 F,, m 0 m 3 m0 0, 3, 7,m m 3,m 7 7 Digital Logic Fundamentals 8

aterms A materm can be defined as a sum term that is 0 in eactl one row of the truth table. n variable materms are also represented b n- bit binar integers. How to associate materms with integers? State an ordering on the variables Form a binar number Set bit i of the binar number to 0 if the i th the materm in an uncomplemented form variable appears in Set bit i to 1 if the variable appears in the materm in the complemented form. Digital Logic Fundamentals 9

Digital Logic Fundamentals 10 aterm Eamples Assume a 3-variable epression,,, F 4 100 1 001 0 000 100 001 000 ma term ma term ma term 4 0 1 4 1 0 4 1 0,,,,,, F

Summar of interms and aterms Digital Logic Fundamentals 11

A Sample Three Variable Function f,, m, m, m, m 1 2 3 1 4 5 6 1,4,5,6 f,,,,, 1 2 3 0 2 3 7 0,2,3,7 Digital Logic Fundamentals 12

2 f 3 1 (a) A minimal sum-of-products realiation 1 3 f 2 (b) A minimal product-of-sums realiation

End of Week 1: odule 4 Thank You Digital Logic Fundamentals 14