Lecture12 - 1/8 ENSC150 Lecture 12 Agenda Adders(review...

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

View Full Document Right Arrow Icon
ENSC150 Lecture 12 Agenda Adders (review) Subtractors 1/8 Lecture 12 Atousa Hajshirmohammadi, SFU
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
Adders Half Adder: Generates the sum of 2 binary bits X and Y to C out and S . We have seen this before and know that the result is: S = ¯ XY + X ¯ Y = X L Y , C out = XY Full Adder: We saw this adder in Lecture 11 and implemented it using MUX. Binary Ripple Carry Adder: Generated the sum of two n-bit binary numbers. It can be implemented by a concatenation of full adders: Carry look ahead Adder: Same as binary Ripple Carry, but more complex implementation and less delay. See Text pp. 153-155 . 2/8 Lecture 12 Atousa Hajshirmohammadi, SFU
Background image of page 2
Subtraction M - N = R If M N , then R 0 . Example: What if M < N ? Example: 3/8 Lecture 12 Atousa Hajshirmohammadi, SFU
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 Rule for M - N Subtract N from M. If no end borrow occurs M N Result is non-negative and correct. If end borrow occurs
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 8

Lecture12 - 1/8 ENSC150 Lecture 12 Agenda Adders(review...

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

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