Digital Tutotrials

R.K.Tiwary

Encode the following decimal numbers in BCD code: a.45 b.273.98 c.62.905 Solution.
(a) Decimal number 4 is 5

BCD code is

0100

0101

Hence the BCD coded form of 4510 is 0100 0101 (b) Decimal number 2 is 7 3 9 8

BCD code is

0010

0111

0011

1001

1000

Hence the BCD coded form of 273.9810 is 0010 0111 0011.1001 1000 (c) Decimal number 6 is 2 9 0 5

BCD code is

0110

0010

1001

0000

0101

Hence the BCD coded form of 62.90510 is 0110 0010.1001 0000 0101

Write down the decimal numbers represented by the following BCD codes: a.100101001 b.100010010011 c.01110001001.10010010 Solution.
(a) BCD code is By padding up the first number with 3 zeros 1 0001 0010 0010 1001 1001

Decimal number 1 is Hence the decimal number is 129. BCD code is 1000 Decimal number 8 is Hence the decimal number is 893. BCD code is 011 By padding up the first number with 1 zero 0011

(b)

1001 9

0011 3

(c)

1000
1000

1001
1001

1001
1001

0010
0010

Decimal number 3 is Hence the decimal number is 389.92.

Encode the following decimal numbers to Excess-3 code: a.38 b. 471.78

(a)

Decimal number is

BCD code is

0011

1000

Now adding 3

+0011

+0011

Excess-3 code is

0110

1011

Hence the Excess-3 coded form of 3810 is 0110 1011

(b)

Decimal number is

BCD code is

0100

0111

0001

0111

1000

Now adding 3

+0011

+0011

+0011

+0011

+0011

Excess-3 code is

0111

1010

0100

1010

1011

Hence the Excess-3 coded form of 471.7810 is 0111 1010 0100.1010 1011

Solution. Encode the following decimal numbers to Gray codes: (a) 61 (b) 83

(a)

Decimal number is

61

Binary code is
Gray code is (b) Decimal number is Binary code is Gray code is

111101
100011 83 1010011 1111010

Q. Express the following binary numbers as Gray codes (a) 101010011 (b) 10001110110 (a) Binary number is Gray code is (b) Binary number is Gray code is 101010011 111111010 10001110110 11001001101

Q. Express the following Gray codes as binary numbers: (a) 100111100 (b) 10110010101 (a) Gray code is Binary number is (b) Gray code is Binary number is 100111100 111010111 10110010101 11011100110

Q. Simplify the Boolean function F=AB+ BC + BC. Solution

Q. Simplify the Boolean function F= A + AB. Solution.

Q. Simplify the Boolean function F= ABC + ABC + AB. Solution

Q. Simplify the Boolean function F = AB + (AC) + ABC(AB + C). Solution

Q. Simplify the Boolean function F = ((XY + XYZ) + X(Y + XY)).

Q. Simplify the Boolean function F = XYZ + XYZ + XYZ.

Obtain the canonical sum of product form of the following function. Solution. The given

function contains two variables A and B. The variable B is missing from the first term of the expression and the variable A is missing from the second term of the expression. Therefore, the first term is to be multiplied by (B + B) and the second term is to be multiplied by (A + A) as demonstrated below.

Hence the canonical sum of the product expression of the given function is

Obtain the canonical sum of product form of the following function.

Solution. Here neither the first term nor the second term is minterm. The given function contains three variables A, B, and C. The variables B and C are missing from the first term of the expression and the variable A is missing from the second term of the expression. Therefore, the first term is to be multiplied by (B + B) and (C + C). The second term is to be multiplied by (A + A). This is demonstrated below.

Hence the canonical sum of the product expression of the given function is

Obtain the canonical sum of product form of the following function. Solution

Obtain the canonical product of the sum form of the following function

Solution. In the above three-variable expression, C is missing from the first term, A is missing from the second term, and B is missing from the third term. Therefore, CC is to be added with first term, AA is to be added with the second, and BB is to be added with the third term. This is shown below.

Obtain the canonical product of the sum form of the following function. Solution. In the above three-variable expression, the function is given at sum of the product form. First, the function needs to be changed to product of the sum form by applying the distributive law as shown .

Now, in the above expression, C is missing from the first term and B is missing from the second term. Hence CC is to be added with the first term and BB is to be added with the second term as shown below.

It can be clearly noted that the following relation holds true Conversion between Canonical Forms

This has the complement that can be expressed as Now, if we take complement of F by DeMorgans theorem, we obtain F as

It can be clearly noted that the following relation holds true :

that is, the maxterm with subscript j is a complement of the minterm with the same subscript j, and vice versa.

Realize the function Y = BDE + BF + CDE + CF + A with a multilevel network.

Solution: By the straightforward method, the function can be realized in a two-level AND-OR network as shown in Figure:

However, the expression may be factored into a different form as below

The same function can be realized as a multilevel gate network as shown in Figure

Hence, from the above examples, we observe that the multilevel network has distinct advantages over the two-level network, which may be summarized as below.

1.

Multilevel networks use less number of literals or inputs, thus reducing the number of wires for connection. Sometimes the multilevel network reduces the number of gates. It reduces the variety type of gates and hence the number of ICs Multilevel gate networks can be very easily converted to universal gates realization In that case the switching network can be implemented by less variety of the logic gates.

2. 3. 4.

However, the biggest disadvantage of the multilevel network is that it increases the propagation delay. The propagation delay is the inherent characteristics of any logic gate, and it increases with the increase of number of levels

Realize the following function by NAND gates only, F = B(A + CD) + AC.

Realization by AND, OR, and NOT gates.

AND and OR gates are replaced by equivalent NAND gates.

NAND gate realization after two cascaded inverters are removed.

Realize the following function by NOR gates only, F = A(B + CD) + BC.

Circuit realization by AND-OR gates.

AND and OR gates are replaced by NOR gates.

Implementation by NOR gates after two cascaded inverters are removed.

Realize the function F = BC + AC + AB by (i) basic gates, (ii) NAND gates only, (iii) NOR gates only. Solution. The function is realized basic gates as in Figure

For the NAND realization, at the first step, each of the gates are converted to NAND gates as in Figure

Figure represents the conversion of each gate to a NOR gate and next Figure is the logic diagram for the given function realized with NOR gates only.

a. Realize the function F = A + BCD using NAND gates only. b. Realize the function F = (A + C)(A + D) (A + B + C) using NOR gates only. Solution. a.

I Decimal equivalent

1 4 8

II Binary equivalent A B C D 0 0 0 1 0 1 0 0 1 0 0 0

III

IV ABCD 1,3,9,11 8,9,10,11

3 5 6 9 10 11

0 0 0 1 1 1

0 1 1 0 0 0

1 0 1 0 1 1

ABCD 1,3 1,5 1,9 4,5 4,6 8,9 8,10 1 3,11 1 9,11 0 10,11 1 0 1

001 001 001 010 010 100 100 011 101 101

0 1 10