๐Ÿ”ข What is a Half Adder?

Basic Combinational Circuit in Digital Logic

Definition

A Half Adder is a basic combinational circuit in digital logic that adds two single-bit binary numbers.

๐Ÿ“ฅ Inputs: Two bits โ†’ A and B

๐Ÿ“ค Outputs: Two results โ†’

  • Sum (S) โ†’ the addition result
  • Carry (C) โ†’ the carry-over if the sum is greater than 1

It is called a "half" adder because it cannot handle carry input from a previous stage (unlike the Full Adder).

Binary Addition Rules

In binary:

0 + 0 = 0 (Sum = 0, Carry = 0)

0 + 1 = 1 (Sum = 1, Carry = 0)

1 + 0 = 1 (Sum = 1, Carry = 0)

1 + 1 = 10 (Sum = 0, Carry = 1 โ†’ 1 is carry, 0 is sum)

Truth Table of Half Adder

Input A Input B Sum (S) Carry (C)
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1
Key Observations
  • When none of the inputs is 1, the carry output is 0.
  • The 'sum' bit defines the least important part of the sum.
  • The sum and carry have the following SOP form:
  • Sum = A'B + AB'
    Carry = AB

Boolean Expressions

From the truth table:

Sum (S)
S = A โŠ• B (XOR gate)
Carry (C)
C = A ยท B (AND gate)

Logic Diagram of Half Adder

XOR Gate
โŠ•
Produces Sum
AND Gate
โˆง
Produces Carry
๐Ÿ‘‰ So, the Half Adder = XOR + AND

Block Diagram

A
โ†’
Half
Adder
โ†’
Sum
B
โ†’
โ†’
Carry

As can be seen, the block diagram has two inputs and two outputs. The half adder's input states are represented by the augent and addent bits, while its output states are carry and sum.

Design of Half Adder Circuit

The two logic gates listed below are used in the design of the half adder:

The Half Adder is designed by combining the 'XOR' and 'AND' gates and provide the sum and carry.

Boolean Expressions
Sum = A XOR B (AโŠ•B)
Carry = A AND B (AยทB)

Real World Example

Imagine adding binary numbers 1 and 1:

๐Ÿ“ฅ Inputs: A=1, B=1

๐Ÿ“ค Half Adder output: Sum=0, Carry=1 โ†’ meaning "2" in binary (10).

This is exactly what happens inside the ALU (Arithmetic Logic Unit) of a CPU when it performs addition. The Half Adder is the building block for larger adders like the Full Adder, Ripple Carry Adder, and eventually the processor's arithmetic unit.

Half Adder Applications

Half adders are fundamental components in various digital systems and arithmetic circuits. Here are some key applications:

Binary Addition

Half adders are used to perform basic binary addition of single-bit numbers.

Building Full Adders

Multiple half adders can be combined to create full adders, which can add multi-bit binary numbers.

Arithmetic Logic Units (ALUs)

ALUs in processors use half adders and full adders to perform arithmetic operations.

Digital Counters

Half adders are used in the design of digital counters and registers.

Summary

โœ… Half Adder = simple circuit that adds two bits.

โœ… Outputs: Sum (XOR), Carry (AND).

โœ… Limitation: cannot add carry from a previous stage (that's why it's called "half").

โœ… A fundamental building component for adding two numbers as inputs and producing two outputs is the half adder. The OR operation of two single-bit binary values is carried out by the adder. The half adder has two output states, "carry" and "sum," and two input states, the augent and addent bits.

Half adders are essential building blocks in digital logic circuits, forming the foundation for more complex arithmetic operations in computer systems.