Scribd
Upload
69 views9 pages

Boolean Expression

The document summarizes an experiment on Boolean expression simplification and implementation. It includes the objective, expressions to be simplified, their truth tables, K-maps, minimized forms, and Proteus circuits. The expressions are simplified to Y=BC+BA, F=AC+A'B, and F=A+B+C respectively. Outputs are verified using truth tables. Proteus circuits are created to match the minimized Boolean functions.

Uploaded by

ibrahim3wattoo
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
69 views9 pages

Boolean Expression

The document summarizes an experiment on Boolean expression simplification and implementation. It includes the objective, expressions to be simplified, their truth tables, K-maps, minimized forms, and Proteus circuits. The expressions are simplified to Y=BC+BA, F=AC+A'B, and F=A+B+C respectively. Outputs are verified using truth tables. Proteus circuits are created to match the minimized Boolean functions.

Uploaded by

ibrahim3wattoo
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 9

Digital Logic Designing

Lab 04

Name: Ibrahim Wattoo ID: 190349 BEEE IIIB

Submitted to: Sir Shujaat


AIR UNIVERSITY
DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING

EXPERIMENT NO 3

Lab Title: Boolean Expression Simplification and Implementation


Student Name: Ibrahim Wattoo Reg. No: 190349

Objective:

LAB ASSESSMENT:

Excellent Good Average Satisfactory Unsatisfactory


Attributes
(5) (4) (3) (2) (1)
Ability to Apply OOP
Concepts in
Programming
Ability to differentiate
between sequential
Programming and OOP
Effective use OOP
concepts

Total Marks: Obtained Marks:

LAB REPORT ASSESSMENT:


Excellent Good Average Satisfactory Unsatisfactory
Attributes
(5) (4) (3) (2) (1)

Code presentation

Task Completeness

Output

Total Marks: Obtained Marks:


Date: Signature:

Boolean Expression Simplification and Implementation

Expression:

Y = BC + BAD + BAD′

• Simplified form is
Y=BC+BA(D+D`)
Y=BC+BA

• Proteus Circuit
• Truth Table

Inputs Outputs
A B C D Y
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
0 0 1 1 0
0 1 0 0 0
0 1 0 1 0
0 1 1 0 1
0 1 1 1 1
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 0 1 1 0
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1
Step 2:
Function:

Y = ABC + AB′C + A′B

• Truth Table

Inputs Outputs

A B C Y

0 0 0 0

0 0 1 0

0 1 0 1

0 1 1 1

1 0 0 0

1 0 1 1

1 1 0 0

1 1 1 1

• Min Term

F= (2,3,5,7)
• K-MAP

BC B`C` B`C BC BC`


A

A` 11 11

11 11
A

Simplified Expression is
F=AC+A`B

• Proteus Circuit

F=AC+A`B
Step 3:
F = A’C + AB’ + B

• Truth Table
INPUTS OUTPUT

A B C F

0 0 0 0

0 0 1 1

0 1 0 1

0 1 1 1

1 0 0 1

1 0 1 1

1 1 0 1

1 1 1 1

• K-Map:
• Y = ∑ (2,3,5,7)

BC B`C` B`C BC BC`


A

A` 11 11

11 11
A
• Proteus Circuit

• Simplified Expression
F = A’C + AB + B
.: A’B + B =(B+B’) (A+B)
F = A’C + (B + B’) (A+B)
.: B + B’=1
F = A’C + (1) (A+B)
F =A’C+A+B
F = (A + A’) ( A + C) + B
F = (1) (A+ C) + B
F=A+B+C

You might also like