Experiment No.: 1 Lab Group No.

: 2
Student No.: 0906071



Course Number: EEE 304

Name of the Experiment:
INTRODUCTION TO BASIC GATES AND LOGIC SIMPLIFICATION TECHNIQUES


Date of Performance: 25/2/2013
Date of Submission: 10/3/2013


Name: Md. Ehsanul Haque Nirjhar
Department: EEE
Section: B
Partners Student No.: 0906072
0906073
0906074
0906075
Experiment 1: Implement the following logic function with basic gates
(, , ) =

+
Write down the truth table and compare it with your experimental results.

Truth Table:

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


Circuit Diagram:


Experiment 2(a): For the following logic function, find out the truth table, write down the
logic expression and simplify the logic expression as far as possible using Boolean algebra.
F(A,B,C,D)=(5,7,10,11,13,14,15)
Simplify the problem as shown in Part B using K map and draw and construct the circuit
diagram. Which method provides better simplification?
Truth Table:
A B C D F
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 1
0 1 1 0 0
0 1 1 1 1
1 0 0 0 0
1 0 0 1 0
1 0 1 0 1
1 0 1 1 1
1 1 0 0 0
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1

Simplification by Boolean Algebra:
F(A,B,C,D)= (5,7,10,11,13,14,15)
=

+
=

+ +

+
=

+ ) +

+ ) + (

+) + (

+ )
=

+ +
=(

+) + (

+ )
= +
Simplification using K-map:











Therefore, F(A,B,C,D)= + .
Both processes give the same simplified value but K-map minimization is easier to understand
and visualize.
Circuit Diagram:



CD
AB

00

01

11

10

00

0

0

0

0

01

0

1

1

0

11

0

1

1

1

10

0

0

1

1
Experiment 2(b): Simplify the following problem using K map. Draw and construct the circuit
diagram
F(A,B,C,D)=(5,6,7,9,13)
Is there only one solution or more?
Simplification by Boolean Algebra:
F(A,B,C,D)=(5,6,7,9,13)=

( + ) +

Simplification using K-map:











From K-map, it is determined that F(A,B,C,D)=

( + ) +

.There is
another solution from the K-map. If the dotted sub-cube is taken instead of the blue one, we
get F(A,B,C,D)=

=( + )

. These 2 circuits will give the same

output, so they are functionally equivalent network.

CD
AB

00

01

11

10

00

0

0

0

0

01

0

1

1

1

11

0

1

0

0

10

0

1

0

0
Circuit Diagram:



Additional Question 1: It is possible to implement all the basic logic gates using only NAND
gate. That is why it is called universal gate. With necessary circuit diagram, show how AND, OR,
NOT and XOR gates can be implemented using NAND gates only.

NOT using NAND:

() =

= (, )


AND using NAND:

(, ) = (, ) = =

= ((, ))




OR using NAND:

(, ) = + =

= (

)











XOR using NAND:

(, ) = = +
= + + +
= ( + ) + ( + )
= ( + )( + )
= ( + )
= . +.










Additional Question 2: Simplify (circuit diagram not required) the following problem using
K map (note that it is a 5 variable problem)

F(A,B,C,D,E)=(1,4,5,13,20,21,22,28) + d(6,9,11,12,14,29,30)
where d stands for dont care .
Simplification using K-map:



A
DE

BC

00

01

11

10

0

00

0

1

0

0

0

01

1

1

0

1(d)

0

11

1(d)

1

0

1(d)

0

10

0

1(d)

d

0




A
DE

BC

00

01

11

10

1

00

0

0

0

0

1

01

1

1

0

1

1

11

1

1(d)

0

1(d)

1

10

0

0

0

0
=

Therefore, (, , , , ) =

.

Circuit Diagram: