BECE101 – Basics Electronics

Module 5 : Digital Logic

Dr. Sridhar Chandrasekaran

Assistant Professor (Senior)
VIT University, Chennai
Topics in Module 5

Number systems, conversion of bases, Boolean

algebra, Logic Gates, Concept of universal gate,
Simplification and implementation of Boolean functions.

Weightage
Internals (3 assignments)
External (2- CAT, and FAT)
Midterm – Module 1 - 3
Number Systems
 Positional weight
Binary to Decimal
(11010.11)2 =
Octal to Decimal
(123.4)8 = 1 x 82 + 2 X 81 + 3 x 80 + 4 X 8-1 = (83.5)10
(7392)10 =
Hexadecimal to Decimal
 Number Base Conversion
• Decimal to Binary
(41)10 = (101001)2
(0.6875)10 = (0.1011)2

• Decimal to Octal
(153)10 = (231)8
(0.513)10 = (0.40651….)8
 Number Base Conversion
• Decimal to Hexadecimal
• (540)10 = (21C)16

• (0.06640625)10 = (0.110)16
OCTAL AND HEXADECIMAL NUMBERS
• Binary to Octal

• Binary to Hexadecimal
Binary Codes
 Binary Logic
• Consists of binary variables and logical operations
• The variables are designated by letters of the alphabet (A, B, C,
x, y, Z, etc., )
• Each variable having two and only two distinct possible values:
1 and 0
• There are three basic logical operations: AND, OR, and NOT
• AND:
– Represented by a dot or by the absence of an operator
– Ex., x·y = z or xy = Z ("x AND y is equal to z.“)
– The logical operation AND is interpreted to mean that
z = I if and only if x = I and y = I; otherwise z = O
 Binary Logic
• OR
– Represented by a plus sign
– Example, x + y = z ("x OR y is equal to z,“)
– z = I if x = I or if y = I or if both x = I and y = I.
– If both x = 0 and y = 0, then z = 0.
• NOT
– Represented by a prime (sometimes by a bar)
– Example, x' = z (or x = z) is read "not x is equal to z,"
– z is what x is not.
– In other words, if x = I, then z = 0; but if x = 0, then z = 1
Logic Gates
Binary Signal and Symbols for digital
logic circuit
Input-output signals for Logic gates
Boolean Algebra
 AXIOMATIC DEFINITION OF BOOLEAN
ALGEBRA
• Boolean algebra is an algebraic structure defined on a set of
elements B together with two binary operators + and ., provided
the following (Huntington) postulates are satisfied:
 Basic Theorems and Properties of
Boolean Algebra
• Duality principle
States that every algebraic expression deducible
from the postulates of Boolean algebra remains valid if
the operators and identity elements are interchanged
Basic Theorems
Basic Theorems (2)
 Operators Precedence
• (I) Parentheses
• (2) NOT
• (3) AND
• (4) OR
 Boolean Functions
• Boolean Algebra deals with binary variables and logic
operations
• A Boolean function is an expression formed with binary
variables, the two binary operators OR and AND, and unary
operator NOT, parentheses, and an equal sign
• For a given value of the variables, the function can be either 0
or I
Implementation of Boolean function
with Gates
Implementation of Boolean function
with Gates (2)
Simplification of Boolean Function
Complement of Function
Complement of Function by Dual
• Ram eat breakfast if he feel hungry and the
food is ready or time is 8 AM past
F = AB+C

• Raj go to church if it is Sunday and vehicle is

ready or he is free and not having fever
F = AB+CD’
 Boolean expressions logic gates

• Example: F = (A•B)’ + C•D

A

B
F
C

• Example: F = C•(A+B)’

B
F
C
NAND NOR Implementation
NAND NOR Implementation
Minterms and Maxterms
 Example
In an automated transport the door opens if at
least two of the following happens
Bus reaches the stop
Conductor blow whistle
Driver applies the brake
Write an equation for the variable F which is 1 iff
the door should open. Simplify the same into 6
literals and Implement the same using NAND
gate
Implementation of NOT. AND. and OR
by NAND gates
Two graphic symbols for a NAND gate
 Multilevel NAND Circuits
• Procedure
– From the given Boolean expression, draw the logic diagram
with AND, OR, and inverter gates
– Assume that both the normal and complement inputs are
available.
– Convert all AND gates to NAND gates with AND-invert
graphic symbols
– Convert all OR gates to NAND gates with invert-OR graphic
symbols
– Check all small circles in the diagram.
– For every small circle that is not compensated by another
small circle along the same line, insert an inverter (one-
input NAND gate) or complement the input variable
 Example
• F = A + (B' + C)(D' + BE ')
NAND Diagram
 Practice Problem
• F = (CD + E)(A + B ')
 Analysis Procedure
• Derive the Boolean function
• Substitute invert-OR symbols in alternate levels
Implementation of NOT, OR, and AND
by NOR gates
Two graphic symbols for a NOR gate
 Multilevel NOR Circuit
• F = (AB + E)(C + D)
 Analysis
• Derive the Boolean Function
• Substitute invert-AND in alternate levels