Question

Exercise 5.6: Generic Binary-to-Gray Converter The regular binary code, which consists of code words ordered according to their increas ing unsigned decimal values, constitutes the most commonly used digital code. In some kind operation opcode 000 ya+b a(N-1:0) b(N-1:0) a(N-1:0) unsigned ya b 001 y(N- 1:0) Arithmetic Arithmetic 010 y-a+b ya+b+cin y(N:0) b(N-1:0 circuit circuit 011 cout cin cin 100 ya+b signed 101 ya b opcode(2:0) opcode(2:0) 110 y-a+b (a) (b) (c) 111 ya+b+cin Figure 5.14 applications, however, gray code (Pedroni 2008), which is an UDC (Unit Distance Code) because any two adjacent code words differ by just one bit, might be preferred (in elec- tromechanical applications, for example). This exercise deals with the design of a circuit capable of converting regular binary code into gray code. a) Just to practice with gray code, make a table with two columns, placing the 16 four-bit binary entries in the first column, and the corresponding gray values in the second column b) In order to implement a generic converter, find a closed-form expression for binary-to gray conversion. Use it to check your entries in the second column for part (a) c) Write a VDHL code from which this converter can be inferred. Enter N (number of bits) as a GENERIC parameter, and use the closed-form expression obtained above to do the computations. Include simulation results in your solution

Answer 1

stizume Thiead: is udzalion ya Ine basic uni An od celain ILu ل، _صعر٢ - pregram cuuntu (pe) egiske set afack ف A uelo bnouse o wh sevo Ghe Sngle andmutIheadh Precass له لمعل -les Code dala le Code meges less Negusless Pregusters elack sleul slact stack 4hread multilhace Sngle hachd

S.lay degna C3.1A1/e) hune-e t nume = -NUme 1 * dno d enoi fem nimdin Sum su + deim 2