Lecture 12

This document summarizes key points from a lecture on algebraic manipulation and switching circuits: 1) The principle of duality states that switching expressions are dual if they are related by interchanging AND and OR operations and constants 0 and 1. Examples of dual expressions are provided. 2) Simplification of switching expressions differs from algebra because inverse operations are undefined, so cancellations are not allowed. 3) De Morgan's theorems and examples of applying them to simplify logical expressions are described. 4) Methods for mapping problems about combinations of conditions to switching expressions are demonstrated with examples involving security officers opening a safe and conditions for soldiers on a mission.

Uploaded by

Aviral Upadhyay

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

23 views

Lecture 12

Uploaded by

Aviral Upadhyay

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 15

Lecture 12: ALGEBRAIC MANIPULATION

PROF. INDRANIL SENGUPTA

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Principle of Duality
• Most of the rules discussed in the last lecture appear in pairs.
• Principle of duality states that:
– A switching expression T2 can be obtained from a given switching expression T1 by
interchanging the operations AND & OR, and constants 0 & 1.
– T1 and T2 are said to be dual of each other.
• Examples:
– x + 1 = 1 is the dual of x . 0 = 0
– x + x.y = x is the dual of x . (x + y) = x
– x + x’.y = x + y is the dual of x . (x’ + y) = x . y

Switching Circuits & Logic Design 2

Simplification of Switching Expressions
• Important point to note:
x + y = x + z does not imply y = z
• A counterexample: x = 1, y = 0, z = 1
• What is the reason?
– Inverse operations are not defined in switching algebra; hence cancellations are not
allowed.

Switching Circuits & Logic Design 3

Simplification Example 1
• F = A.B’ + A.B + B.C

Switching Circuits & Logic Design 4

Simplification Example 2
• F = A’.B.C + A.B’.C + A.B.C’ + ABC

Switching Circuits & Logic Design 5

Simplification Example 3
• F = A’.B + B’.C’ + A.B + B’.C

Switching Circuits & Logic Design 6

De Morgan’s Theorems
• For two variables x and y, De Morgan’s theorems state that:
(x + y)’ = x’ . y’
(x . y)’ = x’ + y’
• Can be easily extended to any number of variables.
x y (x + y)’ x’ . y’ (x.y)’ x’ + y’
0 0 1 1 1 1
0 1 0 0 1 1
1 0 0 0 1 1
1 1 0 0 0 0

Switching Circuits & Logic Design 7

Using De Morgan’s Theorem: Example 1
• F = (A + B)’ . (A’ + B’)

Switching Circuits & Logic Design 8

Using De Morgan’s Theorem: Example 2
• F = (A . B’ + A’ . B)’

Switching Circuits & Logic Design 9

Using De Morgan’s Theorem: Example 3
• F = (A B C’ + D)’ + (A B’ + B C’)’

Switching Circuits & Logic Design 10

Using De Morgan’s Theorem: Example 4
• F = (A B C)’ (A + C) (A + C’)

Switching Circuits & Logic Design 11

Using De Morgan’s Theorem: Example 5
• f (w, x, y) = w x’ y + w x + w y’ + w x y’

Switching Circuits & Logic Design 12

Mapping Problems to Switching Expressions
• A safe has five locks v, w, x, y and z, all of which must be unlocked for the safe to be
open. The keys to the locks are distributed among five security officers as follows:
– Officer A has keys for locks v and x
– Officer B has keys for locks v and y
– Officer C has keys for locks w and y
– Officer D has keys for locks x and z
– Officer E has keys for locks v and z
Find all combinations of security officers that can open the safe.

Switching Circuits & Logic Design 13

Another Problem
• Five soldiers A, B, C, D and E volunteer to perform a mission where the following
conditions must be satisfied:
– Either A or B or both must go.
– Either C or E, but not both, must go.
– Either both A and C go, or neither goes.
– If D goes, then E must also go.
– If B goes, then A and D must also go.