Homework Sourse723 List the PLA programming table for the BCDtoexcess3code
Solution
To Implementation of BCD to Excess-3 conversion using Logic gates.
Apparatus required:-The following electronics components are required.
•XOR Gate (IC-7486)
•AND Gate (IC-7408)
•OR Gate (IC-7432)
•NOT Gate (IC-7404)
•Digital Trainer KIT
•Breadboard
•Connecting wires
Description:-
The availability of large variety of codes for the same discrete elements of information results in the use of different codes by different systems. A conversion circuit must be inserted between the two systems if each uses different codes for same information. Thus, code converter is a circuit that makes the two systems compatible even though each uses different binary code.
The bit combination assigned to binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs and four outputs. Gray code is a non-weighted code.
The input variable are designated as B3, B2, B1, B0 and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is designed. The Boolean functions are obtained from K-Map for each output variable.
A code converter is a circuit that makes the two systems compatible even though each uses a different binary code. To convert from binary code to Excess-3 code, the input lines must supply the bit combination of elements as specified by code and the output lines generate the corresponding bit combination of code. Each one of the four maps represents one of the four outputs of the circuit as a function of the four input variables.
A two-level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is C+D has been used to implement partially each of three outputs.
Logic Diagram for BCD to Excess-3 Converter:-
K-Map for E3:- E3 = B3 + B2 (B0 + B1)
K-Map for E2:-
K-Map for E1:-
K-Map for E0:- E0=Bar (B0)
Truth-Table:-
