lecture6-post - Y = NOT(A AND(B OR C A A B B C C Y 1 1 1 1...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
1 1 Post-Lecture 6 Notes • I will write a more explicit version of the algorithm used to solve the daily quiz – Study that for use in HW #3 – Will have TAs cover in discussion • Last pre-lecture slide covered was 35 – will begin there next time – less review than I’ve sometimes done 2 Truth Tables to Boolean Expression • Each row of table has matching AND term that would yield 1 • OR all these terms for the rows of table where result is 1 • “Sum of products” expression • Y = A ' B + A B ' A B A B ' A ' B A ' B ' term 0 1 1 1 0 0 A 1 1 1 0 0 0 Y B Inserted between pre- 3 Boolean algebra example • Sum of products expression may not be simplest possible, use Boolean algebra (or Karnaugh-maps) to reduce • Y = ABC + AB'C + AB'C' = A(BC + B'C + B'C' ) = A(C(B + B' ) + B'C' ) = A(C•1 + B'C' ) = A(C + B'C' ) = AC + AB'C' Inserted between pre- 4 More than 2 inputs, Single CMOS
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Y = NOT (A AND (B OR C)) A A B B C C Y 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 A • (B + C) 1 1 1 B + C 1 A 1 1 1 1 1 B 1 1 Y C Inserted between pre-lecture slides 7 & 8 5 Daily Quiz • Design a combination of gates to implement the following truth table. – How many AND gates are needed? – How many OR gates? 1 1 1 1 1 1 1 1 1 1 & 1 1 ± 1 1 1 1 ² 1 ³ ´ This truth table is completely arbitrary – does not necessarily represent any particular operation! Was pre-lecture slide 33 (not shown) 6 Daily Quiz: Answer 7 6 5 4 3 2 1 µ¶· 1 1 1 1 1 1 1 1 1 1 & 1 1 ± 1 1 1 1 ² 1 ³ ´ 1 2 6 4 ² ± ´ & ³ Was pre-lecture slide 34 (not shown)...
View Full Document

This note was uploaded on 09/06/2009 for the course BME 303 taught by Professor Ren during the Spring '08 term at University of Texas.

Ask a homework question - tutors are online