Scribd
Upload
62 views5 pages

Clar, Steve E. Exercise 2a: Boolean Algebra

The document discusses summarizing and simplifying combinational logic circuits. It provides examples of deriving the boolean functions of a sample circuit and simplifying the circuit. Specifically: 1. It shows deriving the boolean functions x = a'b'c' + a'bc' + a'bc + abc' + ab'c and y = a'bc' + ab'c' + ab'c for the sample circuit. 2. It then simplifies the functions to x = a'c' + a'bc + ab'c + abc' and y = (a + b)(a + c')(b' + a')(b' + c') using boolean algebra identities.

Uploaded by

Steve Clar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
62 views5 pages

Clar, Steve E. Exercise 2a: Boolean Algebra

The document discusses summarizing and simplifying combinational logic circuits. It provides examples of deriving the boolean functions of a sample circuit and simplifying the circuit. Specifically: 1. It shows deriving the boolean functions x = a'b'c' + a'bc' + a'bc + abc' + ab'c and y = a'bc' + ab'c' + ab'c for the sample circuit. 2. It then simplifies the functions to x = a'c' + a'bc + ab'c + abc' and y = (a + b)(a + c')(b' + a')(b' + c') using boolean algebra identities.

Uploaded by

Steve Clar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

CLAR, STEVE E.

Exercise 2a

1. Explain the different and faster way of evaluating the values for the output signals
using backward method; trace the circuit from the output back to the inputs.

Unlike Sequential Logic Circuits, which have outputs that are dependent on both current
inputs and previous output states, Sequential Logic Circuits have some kind of Memory.
Combinational Logic Circuits' outputs are solely determined by the logical function of their
current input state, which is either logic "0" or logic "1" at any given time.

As a consequence, combinational logic circuits lack feedback, and any changes to the
signals applied to their inputs would have an immediate impact on the output. In other words,
the output of a Combinational Logic Circuit is always dependent on the combination of its
inputs. As a result, a combinational circuit has no memory.

The three main ways of specifying the function of a combinational logic circuit are:

Boolean Algebra. This forms the algebraic expression showing the operation of the logic
circuit for each input variable either True or False that results in a logic “1” output.
Truth Table. A truth table defines the function of a logic gate by providing a concise list
that shows all the output states in tabular form for each possible combination of input
variable that the gate could encounter.
Logic Diagram. This is a graphical representation of a logic circuit that shows the wiring
and connections of each individual logic gate, represented by a specific graphical symbol that
implements the logic circuit.
If given the output, we can create our Boolean Expression which we can base on the logic
circuit or using simpler and faster way like referring to the truth table (if given), K-map and
tabulation method. Then if possible, we can simplify our derived Boolean expression before
we compare the output to the expression. As a result of comparing these two, we can now
arrive to the inputs.
CLAR, STEVE E.
Exercise 2a

2. Derive the Boolean function of this circuit.


Answer:

y’
xy’

yz’+y’z
xy’+yz’+y’z xx'y’+x’yz’+x’y’z
x’

(xyz’+xy’z)’

𝑓 = 𝑥𝑥 ′ 𝑦 ′ + 𝑥 ′ 𝑦𝑧 ′ + 𝑥′𝑦′𝑧
Since based on complementary law xx’ = 0.

𝒇 = 𝒙′ 𝒚𝒛′ + 𝒙′𝒚′𝒛 𝒈 = (𝒙𝒚𝒛′ + 𝒙𝒚′ 𝒛)′ 𝒐𝒓 𝒈 = 𝒙′ 𝒚′ 𝒛 + 𝒙′𝒚𝒛′


CLAR, STEVE E.
Exercise 2a

3. What will be the equation for x and y? Show your complete solution.

x y
a’b’c’

a’bc’ a’bc’
a’bc
ab’c’

ab’c ab’c
abc’

𝒙 = 𝒂′ 𝒃′ 𝒄′ + 𝒂′ 𝒃𝒄′ + 𝒂′ 𝒃𝒄 + 𝒂𝒃′ 𝒄 + 𝒂𝒃𝒄′ 𝒚 = 𝒂′ 𝒃𝒄′ + 𝒂𝒃′𝒄′ + 𝒂𝒃′ 𝒄

FIGURE 1: ORIGINAL LOGIC CIRCUIT using LTspice XVII


In Figure 1, I used five three-input AND gates, one three-input and two two-input OR gates
which is based on the equation x. For equation y, since both x and y are similar for a’bc’ and
ab’c we could optimize the circuit. We can add one three-input AND gate and one three-input
OR gate instead of adding another two additional AND gates.
CLAR, STEVE E.
Exercise 2a

(4) Simplifying the Circuit.

𝒙 = 𝒂′ 𝒃′ 𝒄′ + 𝒂′ 𝒃𝒄′ + 𝒂′ 𝒃𝒄 + 𝒂𝒃′ 𝒄 + 𝒂𝒃𝒄′

Using Factorization,
𝑥 = 𝑎′ 𝑐 ′ (𝑏′ + 𝑏) + 𝑎′ 𝑏𝑐 + 𝑎𝑏 ′ 𝑐 + 𝑎𝑏𝑐′

Using Boolean Complementarity Law,


𝑥 = 𝑎′ 𝑐 ′ (1) + 𝑎′ 𝑏𝑐 + 𝑎𝑏 ′ 𝑐 + 𝑎𝑏𝑐′

Using Identity Law,


𝑥 = 𝑎′ 𝑐 ′ + 𝑎′ 𝑏𝑐 + 𝑎𝑏 ′ 𝑐 + 𝑎𝑏𝑐′

For
𝒚 = 𝒂′ 𝒃𝒄′ + 𝒂𝒃′𝒄′ + 𝒂𝒃′ 𝒄

Using Commutativity in the 2nd and 3rd term,


𝑦 = 𝑎′ 𝑏𝑐 ′ + 𝑎𝑏′𝑐 + 𝑎𝑏 ′ 𝑐′

Using Factorization,
𝑦 = 𝑎′ 𝑏𝑐 ′ + 𝑎𝑏′(𝑐 + 𝑐 ′ )

Using Boolean Complementarity Law and Identity law,


𝑦 = 𝑎′ 𝑏𝑐 ′ + 𝑎𝑏′(1) = 𝑎′ 𝑏𝑐 ′ + 𝑎𝑏′

Using Distributivity (or-major Form),


𝑦 = (𝑎′ 𝑏𝑐 ′ + 𝑎)(𝑎′ 𝑏𝑐 ′ + 𝑏 ′ )

Using Commutativity in 𝑎′ 𝑏𝑐 ′ + 𝑎 and 𝑎′ 𝑏𝑐 ′ + 𝑏 ′ ,


𝑦 = (𝑎 + 𝑎′ 𝑏𝑐 ′ )(𝑏 ′ + 𝑎′ 𝑏𝑐 ′ )

Using Distributivity (or-major Form),


𝑦 = (𝑎 + 𝑎′ )(𝑎 + 𝑏)(𝑎 + 𝑐 ′ )(𝑏 ′ + 𝑎′ )(𝑏 ′ + 𝑏)(𝑏 ′ + 𝑐 ′ )

Using Commutativity in 𝑎 + 𝑎′ ,
𝑦 = (𝑎′ + 𝑎)(𝑎 + 𝑏)(𝑎 + 𝑐 ′ )(𝑏 ′ + 𝑎′ )(𝑏 ′ + 𝑏)(𝑏 ′ + 𝑐 ′ )

Using Boolean Complementarity Law,


𝑦 = (1)(𝑎 + 𝑏)(𝑎 + 𝑐 ′ )(𝑏′ + 𝑎′ )(1)(𝑏 ′ + 𝑐 ′ )

Using Identity Law,


𝑦 = (𝑎 + 𝑏)(𝑎 + 𝑐 ′ )(𝑏 ′ + 𝑎′ )(𝑏 ′ + 𝑐 ′ )
CLAR, STEVE E.
Exercise 2a

FIGURE 2: SIMPLIFIED LOGIC CIRCUIT using LTspice XVII

In Figure 2, I used one two-input and three three-input AND gates, three two-input OR
gates which is based on the simplified equation x. For the simplified equation y, I used four
two-input OR gates and one two-input and one three-input AND gate.

You might also like