UNIT-1

DIGITAL ELECTRONICS INTRODUCTION

4/30/2012

VINAY NASSA

Lecture -2 Logic Gates, Boolean Algebra

Introduction to Logic gates Truth Table Combinational Gates Boolean Algebra Basic identities of Boolean Algebra DeMorgans Theorems Duality Principle
VINAY NASSA

4/30/2012

Lecture -2(A) Logic Gates

Logic gates are the basic building blocks of digital circuits. The gates, a circuit with one or more input signals but only one output signal. Gates are digital (two state) circuits because the input and output signals are either low or high circuits. Every gate perform some type of logical function like in AND gate the output is high only if all the inputs are high.
4/30/2012 VINAY NASSA

Logic Gates
Binary Digital Input Signal Gate . Binary Digital Output Signal

Functions of Gates can be described by

4/30/2012

- Truth Table - Boolean Function - Karnaugh Map

VINAY NASSA

Truth Table
Truth Table
The most elementary specification of the function of a Digital Logic Circuit is the Truth Table Table that describes the Output Values for all the combinations of the Input Values, called MINTERMS

- n input variables 2n minterms

4/30/2012

VINAY NASSA

COMBINATIONAL GATES
Name
A

Symbol
X B A X B

Boolean Function Truth Table

X=AB or X = AB A 0 0 1 1 A 0 0 1 1 B X 0 0 1 0 0 0 1 1 B X 0 0 1 1 0 1 1 1 A X 0 1 1 0 A X 0 0 1 1 A 0 0 1 1 A 0 0 1 1 A 0 0 1 1 A 0 0 1 1 B 0 1 0 1 B 0 1 0 1 B 0 1 0 1

AND OR I Buffer NAND NOR XOR

Exclusive OR

X=A+B

A A A X

X = A X=A

X B A X B A X B A X B

X = (AB)

B 0 1 0 1 X 1 0 0 0 X 0 1 1 0 X 1 0 0 1

X 1 1 1 0

X = (A + B) X=AB or X = AB + AB X = (A B) or X = AB+ AB VINAY NASSA

Exclusive NOR or Equivalence

XNOR

4/30/2012

Lecture -2(B) BOOLEAN ALGEBRA

-In 1854 George Boole introduced a systematic treatment of logic and developed for this purpose an algebraic system now called Boolean algebra. - He developed a consistent set of postulates that were sufficient to define a new type of algebra: Boolean Algebra (similar to Linear Algebra). -Many of the rules are the same as the ones in Linear Algebra.

-Boolean algebra is a form of algebra that deals with single digit binary values and variables. Values and variables can indicate some of the following binary pairs of values: ON / OFF TRUE / FALSE HIGH / LOW CLOSED / OPEN 1/0

4/30/2012

VINAY NASSA

BOOLEAN ALGEBRA
Boolean Algebra
* Algebra with Binary(Boolean) Variable and Logic Operations * Boolean Algebra is useful in Analysis and Synthesis of Digital Logic Circuits - Input and Output signals can be represented by Boolean Variables, and - Function of the Digital Logic Circuits can be represented by Logic Operations, i.e., Boolean Function(s) - From a Boolean function, a logic diagram can be constructed using AND, OR, and I

4/30/2012

VINAY NASSA

Laws of Boolean Algebra

There are 6 fundamental laws, or axioms, used to formulate various algebraic structures: Closure: Boolean algebra operates over a field of numbers, B = {0,1}: (1,0) (1,0) For every x, y in B: (1,0) x + y is in B (1,0) (1,0) x . y is in B
(1,0)

1.

4/30/2012

VINAY NASSA

Laws of Boolean Algebra (continued)

2.

Commutative laws: For every x, y in B, x+y=y+x x.y=y.x

Similar to Linear Algebra x

F=x+y

x y

F = x.y

y
y

F=y+x

y x
VINAY NASSA

F = y.x

x
4/30/2012

Laws of Boolean Algebra (continued)

3.

Associative laws: For every x, y, z in B, (x + y) + z = x + (y + z) = x + y + z (xy)z = x(yz) = xyz

Similar to Linear Algebra

x y

F = xyz z

z y
4/30/2012

F = xyz

x
VINAY NASSA

Laws of Boolean Algebra (continued)

4. Distributive laws: For every x, y, z in B,
x + (y.z) = (x + y)(x + z)
[+ is distributive over .] NOT Similar to Linear Algebra

x.(y + z) = (x.y) + (x.z) [. is distributive over +]

Similar to Linear Algebra

4/30/2012

VINAY NASSA

Laws of Boolean Algebra (continued)

5. Identity laws: A set B is said to have an identity element with respect to a binary operation {.} on B if there exists an element designated by 1 in B with the property: 1.x=x
Example: AND operation

A set B is said to have an identity element with respect to a binary operation {+} on B if there exists an element designated by 0 in B with the property: 0+x=x
Example: OR operation
Similar to Linear Algebra
4/30/2012 VINAY NASSA

Laws of Boolean Algebra (continued)

6. Complement For each x in B, there exists an element x in B (the complement of x) such that: x + x = 1 Similar to Linear Algebra x . x = 0
We can also use x to represent complement.

4/30/2012

VINAY NASSA

Laws of Boolean Algebra (Summary)

Commutative x+y=y+x xy = yx Associative (x + y) + z = x + (y + z) (xy)z = x(yz) Distributive x + (yz) = (x + y)(x + z) x(y + z) = (xy) + (xz)
4/30/2012

Identity x+0=x x.1=x Complement x+x=1 x.x=0 OR with 1 AND with 0

x+1=1 x.0=0

VINAY NASSA

Other Theorems

Theorem 1(a):

Theorem 1(b):

xx x x x ( x x) .1 ( x x)( x x' ) xx xx' x0 x

x.x x x . x xx 0 xx xx' x( x x' ) x .1 x

4/30/2012

VINAY NASSA

Other Theorems
Theorem 2(a): Theorem 2(b):

x 1 1 x 1 1.(x 1) ( x x' )( x 1) xx x'.1 x x' 1

x xy x x xy x(1 y ) x( y 1) x.1 x

4/30/2012

VINAY NASSA

BASIC IDENTITIES OF BOOLEAN ALGEBRA(SUMMARY)

[1] x + 0 = x [3] x + 1 = 1 [5] x + x = x *7+ x + x = 1 [9] x + y = y + x [11] x + (y + z) = (x + y) + z [13] x(y + z) = xy +xz *15+ (x + y) = xy *17+ (x) = x *2+ x 0 = 0 *4+ x 1 = x *6+ x x = x *8+ x X = 0 [10] xy = yx [12] x(yz) = (xy)z [14] x + yz = (x + y)(x + z) *16+ (xy) = x + y
*15+ and *16+ : De Morgans Theorem

Application of this Table

- Simplification of

the Boolean function - Derivation of equivalent Boolean functions to obtain logic diagrams utilizing different logic gates -- Ordinarily ANDs, ORs, and Inverters -- But a certain different form of Boolean function may be convenient to obtain circuits with NANDs or NORs
VINAY NASSA

4/30/2012

DeMorgans Theorems
Theorem 1 (x + y) = x y Theorem 2 (x y) = x + y

DeMorgan's theorem is very useful in digital circuit design

It allows ANDs to be exchanged with ORs by using invertors

DeMorgan's Theorem can be extended to any number of Variables.

4/30/2012 VINAY NASSA

Implications of DeMorgans Theorems(I) Gate Equivalency

4/30/2012

VINAY NASSA

Implications of DeMorgans Theorems(II)

4/30/2012

VINAY NASSA

Duality Principle
Duality principle: States that a Boolean equation remains valid if we take the dual of the expressions on both sides of the equals sign. The dual can be found by interchanging the AND and OR operators along with also interchanging the 0s and 1s. This is evident with the duals in the basic identities. For instance: DeMorgans Law can be expressed in two forms (X+Y)= XY as well as (XY) = X + Y
4/30/2012 VINAY NASSA

FUNCTION MANIPULATION(1)
Example: Simplify the following expression F = BC+BC+BA Simplification F=B(C+C)+ BA F=B1+BA F=B(1+A) F=B
4/30/2012 VINAY NASSA

FUNCTION MANIPULATION(2)
Example: Simplify the following expression xy + xc + yc = xy + xc L.H.S: xy + xc + yc = xy + xc + yc(x + x) = xy + xc + xyc + xcy = (xy + xyc) + (xc + xcy) = xy + xc
4/30/2012 VINAY NASSA

More on complements (DeMorgan)

Find the complement of:

Show that the complement of

F ( AB'C ) D' E F ' [( AB'C ) D' E ]' [( AB'C ) D' ]' E ' [( AB'C )' D' ' ]E ' [( AB' )'C ' D]E ' ( A' B)C ' E ' DE '

x( x y ) x'

[ x( x y )]' x'( x y )' x' x' y ' x' (1 y ' ) x' (1) x'

4/30/2012

VINAY NASSA

More on complements (DeMorgan)

Review Questions
Simplify y = AC + ABC y = AC Simplify y = ABCD + ABCD y = ABD Simplify y = AD + ABD y = AD + BD
VINAY NASSA

4/30/2012

Review Questions
Simplify the expression
y = ABD+ ABD y = AB

Simplify z = (A + B)(A + B) z=B

Simplify x = ACD+ ABCD x = ACD + BCD

4/30/2012

VINAY NASSA