BCD Arithmetic

Rashmi Patil

© Copyright 2000 Indiana University Board of Trustees

 Binary Coded Decimal
Representation of a Decimal Number

© Copyright 2000 Indiana University Board of Trustees

Truth Table for Binary Coded Decimal

Decimal Number BCD 8421 Code

0 0000 0000
1 0000 0001
2 0000 0010
3 0000 0011
4 0000 0100
5 0000 0101
6 0000 0110
7 0000 0111
8 0000 1000
9 0000 1001

© Copyright 2000 Indiana University Board of Trustees

Truth Table for Binary Coded Decimal

Decimal Number BCD 8421 Code

10 (1+0) 0001 0000
11 (1+1) 0001 0001
12 (1+2) 0001 0010
… …
20 (2+0) 0010 0000
21 (2+1) 0010 0001
22 (2+2) 0010 0010

© Copyright 2000 Indiana University Board of Trustees

 BCD Addition
• The rules are given below in three steps with an
example to make the idea of BCD Addition clear.

© Copyright 2000 Indiana University Board of Trustees

 BCD Addition

© Copyright 2000 Indiana University Board of Trustees

 BCD Addition
• As you can see the result is valid in BCD.
But in case 2 the result was already valid BCD,
so there is no need to add 6. This is how BCD

© Copyright 2000 Indiana University Board of Trustees

Examples on BCD Addition

© Copyright 2000 Indiana University Board of Trustees

Examples on BCD Addition

© Copyright 2000 Indiana University Board of Trustees