Digital Systems

DIGITAL
CIRCUITS

1
 Why Binary Arithmetic?

3+5 =8

0011 + 0101 = 1000

2
 Why Binary Arithmetic?

Hardware can only deal with binary digits, 0

and 1.
Must represent all numbers, integers or
floating point, positive or negative, by binary
digits, called bits.
Can devise electronic circuits to perform
arithmetic operations: add, subtract, multiply
and divide, on binary numbers.

3
 Positive Integers

Decimal system: made of 10 digits, {0,1,2, . . . , 9}

41 = 4×101 + 1×100
255 = 2×102 + 5×101 + 5×100
Binary system: made of two digits, {0,1}
00101001 = 0×27 + 0×26 + 1×25 + 0×24
+1×23 + 0×22 + 0×21 + 1×20
= 32 + 8 +1 = 41
11111111 = 255, largest number with 8
binary digits, 28-1

4
 Base or Radix

For decimal system, 10 is called the base or

radix.
Decimal 41 is also written as 4110 or 41ten
Base (radix) for binary system is 2.
Thus, 41ten = 1010012 or 101001two
Also, 111ten = 1101111two
and 111two = 7ten
What about negative numbers?

5
Signed Magnitude

Use fixed length binary representation

Use left-most bit (called most significant bit or
MSB) for sign:
0 for positive
1 for negative
Example: +18ten = 00010010two
–18ten = 10010010two

6
 3

BASIC LOGIC BLOCK - GATE -

Binary Binary
Digital Digital
. Gate Output
Input
Signal .. Signal

Functions of Gates can be described by

- Truth Table
- Boolean Function
- Karnaugh Map
 5

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

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
Digital Logic Circuits 6 Boolean Algebra

LOGIC CIRCUIT DESIGN

x y z F
0 0 0 0
Truth 0 0 1 1
Table 0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1

Boolean F = x + y’z
Function

x
F
Logic y
Diagram
z
Digital Logic Circuits 7 Boolean Algebra

BASIC IDENTITIES OF BOOLEAN ALGEBRA

[1] x + 0 = x [2] x • 0 = 0
[3] x + 1 = 1 [4] x • 1 = x
[5] x + x = x [6] x • x = x
[7] x + x’ = 1 [8] x • X’ = 0
[9] x + y = y + x [10] xy = yx
[11] x + (y + z) = (x + y) + z [12] x(yz) = (xy)z
[13] x(y + z) = xy +xz [14] x + yz = (x + y)(x + z)
[15] (x + y)’ = x’y’ [16] (xy)’ = x’ + y’
[17] (x’)’ = x
[15] and [16] : De Morgan’s Theorem
Usefulness 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
→ Applications of De Morgans Theorem

x’y’ = (x + y)’ x’+ y’= (xy)’

I, AND → NOR I, OR → NAND
Digital Logic Circuits 8 Boolean Algebra

EQUIVALENT CIRCUITS

Many different logic diagrams are possible for a given Function

F = ABC + ABC’ + A’C .......…… (1)
= AB(C + C’) + A’C [13] ..…. (2)
= AB • 1 + A’C [7]
= AB + A’C [4] ...…. (3)
A
B
(1) C
F

(2) A
B

C F

(3) A
B
F
C
K Maps | karnaugh Maps | Solved Examples

Minimization Of Boolean Expressions-

There are following two methods of minimizing or reducing

the Boolean expressions-
1. By using laws of Boolean Algebra
2. By using Karnaugh Maps also called as K Maps
Karnaugh Map Simplification Rules-
To minimize the given Boolean function,
We draw a K Map according to the number of variables it
contains.
We fill the K Map with 0’s and 1’s according to its
function.
Then, we minimize the function in accordance with the
following rules.
Rule-01:

We can either group 0’s with 0’s or 1’s with 1’s but we
can not group 0’s and 1’s together.
X representing don’t care can be grouped with 0’s as
well as 1’s.
 NOTE
There is no need of separately grouping X’s i.e. they can be
ignored if all 0’s and 1’s are already grouped.
Rule-02:
Groups may overlap each other.
Rule-03:
We can only create a group whose number of cells can be
represented in the power of 2.
In other words, a group can only contain 2n i.e. 1, 2, 4, 8, 16
and so on number of cells.
Rule-04:
Groups can be only either horizontal or vertical.
We can not create groups of diagonal or any other
shape.
Rule-05:

Each group should be as large as possible.

Rule-06:
Opposite grouping and corner grouping are
allowed.
The example of opposite grouping is shown
illustrated in Rule-05.
The example of corner grouping is shown
below.
Rule-07:
There should be as few groups as possible.
Problem-01:

Minimize the following boolean function-

F(A, B, C, D) = Σm(0, 1, 2, 5, 7, 8, 9, 10, 13, 15)

Solution- Thus, minimized boolean expression is-

F(A, B, C, D) = BD + C’D + B’D’
Problem-02:

Minimize the following Boolean function-

F(A, B, C, D) = Σm(0, 1, 3, 5, 7, 8, 9, 11, 13, 15)

Solution: Thus, minimized Boolean expression is-

F(A, B, C, D) = B’C’ + D
Problem-03:
Minimize the following boolean function-
F(A, B, C, D) = Σm(1, 3, 4, 6, 8, 9, 11, 13, 15) +
Σd(0, 2, 14)

Solution: Thus, minimized boolean expression is-

F(A, B, C, D) = AD + B’D + B’C’ + A’D’
Problem-04:
Minimize the following boolean function-
F(A, B, C) = Σm(0, 1, 6, 7) + Σd(3, 5)

Thus, minimized boolean expression is-

F(A, B, C) = AB + A’B’
Minimize the following boolean function-
F(A, B, C, D) = Σm(0, 1, 2, 5, 7, 8, 9, 10, 13, 15)

Thus, minimized boolean expression is-

F(A, B, C, D) = BD + C’D + B’D’
Minimize the following boolean function-
F(A, B, C, D) = Σm(0, 1, 3, 5, 7, 8, 9, 11, 13, 15)

Thus, minimized boolean expression is-

F(A, B, C, D) = B’C’ + D
Minimize the following boolean function-

F(A, B, C, D) = Σm(1, 3, 4, 6, 8, 9, 11, 13, 15) + Σd(0, 2, 14)

Thus, minimized boolean expression is-

F(A, B, C, D) = AD + B’D + B’C’ + A’D’
Minimize the following boolean function-
F(A, B, C) = Σm(1, 2, 5, 7) + Σd(0, 4, 6)

Thus, minimized boolean expression is-

F(A, B, C) = A + B’ + C’
Minimize the following boolean function-
F(A, B, C, D) = Σm(3, 4, 5, 7, 9, 13, 14, 15)

Thus, minimized boolean expression is-

F(A, B, C, D) = A’BC’ + A’CD + AC’D + ABC
 F(A,B,C,D)=∏ M (3,5,7,8,10,11,12,13)

Soln
(C+D’+B’).(C’+D’+A).(A’+C+D).(A’+B+C’)