Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
9 views9 pages

Lesson 3.3 Simplifying Boolean Expression

The document discusses the simplification of Boolean expressions using algebraic rules to reduce logic circuit complexity. Several examples are provided, demonstrating the step-by-step process of simplifying various Boolean expressions. The final results of the simplifications are presented for each example.

Uploaded by

espiya402
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
9 views9 pages

Lesson 3.3 Simplifying Boolean Expression

The document discusses the simplification of Boolean expressions using algebraic rules to reduce logic circuit complexity. Several examples are provided, demonstrating the step-by-step process of simplifying various Boolean expressions. The final results of the simplifications are presented for each example.

Uploaded by

espiya402
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/ 9

Simplifying

BOOLEAN EXPRESSION
SIMPLIFYING BOOLEAN
EXPRESSION
Boolean algebra finds its most practical use in
the simplification of logic circuits. If we translate
a logic circuit’s function into symbolic (Boolean)
form and apply certain algebraic rules to the
resulting equation to reduce the number of
terms and/or arithmetic operations, the
simplified equation may be translated back into
circuit form for a logic circuit performing the
same function with fewer components.
Simplify the given Boolean Expression below.

𝑸 = 𝑨. 𝑩 + 𝑩
= 𝑩 (𝑨 + 𝟏)
= 𝑩 (𝟏)
𝑸=𝑩
Simplify the given Boolean Expression below.

𝑸 = 𝑪 (𝑨 + 𝑪ഥ)
ഥ
= 𝑪. 𝑨 + 𝑪. 𝑪
= 𝑪. 𝑨 + 𝟎
𝑸 = 𝑨. 𝑪
Simplify the given Boolean Expression below.
ഥ + 𝐀. 𝐁. 𝐂 + 𝐀. 𝑩
𝑸 = 𝑨. 𝑩. 𝑪 ഥ
ഥ + 𝐁. 𝐂 + 𝑩
= 𝑨 (𝑩. 𝑪 ഥ)
ഥ+𝐂 +𝑩
= 𝑨 (𝑩 𝑪 ഥ)
= 𝑨 (𝑩 𝟏 + 𝑩ഥ)
ഥ)
= 𝑨 (𝑩 + 𝑩
= 𝑨 (𝟏)
𝑸=𝑨
Simplify the given Boolean Expression below.
ഥ + 𝐀. 𝐁 + 𝐂
ഥ . 𝑩 + 𝐀. 𝐁. 𝑪
𝑸=𝑨
ഥ . 𝑩 + 𝑨. 𝑩 (𝑪
=𝑨 ഥ + 𝟏) + 𝑪
ഥ . 𝑩 + 𝑨. 𝑩 (𝟏) + 𝑪
=𝑨
ഥ . 𝑩 + 𝑨. 𝑩 + 𝑪
=𝑨
=𝑩 𝑨 ഥ+𝑨 +𝑪
=𝑩 𝟏 +𝑪
𝑸=𝑩+𝑪
Simplify the given Boolean Expression below.
ഥ. 𝑩 + 𝑨
𝑸=𝑨 ഥ+𝑨
ഥ . 𝑩. 𝑪 ഥ. 𝑩 ഥ + 𝐀. 𝑩
ഥ. 𝑪 ഥ
ഥ. 𝑪
ഥ. 𝑩 + 𝑨
=𝑨 ഥ+𝑩
ഥ . 𝑩. 𝑪 ഥ (𝑨
ഥ. 𝑪 ഥ + 𝐀)
ഥ. 𝑩 + 𝑨
=𝑨 ഥ+𝑩
ഥ . 𝑩. 𝑪 ഥ (𝟏)
ഥ. 𝑪
ഥ. 𝑩 + 𝑨
=𝑨 ഥ+𝑩
ഥ . 𝑩. 𝑪 ഥ
ഥ. 𝑪
ഥ . 𝑩 (𝟏 + 𝑪
=𝑨 ഥ) + 𝑩 ഥ
ഥ. 𝑪
ഥ . 𝑩 (𝟏) + 𝑩
=𝑨 ഥ
ഥ. 𝑪
ഥ. 𝑩 + 𝑩
𝑸=𝑨 ഥ
ഥ. 𝑪
Simplify the given Boolean Expression below.
𝑸 = 𝑩. 𝑪 𝑪ഥ + 𝐃 + 𝑪. 𝑫 + 𝑪 + 𝑨 ഥ
ഥ + 𝑩. 𝑪. 𝑫 + 𝑪. 𝑫 + 𝑪 + 𝑨
= 𝑩. 𝑪. 𝑪 ഥ
ഥ
= 𝑩 𝟎 + 𝑩. 𝑪. 𝑫 + 𝑪 𝑫 + 𝟏 + 𝑨
ഥ
= 𝑩. 𝑪. 𝑫 + 𝑪 𝟏 + 𝑨
ഥ
= 𝑩. 𝑪. 𝑫 + 𝑪 + 𝑨
ഥ
= 𝑪 (𝑩. 𝑫 + 𝟏) + 𝑨 ഥ
= 𝑪 (𝟏) + 𝑨
𝑸=𝑪+𝑨 ഥ
THANK
YOU

You might also like