EE 110 Spring 2017 CQUPT Homework 6 1. Design a code converter that converts a 4-bit number from Gray code to binary code. The following table shows how these two codes relate. Let the input’s 4-bit Gray code bits be G3, G2, G1, and G0 and the output’s 4-bit binary code bits be B3, B2, B1, B0. Use K-maps to minimize your design. a. (10 points each – 40 pts total) Show your K-maps and your minimized equations. There should be 4 K-maps and 4 equations for the outputs B3, B2, B1, and B0. b. (5 points each – 20 pts total) Draw your logic diagrams for the outputs B3, B2, B1, and B0. Decimal Binary Gray 0 0000 0000 1 0001 0001 2 0010 0011 3 0011 0010 4 0100 0110 5 0101 0111 6 0110 0101 7 0111 0100 8 1000 1100 9 1001 1101 10 1010 1111 11 1011 1110 12 1100 1010 13 1101 1011 14 1110 1001 15 1111 1000 Background The Gray code has the characteristic that the code words for two consecutive numbers differ in only 1 bit. Though it is very useful in a variety of applications, we’ve already seen it in the way Karnaugh maps are structured.2. (15 points) Complete the following table showing the 8-bit binary patterns corresponding to the provided decimal integer value. Show your work! That means show how you determine each value. Decimal 8-bit sign-magnitude format 8-bit one’s complement format 8-bit two’s complement format –1 –57 57 –125 3. (15 points) Complete the following table. Show your work! Decimal 8-bit sign-magnitude format 8-bit one’s complement format 8-bit two’s complement format 10000000 10000000 10010110
View Full Document
Unlocking...