ECE 3110: Introduction to Digital Systems

Chapter 6
Combinational Logic Design Practices

Adders, subtractors,
ALUs
Prev…

 XOR (2-level, 3-level)

 Equivalent symbols
 XNOR
 Parity Circuits (Odd, even)
 Daisy chain
 Tree
 Comparators
 Iterative
 Parallel
Adders/Subtractors
 Half Adder
 Full Adder
 Ripple Adder

 Full Subtractor
 Ripple Subtractor
 Adder/ Subtractor Circuit
Half Adder: adds two 1-bit operands

 Truth table :

X Y HS=(X+Y) CO X
0 0 0 0 HS
Y
0 1 1 0
1 0 1 0 CO
1 1 0 1

HS  X  Y
CO  X  Y
 Full Adders: provide for carries
between bit positions
 Basic building block is “full adder”
 1-bit-wide adder, produces sum and carry outputs
 Truth table:
 Full Adders: provide for carries
between bit positions
 Basic building block is “full adder”
 1-bit-wide adder, produces sum and carry outputs
 Truth table:
X Y Cin S 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
 Full Adders: provide for carries
between bit positions
 Basic building block is “full adder”
 1-bit-wide adder, produces sum and carry outputs
 Truth table:
X Y Cin S Cout
S is 1 if an odd number 0 0 0 0 0
of inputs are 1. 0 0 1 1 0
0 1 0 1 0
COUT is 1 if two or 0 1 1 0 1
more of the inputs are 1 0 0 1 0
1. 1 0 1 0 1
Recall: Table 2-3, pp32 1 1 0 0 1
1 1 1 1 1
Full-adder circuit
Full-adder circuit
Full-adder circuit
 Ripple adder

 Speed limited by carry chain

 Faster adders eliminate or limit carry chain
 2-level AND-OR logic ==> 2n product terms
 3 or 4 levels of logic, carry look-ahead
 HALF SUBTRACTOR
 A combinational circuit that performs the
subtraction of 2 bits is called a half
subtractor. This circuit accepts two binary
inputs and produces two binary outputs.
The input variables designate minuend
and subtrahend bits; the output variables
designate difference and borrow.
Half Subtrctor
 Full Subtractor:
 A full Subtractor circuit consists of three inputs
and two outputs. The outputs are denoted by a
difference and borrow. The third input
represents the borrow from the previous lower
significant position. The output difference is one
when any one of the input is one or when all the
three inputs are one. The output borrow is one
when the MSB bit is zero and when all the
inputs are high.
Truth Table
Difference = AB C
Borrow = A’C+BC+A’B