Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

EXPERIMENT: SIMPLE DIGITAL DESIGN AND TTL Chips. References Introduction to Digi

ID: 3889551 • Letter: E

Question

EXPERIMENT: SIMPLE DIGITAL DESIGN AND TTL Chips. References Introduction to Digital Design Using Digilent FPGA Boards: Appendix C - Basic Logic Gates. PRE-LAB You will be using transistor-to-transistor logic (TTL) chips in this lab and in Lab 2. To become Appendix D- Boolean Algebra familiar with the chips, you will be wiring and testing simple digital circuits. 1. Truth Tables and Boolean equations. Using NOT and OR (1), write the Boolean equation and truth table for the NAND function. a. Table 1: NAND Truth Table NAND Boolean Equation: b. Using NOT ), AND (&), and OR (D. write the Boolean equation and truth table for the XNOR function. Table 2: XNOR Truth Table XNOR Boolean Equation:1 c. Using NOT), AND (&), and OR (D, write the non-simplified sum-of-products Boolean equation for the truth table given in Table 3 below Table 3: Advanced Circuit 0 Adygncod Cireuit Boolean Equatioe

Explanation / Answer

Question 1a.

NAND Function: (X.Y)’

Now, if we apply de Morgan’s theorem,

(X.Y)’ = X’ + Y’

Question 1b.

From the XNOR truth table, we can deduce that,

B = X’.Y’ + X.Y

Hire Me For All Your Tutoring Needs
Integrity-first tutoring: clear explanations, guidance, and feedback.
Drop an Email at
drjack9650@gmail.com
Chat Now And Get Quote