Simplification of Boolean Functions

# Simplification of Boolean Functions - Simplification of...

This preview shows pages 1–3. Sign up to view the full content.

Simplification of Boolean Functions Experiment 3 Objective To demonstrate the relationship between Boolean functions and the corresponding logic diagram. Procedure Logic Diagram For this part of the experiment we are given a logic diagram that we must simplify and reduce the number of gates, and possibly the number of ICs. The logic diagram (Figure 3.1) is shown below and requires two ICs – a 7400 and a 7410. Pin numbers were assigned to all inputs and outputs of the gates. We then connected the circuits with the x, y, and z inputs going to three switches and the output F to an indicator lamp. We tested the circuit to obtain the truth table below (Table 3.1). Figure 3.1

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Table 3.1 x y z F 1 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 0 1 1 1 1 Once we had the truth table we were able to create a map to simplify the function F 1 to get F 2 . The map is shown below (Map 3.1) Map 3.1 x yz 00 01 11 10 0 0 0 1 0 1 1 1 1 0 Using this map we determined that F 2 = xy` + yz. Using DeMorgan’s Theorem we converted this function to
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 06/06/2008 for the course ECE 282 taught by Professor Lozwoski during the Spring '08 term at Southern Illinois University Edwardsville.

### Page1 / 6

Simplification of Boolean Functions - Simplification of...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online