To be submitted by 3122213002100 Sivasankar S

To be Verified by 3122213002081 Prasanna Karthikeyan G

Date of Submission 22-11-2022

Topics Unit – 2 Code Converters

1. Describe code converter? List their types.

2. Design a combinational circuit that converts 4-bit binary number to a 4-bit gray code.
Implement the circuit.
3. Design a combinational circuit that converts 4-bit gray code to a 4-bit binary number.
Implement the circuit.
4. Design a BCD to Gray code converter. Use don’t care. Implement the circuit.
5. Design a Gray code to BCD converter. Use don’t care. Implement the circuit.
6. Design a BCD to binary code converter. Use don’t care. Implement the circuit.
7. Design a binary code to BCD converter. Use don’t care. Implement the circuit.
8. Design a four-bit BCD to excess-3 code converter. Draw the logic diagram. /
Construct a combinational circuit to convert given binary coded decimal number into
an Excess-3 code. For example, when the input to the gate is 0110 then the circuit
should generate output as 1001.
9. Design a BCD to excess 3 code converter using minimum number of NAND gates.
10. Design a combinational circuit to convert Excess-3 code to BCD code.
11. Design a combinational circuit that generates the 9’s complement of a BCD digit.
12. Design a combinational circuit whose input is a four-bit number and whose output is
the 2’s complement of the input number.
13. Design a combinational circuit that converts a decimal digit from the 2:4:2:1 code to
the 8:4:-2:-1 code.
14. Design a combinational circuit that converts a four-bit reflected-code number to a
four-bit binary number. Implement the circuit with exclusive-OR gates.
15. The inputs to a circuit are the four bits of the binary number D 3D20D1D0. The circuit
produces a one if and only if all the following conditions hold,
a. MSB is 1 or any of the other bits are a 0.
b. D2 is a 1 or any other bits are a 0.
c. Any of the 4 bits are 0
Obtain a minimal expression for the output.
16. A majority gate is a digital circuit whose output is equal to 1 if majority of its inputs
are 1’s. The output is 0 otherwise. Using a truth table, find the Boolean function
implemented by a 3-input majority gate. Simplify the function and implement it with
logic gates.