{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

lec11 - ENGR 111 Lecture 11 Reading Chapters 22 Class notes...

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

View Full Document Right Arrow Icon
ENGR 111 Lecture 11 Reading: Chapters 22 Class notes
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
Review of last lecture z Binary representation, binary addition z Gates - Inverter, AND, OR, NAND, NOR, XOR, XNOR z Logic implementation of 1-bit half adder
Background image of page 2
General Technique for Logic F = ABC + ABC +ABC+ ABC
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
General Technique for Logic …
Background image of page 4
Binary Addition Truth Table A i B i C in C out S i 00000 00101 01001 01110 10001 10110 11010 11111
Background image of page 5

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

View Full Document Right Arrow Icon
Logic for Full Binary Addition + ++ ii i in n i i in i i n out i in i in in iii n S=ABC ABC C= A B C + A B +AB C + ABC C
Background image of page 6
Logic Rules – AND () AA = A A0 = 0 A1 = A = 0 AB = BA C A BC + C = A B + A C ⋅⋅ ⋅=⋅
Background image of page 7

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

View Full Document Right Arrow Icon
Logic Rules – OR () ( ) = A+0=A A+1=1 A+A=A A+B=B+A A+A=1 A+ B+C A+B +C A+BC= A+B A+C ( ) =A+BA+AC+BC=A 1+B +AC+BC =A+AC+BC=A 1+C +BC=A+BC
Background image of page 8
Logic Rules z The logic rules allow simplification of logic or logic minimization { Reduces the number of inputs, gates needed to generate the same output
Background image of page 9

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

View Full Document Right Arrow Icon
DeMorgan’s Laws z Relate AND and OR implementations { AND can be converted into NOR of inverted inputs { OR can be converted into NAND of inverted inputs A B=A+B A+B=A B
Background image of page 10
Image of page 11
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 16

lec11 - ENGR 111 Lecture 11 Reading Chapters 22 Class notes...

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

View Full Document Right Arrow Icon bookmark
Ask a homework question - tutors are online