0195136047.pdf

PROBLEMS 335

Ck

Master Slave

1 S 1

R 1

J

K

Q 1

Q 1

S 2

R 2

Q 2

Q 2

Q 2

(^2) Q 2
3
4
Figure P6.1.52
S 1 S 0
I
10
10
11
11
I
0
1
0
1
00
00
01
01
0
1
0
1
Q 3
Q 0
Q 1
Q 2
Q 3
S 1 S 0
Q 2
00
01
00
10
Q 1
0
0
0
0
00
00
00
00
0
0
0
1
Q 0
0
0
0
0
0
1
0
0
Figure P6.2.9
binary form. Set up a table for the excess-3
code for the 10 decimal digits.
(b) Set up a table for a 4-to-10 line excess-3 de-
coding.
6.2.3A common requirement is conversion from one
digital code to another. Develop a table of the BCD
code and the excess-3 code [see Problem 6.2.2(a)]
to be derived from it, for the decimal digits 0 to 9.
Show a block diagram for a BCD to excess-3 code
converter.
6.2.4Draw a block diagram for a 2-to-4 decoder. Obtain
the truth table, and develop a logic diagram.
6.2.5Illustrate BCD-to-decimal decoding with a 4-to-
16 decoder, and draw the corresponding truth ta-
ble.
6.2.6Based on the 8421 BCD code for decimal digits
0 through 9, develop a block diagram for a BCD
encoder and its implementation scheme.
*6.2.7Implement the following Boolean functions by
employing 8-to-1 multiplexers (see Example 6.2.1
in the text for a table ofminterms).
(a) F 1 (A,B,C)=
∑
mi( 0 , 2 , 4 , 6 )
(b) F 2 (A,B,C)=
∑
mi( 1 , 3 , 7 )
6.2.8Using two 8-to-1 multiplexers and one 2-to-1 mul-
tiplexer, show how a 16-to-1 multiplexer can be
obtained in the form of a block diagram.
6.2.9Given the block diagram and the truth table of a
demultiplexer,as shown in Figure P6.2.9, obtain
its implementation.
6.2.10Use a 4-to-1 multiplexer to simulate the following:
(a) NAND logic function.
(b) EXCLUSIVE-OR logic function.
(c)
∑
mi( 1 , 2 , 4 ).
6.2.11Show how a 16-to-1 multiplexer can be used to
implement the logic function described by the
following truth table.
ABCDQ
0000 1
0001 1
0010 1
0011 0
0100 1
0101 0
0110 1
0111 1
1000 0
1001 0
1010 1
1011 0
1100 0
1101 1
1110 1
1111 0