Scribd
Upload
6 views

Logic

Uploaded by

ayanoammar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
6 views

Logic

Uploaded by

ayanoammar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

UNIVERSITY OF ADEN

FACULTY OF ENGINEERING
DEPT. OF INFORMATION TECHNOLOGY

• Use Karnaugh maps (K-maps) to simplify the following Boolean function, then
draw the equivalent logic circuit :
𝒇(A, B, C, D) = Σ)14 ,13 ,12 ,11 ,9 ,7 ,6 ,5 ,4 ,1(
Solution

AB
ĀB̄ ĀB AB AB̄
CD
0 1 3 2
C̄D̄ 1
4 5 7 6
C̄D 1 1 1 1
12 13 15 14
CD 1 1 1
8 9 11 10
CD̄ 1 1

SIMPLIFIED EQUATION
F = C̄D + BD̄ + ĀB + AB̄D
LOGIC CIRCUIT DIAGRAM

C̄D

BD̄

ĀB

AB̄D
• Design a combinational logic circuit of 3 inputs where the output is 0 when:

1. All inputs are 0.


2. All inputs are 1.
3. The algebraic sum of the inputs equals 2.

Show the Boolean equation and simplify it if possible.

Solution

A B C Output (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 0

Using SOP Form:


Minterms:

Each minterm corresponds to a row in the truth table where F = 1. The minterms are expressed as:

• m1= ĀB̄C
• m2= ĀBC̄
• m4= ABC̄

BOOLEAN EQUATION
F = ĀB̄C + ĀBC̄ + ABC̄
LOGIC CIRCUIT DIAGRAM

COMPOSITIONAL
CIRCUIT

You might also like