dld lecture module 06

16
6/14/2012 1 Digital Logic & Design Dr. Sajjad Ahmed Nadeem Department of Computer Science & IT University of Azad Jammu & Kashmir Muzaffarabad Module - 6 Canonical and Standard Forms. SOP and POS. NAND and NOR Gates. Exclusive OR Function. Equivalence Function.

Upload: bilal-maqbool-

Post on 03-Mar-2017

20 views

Category:

Education


3 download

TRANSCRIPT

Page 1: Dld lecture module 06

6/14/2012

1

Digital Logic & Design

Dr. Sajjad Ahmed Nadeem

Department of Computer Science & IT University of Azad Jammu & Kashmir

Muzaffarabad

Module - 6

� Canonical and Standard Forms.

� SOP and POS.

� NAND and NOR Gates.

� Exclusive OR Function.

� Equivalence Function.

Page 2: Dld lecture module 06

6/14/2012

2

Canonical and Standard Form

� Minterms For a boolean function of n variables , a product term in which each of the variables appears once (in either its complemented or uncomplemented form) is called a minterm.

� Maxterms For a boolean function of n variables , a sum term in which each of the variables appears once (in either its complemented or uncomplemented form) is called a maxterm.

Canonical and Standard Form

� Boolean functions expressed as a sum of minterms or product of maxterms are said to be in canonical form.

Page 3: Dld lecture module 06

6/14/2012

3

Canonical and Standard Form

Minterms and Maxterms for three binary variables

Page 4: Dld lecture module 06

6/14/2012

4

Sum of Products (SoP) Expression

Steps to express a Boolean Function in SOP Form

Page 5: Dld lecture module 06

6/14/2012

5

Expressing a Boolean Function in SOP Form - Example

Expressing a Boolean Function in SOP Form - Example

Page 6: Dld lecture module 06

6/14/2012

6

Product of Sums (PoS) Expression

Steps to express a Boolean Function in POS Form

Page 7: Dld lecture module 06

6/14/2012

7

Expressing a Boolean Function in POS Form - Example

Expressing a Boolean Function in POS Form - Example

Page 8: Dld lecture module 06

6/14/2012

8

Conversion between Canonical Forms (Sum of Products and Product of Sums)

NAND Gate

Page 9: Dld lecture module 06

6/14/2012

9

NAND Gate

NOR Gate

Page 10: Dld lecture module 06

6/14/2012

10

NOR Gate

Logic Gates

Page 11: Dld lecture module 06

6/14/2012

11

Finding Booloean Expression of a Logic Circuit – Example 1

Finding Booloean Expression of a Logic Circuit – Example 1

Page 12: Dld lecture module 06

6/14/2012

12

Finding Booloean Expression of a Logic Circuit – Example 2

Finding Booloean Expression of a Logic Circuit – Example 2

Page 13: Dld lecture module 06

6/14/2012

13

Constructing a Logic Circuit from Boolean Expression – Example 1

Constructing a Logic Circuit from Boolean Expression – Example 1

Page 14: Dld lecture module 06

6/14/2012

14

Constructing a Logic Circuit from Boolean Expression – Example 2

Constructing a Logic Circuit from Boolean Expression – Example 2

Page 15: Dld lecture module 06

6/14/2012

15

Exclusive-OR Function

Exclusive-OR Function

Page 16: Dld lecture module 06

6/14/2012

16

Equivalence Function

Equivalence Function