Scribd
Upload
3 views5 pages

Solution of Assignment 4 - Boolean Expressions

The document provides solutions to various assignments related to Boolean expressions and logic design. It includes tasks such as converting expressions to normal forms, expanding expressions into sum-of-products and product-of-sums forms, and implementing logic gates. Additionally, it covers expressing functions in minterm and maxterm shorthand forms, along with implementing multi-input gates using two-input gates.

Uploaded by

zaitery12
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
3 views5 pages

Solution of Assignment 4 - Boolean Expressions

The document provides solutions to various assignments related to Boolean expressions and logic design. It includes tasks such as converting expressions to normal forms, expanding expressions into sum-of-products and product-of-sums forms, and implementing logic gates. Additionally, it covers expressing functions in minterm and maxterm shorthand forms, along with implementing multi-input gates using two-input gates.

Uploaded by

zaitery12
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

Logic Design

Solution of Assignment #4 – Boolean Expressions

2.1 Convert the following expressions to normal form:

(a) 𝐹 (𝐴, 𝐵 ) = 𝐵 = (𝐴 + 𝐴) 𝐵
(b) 𝐹 (𝐴, 𝐵, 𝐶 ) = 𝐴 𝐵 + 𝐵 𝐶 = 𝐴 𝐵 (𝐶 + 𝐶) + (𝐴 + 𝐴) 𝐵 𝐶
(c) 𝐹 (𝐴, 𝐵, 𝐶 ) = 𝐴 + 𝐵 𝐶 = 𝐴(𝐵 + 𝐵)(𝐶 + 𝐶) + (𝐴 + 𝐴) 𝐵 𝐶
(d) 𝐹 (𝐴, 𝐵, 𝐶 ) = 𝐴 + 𝐶 = 𝐴(𝐵 + 𝐵)(𝐶 + 𝐶) + (𝐴 + 𝐴)(𝐵 + 𝐵) 𝐶
(e) 𝐹 (𝐴, 𝐵, 𝐶 ) = 𝐴𝐵𝐶 + 𝐴 + 𝐵𝐶 = 𝐴𝐵𝐶 + 𝐴(𝐵 + 𝐵)(𝐶 + 𝐶) + (𝐴 + 𝐴)𝐵 𝐶
(f) 𝐹 (𝐴, 𝐵, 𝐶 ) = 𝐴𝐵 + 𝐵𝐶 = 𝐴 𝐵 (𝐶 + 𝐶) + (𝐴 + 𝐴) 𝐵 𝐶
(g) 𝐹 (𝐴, 𝐵, 𝐶, 𝐷 ) = 𝐴𝐵 + 𝐴𝐶 = 𝐴𝐵(𝐶 + 𝐶)(𝐷 + 𝐷) + 𝐴(𝐵 + 𝐵)𝐶(𝐷 + 𝐷)
(h) 𝐹 (𝐴, 𝐵, 𝐶, 𝐷 ) = 𝐵 𝐷 + 𝐴 𝐶 = (𝐴 + 𝐴)𝐵 (𝐶 + 𝐶)𝐷 + 𝐴 (𝐵 + 𝐵)𝐶(𝐷 + 𝐷)

2.2 Expand the following expression into normal form and express as a sum-of-products (SOP).

2.2) 𝐹 = 𝑋 𝑌 𝑍 + 𝑋𝑌𝑍 + 𝑌 𝑍 = 𝑋 𝑌 𝑍 + 𝑋𝑌𝑍 + (𝑋 + 𝑋)𝑌 𝑍


= 𝑋 𝑌 𝑍 + 𝑋𝑌𝑍 + 𝑋 𝑌 𝑍 + 𝑋 𝑌 𝑍
𝐹 = Σm (0 , 2 , 6 , 7)

2.3 Represent the expression in Question 2.2 in product-of-sums form (POS).

2.3) POS: 𝐹 = 𝜋𝑚 (1 , 3 , 4 , 5)
𝐹 = 𝑋𝑌 𝑍 . 𝑋 𝑌 𝑍 . 𝑋 𝑌𝑍 . 𝑋 𝑌 𝑍
𝐹 = (𝑋 + 𝑌 + 𝑍) . (𝑋 + 𝑌 + 𝑍) . (𝑋 + 𝑌 + 𝑍) . (𝑋 + 𝑌 + 𝑍)

2.4 Implement the expression in Question 2.2 using AND and OR gates.

2.4)

Page 1 of 5
2.5 Implement the resulting POS equation from Question 2.3 using AND and OR
gates.

2.5)

2.6) Express the following equation in SOP form:

𝐹 (𝐴, 𝐵, 𝐶 ) = (𝐴 + 𝐵 + 𝐶 ) . (𝐴 + 𝐵 + 𝐶) . (𝐴 + 𝐵 + 𝐶)

2.6) = 𝜋𝑀 (0,2,5) = Σ𝑚 (1,3,4,6,7)

= 𝐴𝐵𝐶+ 𝐴𝐵𝐶+𝐴𝐵𝐶+ 𝐴𝐵𝐶+ 𝐴𝐵𝐶

2.7) Express the following in minterm shorthand form:

𝐹(𝐴, 𝐵, 𝐶, 𝐷) = 𝐴𝐵𝐷 + 𝐴 𝐵𝐶 + 𝐴𝐵 𝐷 + 𝐵 𝐶𝐷

= 𝐴𝐵(𝐶 + 𝐶) 𝐷 + 𝐴 𝐵𝐶 (𝐷 + 𝐷) + 𝐴𝐵(𝐶 + 𝐶)𝐷 + (𝐴 + 𝐴)𝐵 𝐶𝐷

=𝐴𝐵𝐶𝐷+𝐴𝐵𝐶𝐷 + 𝐴𝐵𝐶𝐷+𝐴𝐵𝐶𝐷 +𝐴𝐵𝐶𝐷+𝐴𝐵 𝐶𝐷 +𝐴𝐵𝐶𝐷+𝐴𝐵𝐶𝐷

=𝐴𝐵𝐶𝐷+𝐴𝐵𝐶𝐷 + 𝐴𝐵𝐶𝐷+𝐴𝐵𝐶𝐷 +𝐴𝐵𝐶𝐷+𝐴𝐵 𝐶𝐷 +𝐴𝐵𝐶𝐷

= Σ𝑚 (3 , 6 ,7 ,9 ,11 ,13 ,15)

2.8) Express the following in Maxterm shorthand form:

𝐹 (𝐴, 𝐵, 𝐶, 𝐷) = (𝐴 + 𝐵 + 𝐷). (𝐴 + 𝐵 + 𝐶). (𝐴 + 𝐵 + 𝐷). (𝐵 + 𝐶 + 𝐷)

(𝐴 + 𝐵 + 𝐷) ⇒ (𝐴 + 𝐵 + 𝐷 + 𝐶) , (𝐴 + 𝐵 + 𝐷 + 𝐶) ⇒ 𝑀15 , 𝑀13

(𝐴 + 𝐵 + 𝐶) ⇒ (𝐴 + 𝐵 + 𝐶 + 𝐷) , (𝐴 + 𝐵 + 𝐶 + 𝐷) ⇒ 𝑀2 , 𝑀3

(𝐴 + 𝐵 + 𝐷) ⇒ (𝐴 + 𝐵 + 𝐶 + 𝐷) , (𝐴 + 𝐵 + 𝐶 + 𝐷) ⇒ 𝑀8 , 𝑀10

(𝐵 + 𝐶 + 𝐷) ⇒ (𝐴 + 𝐵 + 𝐶 + 𝐷) , (𝐴 + 𝐵 + 𝐶 + 𝐷) ⇒ 𝑀3 , 𝑀11

Page 2 of 5
∴ 𝐹 (𝐴, 𝐵, 𝐶, 𝐷) = 𝜋𝑀 (2 , 3 , 8 , 10 , 11 , 13 , 15)

2.9) Produce for the following truth table:

A B C F
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 1

a) SOP: 𝐹 (𝐴, 𝐵, 𝐶 ) = 𝐴 𝐵 𝐶 + 𝐴 𝐵 𝐶 + 𝐴 𝐵 𝐶 + 𝐴 𝐵 𝐶
b) Minterm shorthand equation: 𝐹 = Σ𝑚 (1 , 2 , 4 , 7)
c) Logic diagram for SOP implementation.

2.10) Repeat Question 2.9 producing a POS implementation to include:


a) POS: 𝐹(𝐴, 𝐵, 𝐶 ) = (𝐴 + 𝐵 + 𝐶 ) . (𝐴 + 𝐵 + 𝐶) . (𝐴 + 𝐵 + 𝐶) . (𝐴 + 𝐵 + 𝐶)
Page 3 of 5
b) Maxterm shorthand equation: 𝐹 = 𝜋𝑀 (0 , 3 , 5 , 6)

c) Logic diagram for POS implementation.

2.11)

a) Implement three-input OR gate using two-input OR gate.

b) Implement four-input OR gate using two-input OR gate.

2.12)

a) Implement three-input AND gate using two-input AND gate.

b) Implement four-input AND gate using two-input AND gate.

2.13) Convert the following to the other normal form:


Page 4 of 5
a) 𝐹 (𝑥, 𝑦, 𝑧) = Σ𝑚 (1 , 3 , 7) ⇒ 𝐹 = 𝜋𝑀 (0, 2, 4, 5, 6)
b) 𝐹 (𝐴, 𝐵, 𝐶, 𝐷 ) = Σ𝑚 (0,2,6,11,13,14) ⇒ 𝐹 = 𝜋𝑀 (1,3,4,5,7,8,9,10,12,15)
c) 𝐹 (𝑥, 𝑦, 𝑧) = 𝜋𝑚 (0 , 3 , 6, 7) = Σ𝑚 (1 , 2 , 4 , 5 )
d) 𝐹 (𝐴, 𝐵, 𝐶, 𝐷) = 𝜋𝑚 (0 , 1, 2 , 3 , 4 , 6 , 12) = Σ𝑚 ( 5 , 7 , 8 , 9, 10 , 11 , 13 , 14 , 15)

2.16) Express the following functions in SOP and POS forms:


a) 𝐹 (𝐴, 𝐵, 𝐶, 𝐷 ) = 𝐷 (𝐴 + 𝐵) + 𝐵 𝐷 = 𝐴 𝐷 + 𝐵𝐷 + 𝐵 𝐷 = 𝐴 𝐷 + 𝐷 = 𝐷
∴ 𝑆𝑂𝑃: 𝐹 = 𝐷 = Σ𝑚 (1,3,5,7,9,11,13,15)
∴ 𝑃𝑂𝑆: 𝐹 = 𝜋𝑀 (0,2,4,6,8,10,12,14) = 𝐷 , 𝑤ℎ𝑒𝑟𝑒 𝑀 = 𝑚
b) 𝐹 (𝑥, 𝑦, 𝑧) = 𝑦 𝑧 + 𝑤 𝑥 𝑦 + 𝑤 𝑥 𝑧 + 𝑤 𝑥 𝑧
𝑁𝑜𝑡 𝑝𝑜𝑠𝑠𝑖𝑏𝑙𝑒, 𝑤 𝑖𝑠 𝑛𝑜𝑡 𝑎 𝑙𝑖𝑡𝑒𝑟𝑎𝑙 𝑜𝑓 𝐹 (𝑥, 𝑦, 𝑧).
c) 𝐹 (𝐴, 𝐵, 𝐶, 𝐷 ) = (𝐴 + 𝐵) (𝐵 + 𝐶) 𝑃𝑂𝑆: 𝐹 = 𝜋𝑀 (4,5,8,9,10,11,12,13)
∴ 𝑆𝑂𝑃: 𝐹 = Σ𝑚 (0,1,2,3,6,7,14,15) = 𝐴 𝐵 + 𝐵𝐶
d) 𝐹 (𝑥, 𝑦, 𝑧) = (𝑥 𝑦 + 𝑧) (𝑦 + 𝑥 𝑧) = 𝑥𝑦𝑦 + 𝑥𝑦𝑥𝑧 + 𝑧𝑦 + 𝑧𝑥𝑧
= 𝑥𝑦 + 𝑥𝑦𝑧 + 𝑦𝑧 + 𝑥𝑧 = 𝑥𝑦 + 𝑦𝑧 + 𝑥𝑧 𝑆𝑂𝑃
∴ 𝑆𝑂𝑃: 𝐹 = Σ𝑚 (3,5,6,7)
∴ 𝑃𝑂𝑆: 𝐹 = 𝜋𝑀 (0,1,2,4) = (𝑦 + 𝑧)(𝑥 + 𝑦)(𝑥 + 𝑧)

Page 5 of 5

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy