B D A Gray Code Has The Property That Adjacent Codewords Differ In Only One Position For Example A 4 Bit Gray Code Cou 1 (43.63 KiB) Viewed 19 times
B D A Gray Code Has The Property That Adjacent Codewords Differ In Only One Position For Example A 4 Bit Gray Code Cou 2 (12.91 KiB) Viewed 19 times
B D A Gray Code has the property that adjacent codewords differ in only one position. For example, a 4-bit Gray Code counts in the following order: 0000, 0001, 0011, 0010, 0110, 0111, 0101, 0100, 1100, 1101, 1111, 1110, 1010, 1011, 1001, 1000. (a) Fill in the truth table for the 4-input/4-output converter. Input (Gray code) Output (binary number) Em А Z3 Z2 ZI zo 0 0 0 0 0 1 1 1 0 0 1 0 0 6 1 1 0 0 0 0 0 0 0 1 0 0 0 2 0 0 1 0 0 0 1 3 0 1 1 0 0 1 -ell 4 0 1 0 0 0 1 1 5 1 0 1 0 1 1 0 0 7 0 1 1 1 8 0 0 0 9 0 0 1 0 1 0 1 1 1 1 1 1 1 1 0 1 1 1 0 10 11 12 13 14 15 0 1 0 1 1 1 0 1 Observe that each of the output Z's is an individual function of the input tuples (A, B, C, D).
(b) Use K-map to obtain the simplified Boolean functions (both sum-of-products and product-of-sums) for the output bits. (c) Convert the Boolean functions in (b) to a form which is implemented by XOR gates only.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!