Conclusion

After analyzing the data we have gathered, we therefore conclude that a binary number
can be converted to excess 3 code can be converted just by adding the binary equivalent of 3 to
the binary number. Simply add 011 in each binary number. Similarly a number in excess 3 code
can be converted to binary just by subtracting the binary equivalent of 3 from the binary number.
We were able to design a circuit implementing the equation formulated using Karnaugh Map and
we determined the output given the different combinations of inputs 1 meaning on and 0 as
off using Integrated Circuits in conformity with the excess 3 code property. The output obtained
for the four functions further affirms the property of excess 3 code. It is a way to represent values
with a balanced number of positive and negative numbers using a pre-specified number N as a
biasing value. It is a non-weighted code. Adding Excess-3 works on a different algorithm than
non-biased decimal coding or regular binary positional system numbers. When you add two XS3 numbers together, the result is not an XS-3 number.
We have also concluded that, when you add 1 and 0 in XS-3 the answer seems to
be 4 instead of 1. In order to correct this problem, when you are finished adding each digit, you
have to remove the extra bias by subtracting binary 0011 (decimal 3 in unbiased binary) if the
resulting digit is less than decimal 10 and subtracting binary 1101 (decimal 13 in unbiased
binary), if an overflow has occurred. Note that, in 4-bit binary, subtracting binary 1101 is
equivalent to adding 0011 and vice versa.