Chapter 4 Combinational Logic

■ Logic circuits for digital systems may be

combinational or sequential.
■ A combinational circuit consists of input variables,
logic gates, and output variables.

1
 4-2. Analysis procedure
■ To obtain the output Boolean functions from a
logic diagram, proceed as follows:
1. Label all gate outputs that are a function of input variables
with arbitrary symbols. Determine the Boolean functions
for each gate output.
2. Label the gates that are a function of input variables and
previously labeled gates with other arbitrary symbols. Find
the Boolean functions for these gates.

2
 4-2. Analysis procedure
3. Repeat the process outlined in step 2 until the outputs of
the circuit are obtained.
4. By repeated substitution of previously defined functions,
obtain the output Boolean functions in terms of input
variables.

3
 Example
F2 = AB + AC + BC; T1 = A + B + C; T2 = ABC; T3 = F2’T1;
F1 = T3 + T2
F1 = T3 + T2 = F2’T1 + ABC = A’BC’ + A’B’C + AB’C’ + ABC

4
 Derive truth table from logic
diagram
■ We can derive the truth table in Table 4-1 by using
the circuit of Fig.4-2.

5
 4-3. Design procedure
1. Table4-2 is a Code-Conversion example, first, we
can list the relation of the BCD and Excess-3
codes in the truth table.

6
 Karnaugh map
2. For each symbol of the Excess-3 code, we use 1’s
to draw the map for simplifying Boolean function.

7
 Circuit implementation
z = D’; y = CD + C’D’ = CD + (C + D)’
x = B’C + B’D + BC’D’ = B’(C + D) + B(C + D)’
w = A + BC + BD = A + B(C + D)

8
 4-4. Binary Adder-Subtractor
■ A combinational circuit that performs the addition of two
bits is called a half adder.
■ The truth table for the half adder is listed below:

S: Sum
C: Carry

S = x’y + xy’
C = xy

9
Implementation of Half-Adder

10
 Full-Adder
■ One that performs the addition of three bits(two
significant bits and a previous carry) is a full adder.

11
Simplified Expressions

S = x’y’z + x’yz’ + xy’z’ + xyz

C = xy + xz + yz
12
Full adder implemented in SOP

13
 Another implementation
■ Full-adder can also implemented with two half
adders and one OR gate (Carry Look-Ahead adder).
S = z ⊕ (x ⊕ y)
= z’(xy’ + x’y) + z(xy’ + x’y)’
= xy’z’ + x’yz’ + xyz + x’y’z
C = z(xy’ + x’y) + xy = xy’z + x’yz + xy

14
 Binary adder
■ This is also called
Ripple Carry Adder
,because of the
construction with full
adders are
connected in
cascade.

15
 Carry Propagation
■ Fig.4-9 causes a unstable factor on carry bit, and produces
a longest propagation delay.
■ The signal from Ci to the output carry Ci+1, propagates
through an AND and OR gates, so, for an n-bit RCA, there
are 2n gate levels for the carry to propagate from input to
output.

16
 Carry Propagation
■ Because the propagation delay will affect the output signals
on different time, so the signals are given enough time to
get the precise and stable outputs.
■ The most widely used technique employs the principle of
carry look-ahead to improve the speed of the algorithm.

17
 Boolean functions
Pi = Ai ⊕ Bi steady state value
Gi = AiBi steady state value
Output sum and carry
Si = Pi ⊕ Ci
Ci+1 = Gi + PiCi
Gi : carry generate Pi : carry propagate
C0 = input carry
C1 = G0 + P0C0
C2 = G1 + P1C1 = G1 + P1G0 + P1P0C0
C3 = G2 + P2C2 = G2 + P2G1 + P2P1G0 + P2P1P0C0

■ C3 does not have to wait for C2 and C1 to

propagate.
18
 Logic diagram of
carry look-ahead generator
■ C3 is propagated at the same time as C2 and C1.

19
 4-bit adder with carry lookahead
■ Delay time of n-bit CLAA = XOR + (AND + OR) + XOR

20
 4-8. Decoders
■ The decoder is called n-to-m-line decoder, where
m≤2n .
■ the decoder is also used in conjunction with other
code converters such as a BCD-to-seven_segment
decoder.
■ 3-to-8 line decoder: For each possible input
combination, there are seven outputs that are
equal to 0 and only one that is equal to 1.

21
Implementation and truth table

22
 Decoder with enable input
■ Some decoders are constructed with NAND gates, it
becomes more economical to generate the decoder
minterms in their complemented form.
■ As indicated by the truth table , only one output can be
equal to 0 at any given time, all other outputs are equal to
1.

23
 Demultiplexer
■ A decoder with an enable input is referred to as a
decoder/demultiplexer.
■ The truth table of demultiplexer is the same with
decoder. A B

D0

E
Demultiplexer D1
D2
D3

24
 3-to-8 decoder with enable
implement the 4-to-16 decoder

25
 Implementation of a Full Adder
with a Decoder
■ From table 4-4, we obtain the functions for the combinational circuit in
sum of minterms:
S(x, y, z) = ∑(1, 2, 4, 7)
C(x, y, z) = ∑(3, 5, 6, 7)

26
 4-9. Encoders
■ An encoder is the inverse operation of a decoder.
■ We can derive the Boolean functions by table 4-7
z = D1 + D3 + D5 + D7
y = D2 + D3 + D6 + D7
x = D4 + D5 + D6 + D7

27
 Priority encoder
■ If two inputs are active simultaneously, the output produces
an undefined combination. We can establish an input
priority to ensure that only one input is encoded.
■ Another ambiguity in the octal-to-binary encoder is that an
output with all 0’s is generated when all the inputs are 0;
the output is the same as when D0 is equal to 1.
■ The discrepancy tables on Table 4-7 and Table 4-8 can
resolve aforesaid condition by providing one more output to
indicate that at least one input is equal to 1.

28
 Priority encoder
V=0🡪 no valid inputs
V=1🡪 valid inputs

X’s in output columns represent

don’t-care conditions
X’s in the input columns are
useful for representing a truth
table in condensed form.
Instead of listing all 16
minterms of four variables.

29
 4-input priority encoder
0
■ Implementation of 0
table 4-8 0
0
x = D2 + D3
y = D3 + D1D’2
V = D0 + D1 + D2 + D3

30
 4-10. Multiplexers
S = 0, Y = I0 Truth Table🡪 S Y Y = S’I0 + SI1
S = 1, Y = I1 0 I0
1 I1

31
4-to-1 Line Multiplexer

32
 Quadruple 2-to-1 Line Multiplexer
■ Multiplexer circuits can be combined with common selection inputs to
provide multiple-bit selection logic. Compare with Fig4-24.

I0 Y

I1

33
 Boolean function implementation
■ A more efficient method for implementing a Boolean
function of n variables with a multiplexer that has n-1
selection inputs.
F(x, y, z) = Σ(1,2,6,7)

34
 4-input function with a
multiplexer
F(A, B, C, D) = Σ(1, 3, 4, 11, 12, 13, 14, 15)

35