Arithmetic Circuits
Definition
An arithmetic circuit is a combinational digital circuit designed to perform arithmetic operations on binary numbers, such as addition, subtraction, increment, decrement, and sometimes multiplication or division using interconnected logic gates and binary arithmetic principles.
In simple terms, arithmetic circuits accept binary inputs, apply arithmetic rules, and produce a binary output. The most common arithmetic circuit is the binary adder, which forms the foundation for many other arithmetic units.
Main Content
1. Binary Adder
- A binary adder is a circuit that adds two binary numbers and produces a sum along with a carry output.
- It is the most fundamental arithmetic circuit because more complex arithmetic operations are built using adder structures.
A binary adder works on the same principle as decimal addition, but instead of using digits 0–9, it uses bits 0 and 1. Since binary addition can produce a carry, adder circuits must manage both the sum bit and carry bit.
Types of Binary Adders
Half Adder
- Adds two single binary digits.
- Produces two outputs:
- Sum
- Carry
- It does not accept an input carry from a previous stage.
Truth table:
| A | B | Sum | Carry |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 |
Example:
- 1 + 1 = 10
- Sum = 0, Carry = 1
Full Adder
- Adds three binary inputs:
- A
- B
- Carry-in
- Produces:
- Sum
- Carry-out
It is used when adding multi-bit binary numbers, because each stage must accept carry from the previous stage.
Truth table:
| A | B | Cin | Sum | Cout |
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 1 | 0 |
| 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 1 | 0 | 1 |
| 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 1 | 0 | 1 |
| 1 | 1 | 0 | 0 | 1 |
| 1 | 1 | 1 | 1 | 1 |
Boolean equations:
- Sum = A ⊕ B ⊕ Cin
- Cout = AB + Cin(A ⊕ B)
ASCII view of a full adder concept:
A ----\ \ ---- Sum B -----> XOR --/ / Cin --XOR
Carry logic combines AND and OR operations to form Cout.
Ripple Carry Adder
- A ripple carry adder connects multiple full adders in series.
- The carry output of one full adder becomes the carry input of the next.
- It is simple but slower because the carry must “ripple” through all stages.
Example:
- To add 4-bit numbers, four full adders are connected in a chain.
- If the least significant bit generates a carry, the next adder must wait for it.
This design is easy to build but has a delay problem for large numbers because every stage depends on the previous carry.
2. Subtraction Circuits
- Subtraction circuits are used to subtract one binary number from another.
- In digital systems, subtraction is commonly implemented using addition methods and two’s complement representation.
Binary subtraction can be difficult if done directly, so circuits usually convert subtraction into addition. This is more efficient because the same adder circuit can perform both operations.
Two’s Complement Subtraction
- To subtract B from A, the circuit adds A to the two’s complement of B.
- Two’s complement of a binary number is found by:
- Inverting all bits
- Adding 1
Example:
- Subtract 5 from 9 in 4-bit binary
- 9 = 1001
- 5 = 0101
- Two’s complement of 0101:
- Invert → 1010
- Add 1 → 1011
- Add:
- 1001 + 1011 = 1 0100
- Ignore the extra carry → 0100, which is 4
Adder-Subtractor Circuit
- A single circuit can perform both addition and subtraction.
- It uses XOR gates to conditionally invert the B input.
- A control input selects whether the operation is addition or subtraction.
How it works:
- If control = 0:
- B remains unchanged
- The circuit performs A + B
- If control = 1:
- B is inverted
- 1 is added through carry-in
- The circuit performs A − B
This design is widely used in ALUs because it reduces hardware complexity.
ASCII view of adder-subtractor idea:
B ----XOR----\ \ Control --------> XOR effect / A ------------> Full Adder Chain
When control is 1, B is complemented and carry-in becomes 1, enabling two’s complement subtraction.
Borrow in Subtraction
- In direct subtraction, if the minuend bit is smaller than the subtrahend bit, a borrow is needed from the next higher bit.
- Borrow handling makes direct subtraction more complex than addition.
- That is why complement-based subtraction is preferred in digital design.
3. Multiplication and Division Circuits
- Multiplication and division circuits perform repeated addition, subtraction, shifting, and accumulation.
- These circuits are more complex than adders and subtractors but are still based on arithmetic circuit principles.
Multiplication Circuits
- Binary multiplication is similar to decimal multiplication.
- It is usually implemented using:
- Partial products
- Shift operations
- Addition of partial results
Example:
- Multiply 1011 (11) by 0101 (5)
- Partial products:
- 1011 × 1 = 1011
- 1011 × 0 = 0000 (shifted)
- 1011 × 1 = 1011 (shifted)
- 1011 × 0 = 0000 (shifted)
- Add all partial products to get the final answer.
Hardware structures for multiplication include:
- Shift-and-add multiplier
- Array multiplier
- Booth multiplier
Shift-and-add multiplier
- Uses a register and adder.
- Checks multiplier bits one by one.
- Adds the multiplicand when the multiplier bit is 1.
- Shifts after each step.
Division Circuits
- Binary division is the inverse of multiplication.
- It is commonly implemented using:
- Repeated subtraction
- Shifting
- Comparison operations
Division circuits are used to determine:
- Quotient
- Remainder
Example:
- Divide 13 by 3
- 13 ÷ 3 = 4 remainder 1
Hardware division methods include:
- Restoring division
- Non-restoring division
These methods repeatedly compare and subtract the divisor from portions of the dividend.
Role in Processors
- Multipliers and dividers are often part of the arithmetic logic unit.
- Modern processors may use specialized high-speed units because multiplication and division are slower than addition.
Working / Process
1. Input Representation
- The binary numbers are first placed into the circuit using registers or input lines.
- Each bit is processed individually, starting from the least significant bit in most arithmetic operations.
- If the operation is addition, both numbers are directly applied to the adder. If subtraction is needed, the second number may be complemented.
2. Operation Execution
- The circuit applies logic gate combinations to compute the required arithmetic result.
- In adders, XOR gates determine sum bits and AND/OR gates generate carry bits.
- In subtractors, the circuit uses two’s complement and carry-in logic.
- In multiplication and division, shifting, partial sums, and repeated operations are used.
3. Output Generation
- The final result is produced as a binary output.
- In multi-bit circuits, each stage contributes to the final sum or difference.
- The circuit may also produce status outputs such as carry, borrow, overflow, quotient, or remainder depending on the operation.
Example of multi-bit addition process:
- Add 1011 and 0110
- Bit-by-bit:
- 1 + 0 = 1
- 1 + 1 = 0, carry 1
- 0 + 1 + carry = 0, carry 1
- 1 + 0 + carry = 0, carry 1
- Final output = 10001
Advantages / Applications
- Arithmetic circuits allow fast and automated numerical computation in digital systems.
- They form the core of ALUs in microprocessors and microcontrollers.
- They are used in calculators, digital watches, embedded devices, and scientific instruments.
- They improve accuracy and reliability because binary hardware operations reduce human error.
- They support complex processing tasks such as signal processing, graphics, cryptography, and scientific computation.
Summary
- Arithmetic circuits are digital circuits used to perform binary mathematical operations.
- The most important basic arithmetic circuit is the adder, which is the foundation for subtraction, multiplication, and division units.
- Complement-based methods make subtraction efficient in digital hardware.
- Important terms to remember: full adder, half adder, carry, borrow, two’s complement, ripple carry adder, ALU, multiplier, divider.