Design of Subtractors

Design of Subtractors in Digital Logic

Subtractors are digital circuits used to subtract one binary number from another. Like adders, subtractors are essential components in arithmetic units (ALUs) of digital systems and processors. The basic operation of subtraction in binary involves borrowing, and subtractors are designed to handle this process.

There are two main types of subtractors:

1. Half Subtractor (HS)
2. Full Subtractor (FS)

We'll explore both types of subtractors in detail, along with their design and applications.

---

1. Half Subtractor (HS)

A half subtractor is the simplest subtractor circuit that subtracts two binary digits. It subtracts two single-bit numbers and produces two outputs:

• Difference (D)
• Borrow (B)

A half subtractor does not take into account any borrow from a previous stage, hence the term "half."

Truth Table for Half Subtractor:

A	B	Difference (D)	Borrow (B)
0	0	0	0
0	1	1	1
1	0	1	0
1	1	0	0

Boolean Equations for Half Subtractor:

• Difference: $D = A \oplus B$ (XOR gate)
• Borrow: $B = \neg A \cdot B$ (AND gate)

Circuit Diagram:

• The difference is computed using an XOR gate, which outputs 1 when the inputs are different.
• The borrow is computed using an AND gate, which outputs 1 when A is 0 and B is 1.

---

2. Full Subtractor (FS)

A full subtractor is a more general subtractor that can handle the subtraction of two binary digits with a borrow input. It subtracts three bits:

• Two significant bits (A and B)
• A borrow bit from the previous stage (Borrow_in, $B_{in}$)

The full subtractor produces two outputs:

• Difference (D)
• Borrow_out (B_out)

Truth Table for Full Subtractor:

A	B	Borrow_in (Bin)	Difference (D)	Borrow_out (Bout)
0	0	0	0	0
0	0	1	1	1
0	1	0	1	1
0	1	1	0	1
1	0	0	1	0
1	0	1	0	0
1	1	0	0	0
1	1	1	1	0

Boolean Equations for Full Subtractor:

• Difference: $D = A \oplus B \oplus B_{in}$ (XOR gate)
• Borrow-out: $B_{out} = \neg A \cdot B + (B_{in} \cdot (A \oplus B))$ (AND and OR gates)

Circuit Diagram:

• The difference is calculated using two XOR gates: one for $A \oplus B$, and the second for $(A \oplus B) \oplus B_{in}$.
• The borrow-out is calculated using AND and OR gates based on the Boolean equation.

---

Design Considerations for Subtractors:

1. Handling Borrowing:

   • Subtractors must be able to handle the borrow process, which happens when the digit being subtracted is larger than the digit being subtracted from. The borrow is propagated to the next stage.
   • In the full subtractor, the borrow-out from the current stage becomes the borrow-in for the next stage.

2. Difference Calculation:

   • The difference is typically calculated using an XOR gate since it naturally produces the result of a bitwise subtraction (considering borrow as a factor).

3. Carry/Borrow Propagation:

   • Borrowing is a crucial aspect of binary subtraction. If a borrow is needed, it must be passed to the next lower bit.

---

3. Binary Subtraction Using Borrowing (in Ripple Mode)

In a multi-bit binary subtraction, we need to chain multiple full subtractors together. Each subtractor handles a pair of bits (from the two numbers being subtracted) and takes the borrow from the previous subtractor. This is similar to how a ripple carry adder works.

Ripple Borrow Adder (Ripple Carry Subtractor):

For an $n$-bit subtraction:

1. You need n full subtractors.
2. The borrow-out of each subtractor is fed into the borrow-in of the next subtractor.

This process is known as ripple borrowing because the borrow bit ripples through all stages from the least significant bit to the most significant bit.

Example for 4-bit Subtraction:

If we want to subtract two 4-bit binary numbers $A_3 A_2 A_1 A_0$ and $B_3 B_2 B_1 B_0$, we would use four full subtractors:

• Full subtractor 1: $A_0$, $B_0$, $B_{in0}$ → Difference $D_0$, Borrow $B_1$
• Full subtractor 2: $A_1$, $B_1$, $B_1$ → Difference $D_1$, Borrow $B_2$
• Full subtractor 3: $A_2$, $B_2$, $B_2$ → Difference $D_2$, Borrow $B_3$
• Full subtractor 4: $A_3$, $B_3$, $B_3$ → Difference $D_3$, Borrow $B_4$

The final borrow-out ($B_4$) will represent whether a borrow occurred from the most significant bit.

---

4. Borrow Lookahead Adder (BLA)

To speed up the operation of subtractors, borrow lookahead logic is sometimes used. Borrow lookahead subtractors use parallel logic to generate the borrow signal for all stages simultaneously, rather than waiting for the borrow to propagate through each stage. This significantly reduces the delay in multi-bit subtractions, just as carry lookahead adders reduce delay in multi-bit additions.

---

Applications of Subtractors:

1. Arithmetic Logic Units (ALUs): Subtractors are essential components of ALUs, which perform arithmetic operations like addition, subtraction, and comparison in processors.

2. Digital Signal Processing (DSP): Subtractors are used in DSP systems for signal manipulation, especially when performing operations like filtering or image processing.

3. Binary Counters: Subtractors are used in digital counters and timers, where counting down is necessary.

4. Control Systems: Subtractors are used in control systems for error detection and correction, where the difference between expected and actual values is important.

---

Conclusion:

Subtractors are fundamental circuits in digital systems, used to perform binary subtraction. From the simple half subtractor to the more complex full subtractor and borrow lookahead techniques, subtractors are essential for various applications, including processors, ALUs, and DSP systems. Understanding the design and operation of subtractors is crucial for building efficient arithmetic circuits in digital systems.