Scribd
Upload
7 views11 pages

Experiment No: 02: Name of The Experiment

The document outlines an experiment focused on simplifying Boolean functions and converting between Gray code and binary code. It includes problem statements, required ICs, simplifications using Boolean algebra, truth tables, and circuit diagrams for each problem. The experiment aims to demonstrate the implementation of logic gates and the conversion process between binary and Gray codes.

Uploaded by

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

Experiment No: 02: Name of The Experiment

The document outlines an experiment focused on simplifying Boolean functions and converting between Gray code and binary code. It includes problem statements, required ICs, simplifications using Boolean algebra, truth tables, and circuit diagrams for each problem. The experiment aims to demonstrate the implementation of logic gates and the conversion process between binary and Gray codes.

Uploaded by

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

Experiment No: 02

Name of the Experiment : Simplification of Boolean function and conversion


between gray code to binary and vice versa and their Implementation.

Course Number : CSE 2102

Course Title : Digital Logic Design Laboratory

Submitted By :

Name : Md. Omar Faruk

Roll : 222014015

Submitted to : Maneesha Rani Saha


Experiment Name : Simplification of boolean expressions and implementation
with logic gates and implementation of gray code to binary (and vice versa).

Problem Statement – 1 : (𝐴 + 𝐵) C + (𝐵 + 𝐶 ) + A𝐶

Required ICs:
● Hex inverter — 1 piece
● Quad 2 input And gate — 1 piece
● Quad 2 input OR gate — 1 piece

Simplification of Function using Boolean Algebra :

(𝐴 + 𝐵) C + (𝐵 + 𝐶 ) + A𝐶
= (𝐴 . 𝐵).C+(𝐵 .C) + A𝐶)
=𝐴 𝐵 C + 𝐵C + A𝐶
=(𝐴+1) 𝐵 C + A𝐶
=𝐵C+A𝐶

Truth Table of Simplified Boolean Function :


A B C 𝐵 𝐶 𝐵C A𝐶 𝐵C +A𝐶
0 0 0 1 1 0 0 0

0 0 1 1 0 1 0 1

0 1 0 0 1 0 0 0

0 1 1 0 0 0 0 0

1 0 0 1 1 0 1 1

1 0 1 1 0 1 0 1

1 1 0 0 1 0 1 1

1 1 1 0 0 0 0 0

Circuit Diagram :

Discussion : Led turns on for four input combinations of A,B,C

Problem Statement – 2 : ABC′D + A′BCD′ + ABC + AB′C′D′ + ABD′ + ABC′


Required ICs:
● Hex inverter — 1 piece
● Quad 2 input And gate — 1 piece
● Quad 2 input OR gate — 1 piece

Simplification of Function using Boolean Algebra :

ABC′D + A′BCD′ + ABC + AB′C′D′ + ABD′ + ABC′


=ABC’ + A’BCD’ + ABC + AB’C’D’ + ABD’
=AB+ A’BCD’ +AB’C’D’ +ABD’
=AB+A’BCD’ +AB’C’D’
Truth Table of Simplified Boolean Function :
Circuit Diagram :

Discussion : Led turns on only for six input combinations

Problem Statement – 3 : Derive the output equations for a 3-bit binary to gray
code converter and implement it.

Required ICs :
● 7486 quad 2 - input XOR gate
Procedure :

● For both the binary code and for gray code the most

significant bit (MSB) is the same . That means

G2 = B2
● To find G1 we need to XOR B1 and B2. That means ,

G1 = B2 ⊻ ( XOR) B1

● To find Go ( Gnot) we need XOR B1 and Bo (Bnot). That means ,

G0 = B1 ⊻ (XOR) B0

Truth Table Binary Code to Gray Code :

Decimal digit Binary code Gray code

0 0 0 0 0 0 0

1 0 0 1 0 0 1

2 0 1 0 0 1 1

3 0 1 1 0 1 0

4 1 0 0 1 1 0

5 1 0 1 1 1 1

6 1 1 0 1 0 1

7 1 1 1 1 0 0
Circuit Diagram :

Discussion :
Binary code to gray code conversion reduces data errors by simplifying transitions
between values.
Problem statement — 4 : Derive the output equations for a 3-bit gray code to the
binary converter and implement it.

Required ICs :
❖ 7486 quad 2 - input XOR gate

Procedure :

1. For both the binary code and for gray code the most

significant bit (MSB) is the same . That means

B2 = G2

2. For B1 we need to XOR G1 with B2. That means,

B1 = G1 ⊻ ( XOR) B2

3. For Bo ( Bnot) we need to XOR Go (Gnot) with B1. that

means , Bo = Go ⊻(𝑋𝑂𝑅) 𝐵1
Truth Table Gray Code to Binary :

Decim Gray Code Binary Code


al digit

0 0 00 0 0 0

1 0 0 1 0 0 1

2 0 1 1 0 1 0

3 0 1 0 0 1 1

4 1 1 0 1 0 0

5 1 1 1 1 0 1

6 1 0 1 1 1 0

7 1 0 0 1 1 1

Circuit Diagram :
Discussion : As we know that gray code is convenient for so many reasons but we
need to know the transition from gray to binary code .This conversion algorithm helps
us to do that job.

You might also like