{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

CSE120 Simulation Lab 2

CSE120 Simulation Lab 2 - Introduction In this lab the...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Introduction In this lab, the expected learning objective of this lab is to gain experience using LogicWorks to build and debug circuits and subcircuits that perform mathematical operations and route data. After the completion of the lab, I will be able to design, build, test, debug, and embed the following type of circuits: 1 and 4 bit adders, 2-to-1 multiplexer, a 4-bit, 2-to-1 multiplexer, and a 1-to-2, 2-to-4, and 4-to-16 decoder. Experiment Results Task 2-1: Design a Full Adder Using AND/OR/NOT Logic Task 2-1: Task Statement In the task, I was asked to design both the canonical POS and SOP form for both the SUM and Cout functions of a full adder only using AND, OR, and NOT gates. Task 2-1: Work Preformed For this task, I used the truth table for the full adder given in the lab manual to derive the SUM and Cout functions of the full adder in both the POS and SOP forms. Below in Table 1 is the truth table for the full adder. Ci n A B SUM Cout 0 0 0 0 0 0 0 1 1 0 0 1 0 1 0 0 1 1 0 1 1 0 0 1 0 1 0 1 0 1 1 1 0 0 1 1 1 1 1 1 Table - Truth Table for Full Adder After examining the truth table, the following Boolean expression were derived. For the POS form, the SUM = (CinAB)(CinA’B’)(CinAB’)(CinA’B) and the Cout = (CinA)(CinB)(AB). For the SOP form, the SUM = Cin’A’B+Cin’AB’+CinA’B’+CinAB, and the Cout = ACin+BCin+AB. In determining which form to use, I don’t think it really matters as both would require the same number of gates. Task 2-1: What I Learned In this task, I learned how to use a truth table to derive the Boolean expressions necessary to build a full adder. I also was able to learn how to determine whether I should use the POS or SOP form to do so.
Background image of page 1

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

View Full Document Right Arrow Icon
A B Cin SUM CRY Task 2-2: Build, Debug, and Test a 1-Bit Full Adder Task 2-2: Task Statement In the task, I was to build a 1-bit adder using only AND, OR, and NOT gates using the SOP form for the Cout function and then a 3-input XOR gate for the SUM function. Then I was to embed this circuit in a subcircuit and test the circuit for later use. Task 2-2: Work Preformed For this task, I used the SOP form from Task 1 for the Cout and a 3-input XOR gate for the SUM function. I did this using the setup in Figure 1 below. Figure - Circuit Diagram of Full Adder I then tested the outputs of this circuit and produced the following truth table found in Table 2. Ci n A B SUM Cout 0 0 0 0 0 0 0 1 1 0 0 1 0 1 0 0 1 1 0 1 1 0 0 1 0 1 0 1 0 1 1 1 0 0 1 1 1 1 1 1 Table - Truth Table for Full Adder
Background image of page 2
Cin B A CRY SUM FA_1 Finally, I embedded this circuit in a subcircuit for later use. Below in Figure 2 is this subcircuit.
Background image of page 3

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

View Full Document Right Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}