Pulse and Digital Circuits

Venkata Rao K., Rama Sudha K. and Manmadha Rao G.

Chapter 17
Combinational Circuits: Implementation and Design
1. Simplify using Boolean algebra
techniques:
(a) A (A + B) + (B + AA)(A + B )
(b) A B ( A B)( B B)
Solution:

(a) Let f = A (A + B) + (B + AA) (A + B ). This can be reduced

as:

+
B
)
f = ( A A + A B) + (B + A)(A

f = A B+AB+A+A B
f = B (A+ A ) + A (1+ B )
f = B+A
(b) Let f = A B ( A B)( B B) . This can be reduced as:
f = A B ( A B)(1)
f = AB 0
f = AB

2. Simplify the following Boolean functions using K-maps and realize the gate circuits
using only NAND gates.
(a) f (A,B,C) = ABC + AB + ABC + AC
(b) f (A,B,C) = AB + BC + BC + ABC
(c) f (A,B,C, D) = (0,1,2,3,8,9,10,11)
Solution:

(a) f (A,B,C) = ABC + AB + ABC + AC

f (A,B,C) = ABC + AB (C+ C ) + AB C + AC(B+ B )
f (A,B,C) = ABC + ABC + ABC + ABC + ACB+ ABC

Dorling Kindersley India Pvt. Ltd 2010

Pulse and Digital Circuits

Venkata Rao K., Rama Sudha K. and Manmadha Rao G.

f = B + AC+ AC
(b) f (A,B,C) = AB + BC + BC + ABC
f (A,B,C) = AB (C+ C )+ B C (A+ A )+ BC(A+ A ) + A BC
f (A,B,C) = ABC + AB C + B C A+ BA C + BCA+ BC A +A BC
f(A,B,C) = ABC + AB C + B C A + BCA+ A BC

f = B + AC
(c ) f(A,B,C,D) =

(0,1,2,3,8,9,10,11)

f =B

3. Simplify and implement using (i) only NAND gates; and (ii) only NOR gates:

Dorling Kindersley India Pvt. Ltd 2010

Pulse and Digital Circuits

Venkata Rao K., Rama Sudha K. and Manmadha Rao G.

f(A,B,C,D)=

(0,1,2,3,8,9,10,11)

d(A,B,C,D)=

(12,13)

Solution:

f = B = B (A A )(C C ) = ABC ABC ABC ABC = ( ABC )( ABC )( ABC )( ABC )

Fig.3.2 Realization of B using NAND gates

f B B A A CC
( B A)(B A) C C
( A B C C )( B A C C )
( A B C )( A B C )( A B C )( A B C )
( A B C) ( A B C) ( A B C) ( A B C)

Dorling Kindersley India Pvt. Ltd 2010

Pulse and Digital Circuits

Venkata Rao K., Rama Sudha K. and Manmadha Rao G.

Fig. 3.2 Realization of B using NOR gates

4. What is the output Q of the circuit shown in Fig.17p.4? Implement the circuit using
only NAND gates.

Fig.17p.4 The given gate circuit

Solution:

f = AB ( A B)
AB AB A B AB AB AB
AB AB AB AB AB AB
( AB AB AB)( AB AB AB)
( AB AB AB)( AB AB AB)
( AB AB AB)( AB ( AB AB)
AB AB AB AB
AB(1 AB AB)
AB

Dorling Kindersley India Pvt. Ltd 2010

Pulse and Digital Circuits

Venkata Rao K., Rama Sudha K. and Manmadha Rao G.

5. Draw and use a K-map to produce a minimized SOP and POS expression for:
f (w, x, y, z) = (0, 2, 6, 7, 8, 10, 11, 15)
Solution:

f = wxy x z wyz wy z xyz w x y

6. Simplify the following Boolean function using the K-map.

f = PQ R PQR PQR PQ R PQR PQ R
Solution:
Mapping the product terms, as shown in Table 6.1.

Table 6.1 K-map for PQ R PQR PQR PQ R PQR PQ R

Dorling Kindersley India Pvt. Ltd 2010

Pulse and Digital Circuits

Venkata Rao K., Rama Sudha K. and Manmadha Rao G.

There are two groups. We have two product terms in the simplified Boolean function.
For the sub-cube covered by minterms 0, 1, 2 and 3, P is unchanged and for the sub-cube
covered by minterms 2, 3, 7 and 6, Q is unchanged. Hence the minimal solution is
f =PQ.
7. Simplify f = PQ R PQ R PQ R PQ R using a K-map.
Solution:
Mapping the product terms, as shown in Table. 7.1.
Table 7.1 K-map for PQ R PQ R PQ R PQ R

If the K-map is rolled backwards as a cylinder, the two extreme pairs of cells are also
adjacent. Grouping the product terms, the simplified Boolean function is f = R .
8. Simplify the Boolean function f = PQ R PQR PQR PQ R PQ R PQ R .
Solution:
Mapping the product terms, as shown in Table 8.1.
Table 8.1 K-map for PQ R PQR PQR PQ R PQ R PQ R

Dorling Kindersley India Pvt. Ltd 2010

Pulse and Digital Circuits

Venkata Rao K., Rama Sudha K. and Manmadha Rao G.

The simplified function obviously has two terms. For the sub-cube covered by minterms
0,1,2,3, P is unchanged and for the sub-cube covered by minterms 0,2,4,6, R is
unchanged. Hence the minimal solution is f = P R .
9. Simplify f = PQR PQR PQ R PQR : (a) using Boolean simplification; (b)
using K-map.
Solution:
(a) f = PQR PQR PQ R PQR
Factoring terms 1 and 4 results in
F = QR( P P) PQR PQ R = QR PQR PQ R
(since P + P 1 )
Factoring 1 and 3 results in
f = Q(R P R ) PQR
Since R RP P R , f simplifies to
f = Q(R P) PQR = QR PQ PQR
Factoring terms 2 and 3 gives
F = QR P(Q QR)
which simplifies to
f = QR P(Q R) ,
which is the same as
f = QR PQ PR
(b) Now use the K-map
Mapping the product terms, as shown in Table 9.1.
Table 9.1 K-map for PQR PQR PQ R PQR

For the sub-cube covered by minterms 3, 7, Q and R are unchanged, for the sub-cube
covered by minterms 5, 7, P and R are unchanged and for the sub-cube covered by
minterms 6, 7, P and Q are unchanged. Hence the minimal solution is
f = PR PQ QR .
10. A combinational circuit has four inputs and one output. The output is 1 when (a) all
the inputs are equal to 1; (b) none of the inputs is equal to 1; and (c) when the odd
number of inputs is equal to 1. Design a logic circuit to implement the above.

Dorling Kindersley India Pvt. Ltd 2010

Pulse and Digital Circuits

Venkata Rao K., Rama Sudha K. and Manmadha Rao G.

Solution:
Step 1: The number of inputs is 4 and output is 1. Let the inputs be P,Q,R,S and output f.
Step2: Truth table is presented in Table 10.1, satisfying the conditions.

Table 10.1 Truth table

P Q R S
f
0 0 0 0
1
0 0 0 1
1
0 0 1 0
1
0 0 1 1
0
0 1 0 0
1
0 1 0 1
0
0 1 1 0
0
0 1 1 1
1
1 0 0 0
1
1 0 0 1
0
1 0 1 0
0
1 0 1 1
1
1 1 0 0
0
1 1 0 1
1
1 1 1 0
1
1 1 1 1
1
The contents of the truth table are mapped in Table. 10.2.
Table 10.2 K-map

The minimal solution is

f = P Q S P R S P Q R Q R S PQS PQR PRS QRS
From the above Boolean expression, the logic diagram can be easily drawn.

Dorling Kindersley India Pvt. Ltd 2010