Erik Jonsson School of Engineering and Computer Science

Erik Jonsson School of Engineering and Computer Science EE/CE 2310 – HON/002 Introduction to Digital Systems http: //www. utdallas. edu/~pervin Tuesday: Review Chapters T 1 -T 5, P 1 P 4 Thursday 2 -16 -12 FEARLESS Engineering www. utdallas. edu/~pervin

Decoders & Multiplexers – Dodge Lecture 6 http: //www. utdallas. edu/~dodge/EE 2310/lec 6. pdf Go over this carefully!! For Lab Assignment #1, see the next slide.

Design Problem • You have now seen how to go from a requirement to a truth table to a Boolean Expression to a circuit (and even how to simplify the circuit). • You now get to do a design. Do a first try by yourself. Then you may review and complete your design with your EE 2110 lab partner. • Here is the requirement (“spec”): A circuit has three input variables, x, y, and z. Its output is 1 for the conditions x, y, z = 0, x, y = 0; z = 1, and x = 0; y, z = 1. Do the following: – Make a truth table from the requirements. – Devise an SOP Boolean expression from the truth table. Simplify it using the relationships discussed today, but keep in SOP form. (Do not use a Karnaugh map!) – In EE 2110 Lab. 1, build your design (see Lab. 1 instructions). – Using all combinations of the input variables, demonstrate with your partner to the lab TA that your real circuit obeys your truth table. Lecture #4: Boolean Algebra and Combinational Digital Logic © N. B. Dodge 01/12

Karnaugh Map Simplify the Boolean expression: _ __ __ _ _ _ A. B. C. D + A. B. C. D = Y A B 0 0 0 1 1 0

Karnaugh Map Simplify the Boolean expression: _ __ __ _ _ _ A. B. C. D + A. B. C. D = Y 0 0 1 1 A B 0 0 0 1 1 1 1 0

Karnaugh Map Simplify the Boolean expression: _ __ __ _ _ _ A. B. C. D + A. B. C. D = Y 0 0 1 1 A B 0 0 0 1 1 1 1 0 _ _ Y = B. C + A. B. C

Multiplexer

Pin Diagrams

We went over Dr. Dodge’s Review for his first test.