lecture15 - CMPT 150 Subtraction Page 1 CMPT 150...

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

View Full Document Right Arrow Icon
CMPT 150 Subtraction Page 1 n-bit Binary Ripple Carry Adder Module A n B n b To add multiple operands, we bundle logical signals together into vectors and use functional blocks that operate on the vectors n-bit adder S n C in C out CMPT 150 Subtraction Page 2 Iterative Combinational Circuits b Notice that our adder circuit uses the same subfunction on each pair of bits in a particular bit position b In general, iterative combinational circuits take advantage of the regularity of each position to make design feasible b Can design functional block for subfunction and repeat to obtain functional block for overall function Cell 0 A 0 B 0 C 0 X 0 Y 0 X 1 Y 1 Cell 1 A 1 B 1 C 1 X 2 Y 2 Cell n-1 A n-1 B n-1 C n-1 X n-1 Y n-1 X n Y n . . . CMPT 150 Subtraction Page 3 Representing Signed Integers b The simplest way to represent signed integers is to use signed magnitude representation : b Reserve high-order bit for sign b Use other bits to represent the magnitude (i.e. absolute alue) of the number value) of the number
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/27/2011 for the course CMPT 150 taught by Professor Dr.anthonydixon during the Spring '08 term at Simon Fraser.

Page1 / 3

lecture15 - CMPT 150 Subtraction Page 1 CMPT 150...

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

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