# Digital Logic | Code Converters – BCD(8421) to/from Excess-3

**Prerequisite –** Number System and base conversions

Excess-3 binary code is a **unweighted self-complementary** BCD code.

Self-Complementary property means that the 1’s complement of an excess-3 number is the excess-3 code of the 9’s complement of the corresponding decimal number. This property is useful since a decimal number can be nines’ complemented (for subtraction) as easily as a binary number can be ones’ complemented; just by inverting all bits.

For example, the excess-3 code for 3(0011) is 0110 and to find the excess-3 code of the complement of 3, we just need to find the 1’s complement of 0110 -> 1001, which is also the excess-3 code for the 9’s complement of 3 -> (9-3) = 6.

### Converting BCD(8421) to Excess-3 –

As is clear by the name, a BCD digit can be converted to it’s corresponding Excess-3 code by simply adding 3 to it.

Let be the bits representing the binary numbers, where is the LSB and is the MSB, and

Let be the bits representing the gray code of the binary numbers, where is the LSB and is the MSB.

The truth table for the conversion is given below. The X’s mark don’t care conditions.

To find the corresponding digital circuit, we will use the K-Map technique for each of the Excess-3 code bits as output with all of the bits of the BCD number as input.

Corresponding minimized Boolean expressions for Excess-3 code bits –

The corresponding digital circuit-

### Converting Excess-3 to BCD(8421) –

Excess-3 code can be converted back to BCD in the same manner.

Let be the bits representing the binary numbers, where is the LSB and is the MSB, and

Let be the bits representing the gray code of the binary numbers, where is the LSB and is the MSB.

The truth table for the conversion is given below. The X’s mark don’t care conditions.

K-Map for D-

K-Map for C-

K-Map for B-

K-Map for A-

<img src="

Corresponding minimized boolean expressions for Excess-3 code bits –

The corresponding digital circuit –

Here correspond to and correspond to .

**References-**

Digital Design, 5th edition by Morris Mano and Michael Ciletti

Excess-3 – Wikipedia

This article is contributed by **Chirag Manwani**. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

## Recommended Posts:

- Digital logic | Code Converters - Binary to/from Gray Code
- Digital Logic | Logic Gates
- Digital Logic | 5 variable K-Map
- Counters in Digital Logic
- Digital logic | Encoder
- Digital Logic | Implicants in K-Map
- Digital Logic | Latches
- Digital Logic | n-bit Johnson Counter
- Digital logic | Encoders and Decoders
- Digital Logic | Consensus theorem
- Digital Logic | Number of possible Functions
- Digital logic | Ripple Counter
- Digital logic | Binary Decoder
- Digital logic | Functional Completeness
- Digital Logic | Full Subtractor