🔢BCD Adder

Interactive Binary-Coded Decimal Addition

📚What is a BCD Adder?

A Binary-Coded Decimal (BCD) Adder is a specialized digital circuit that performs arithmetic addition on decimal digits represented in 4-bit binary form. Unlike standard binary addition, BCD addition requires special correction logic to maintain valid decimal representation.

In BCD, each decimal digit (0-9) is represented using 4 bits. However, standard binary addition can produce results greater than 9, which are invalid in BCD. The BCD adder automatically detects and corrects these invalid results.

🎮Interactive BCD Addition Demo

⚙️BCD Adder Architecture

A BCD adder stage consists of two main components working together:

4-bit Binary Adder
→
Correction Logic
→
Second Adder (if needed)

Input Signals (9 total):

Output Signals (5 total):

🔧Correction Logic

Correction is required when the binary sum exceeds 9 or generates a carry. In these cases, 0110 (decimal 6) is added to the intermediate sum.

Correction Equation

C = K + Z8Z4 + Z8Z2

Where C is the carry-out signal that triggers correction

TABLE 10-4: Derivation of BCD Adder

Binary Sum BCD Sum Decimal
K Z8 Z4 Z2 Z1 C S8 S4 S2 S1
00000 00000 0
00001 00001 1
00010 00010 2
00011 00011 3
00100 00100 4
00101 00101 5
00110 00110 6
00111 00111 7
01000 01000 8
01001 01001 9
01010 10000 10
01011 10001 11
01100 10010 12
01101 10011 13
01110 10100 14
01111 10101 15
10000 10110 16
10001 10111 17
10010 11000 18
10011 11001 19

Legend: Green = No correction (0-9) Orange = Correction needed (10-15) Red = Carry generated (16-19)

📐Block Diagram: BCD Adder Circuit

The following diagram shows the internal architecture of a BCD adder with correction logic:

BCD Adder Block Diagram

Block diagram showing the two-stage BCD adder with correction logic.
The first 4-bit adder produces intermediate sum (Z), correction logic detects invalid BCD, and the second adder applies correction (adds 0110) when necessary.

BCD Subtraction