Chapter 4 Operations on Bits. Apply arithmetic operations on bits when the integer is represented in two’s complement. Apply logical operations on bits.

Slides:



Advertisements
Similar presentations
©Brooks/Cole, 2003 Chapter 4 Operations on Bits. ©Brooks/Cole, 2003 Apply arithmetic operations on bits when the integer is represented in two’s complement.
Advertisements

COE 202: Digital Logic Design Signed Numbers
Princess Sumaya Univ. Computer Engineering Dept. Chapter 3:
Princess Sumaya Univ. Computer Engineering Dept. Chapter 3: IT Students.
©Brooks/Cole, 2003 Chapter 3 Number Representation.
電腦的基本單位 類比訊號 (analog signal) 指的是連續的訊號
Major Numeric Data Types Unsigned Integers Signed Integer Alphanumeric Data – ASCII & UNICODE Floating Point Numbers.
Assembly Language and Computer Architecture Using C++ and Java
Chapter 4 Operations on Bits
Signed Numbers.
Assembly Language and Computer Architecture Using C++ and Java
Computer ArchitectureFall 2008 © August 25, CS 447 – Computer Architecture Lecture 3 Computer Arithmetic (1)
1 Binary Arithmetic, Subtraction The rules for binary arithmetic are: = 0, carry = = 1, carry = = 1, carry = = 0, carry =
計算機概論 第6章 數位邏輯設計.
電腦的基本單位 類比訊號 (analog signal) 指的是連續的訊號 數位訊號 (digital signal) 指的是以預先定義的符號表示不連續 的訊號 one bit 8 bits=one byte 電腦裡的所有資料,包括文 字、數據、影像、音訊、視 訊,都是用二進位來表示的。
電腦的基本單位 類比訊號 (analog signal) 指的是連續的訊號
DIGITAL SYSTEMS TCE1111 Representation and Arithmetic Operations with Signed Numbers Week 6 and 7 (Lecture 1 of 2)
Chapter 3 Number Representation
Signed Numbers CS208. Signed Numbers Until now we've been concentrating on unsigned numbers. In real life we also need to be able represent signed numbers.
Number Representation Rizwan Rehman, CCS, DU. Convert a number from decimal to binary notation and vice versa. Understand the different representations.
Operations on data CHAPTER 4.
4 Operations On Data Foundations of Computer Science ã Cengage Learning.
Chapter 3 Data Representation part2 Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2010.
Dr. Bernard Chen Ph.D. University of Central Arkansas
Chapter3 Fixed Point Representation Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.
The Binary Number System
©2010 Cengage Learning SLIDES FOR CHAPTER 1 INTRODUCTION NUMBER SYSTEMS AND CONVERSION Click the mouse to move to the next page. Use the ESC key to exit.
Chapter 3 Number Representation. Convert a number from decimal 、 hexadecimal,octal to binary notation and vice versa. Understand the different representations.
Binary Real Numbers. Introduction Computers must be able to represent real numbers (numbers w/ fractions) Two different ways:  Fixed-point  Floating-point.
MICRO OPERATIONS Department of Computer Engineering, M.S.P.V.L. Polytechnic College, Pavoorchatram.
Chapter 2 Data and Number Representations
NUMBER REPRESENTATION CHAPTER 3 – part 3. ONE’S COMPLEMENT REPRESENTATION CHAPTER 3 – part 3.
Chapter 1 Data Storage(3) Yonsei University 1 st Semester, 2015 Sanghyun Park.
Foundations of Computer Science Chapter 4 Operations on Bits.
Computer Arithmetic and the Arithmetic Unit Lesson 2 - Ioan Despi.
©Brooks/Cole, 2003 Chapter 3 Number Representation.
Chapter 3 Number Representation. Convert a number from decimal to binary notation and vice versa. Understand the different representations of an integer.
Number Representation
Operations on Bits Arithmetic Operations Logic Operations
©Brooks/Cole, 2003 Chapter 4 Operations on Bits. ©Brooks/Cole, 2003 Apply arithmetic operations on bits when the integer is represented in two’s complement.
©Brooks/Cole, 2003 Chapter 3 Number Representation.
1 Representation of Data within the Computer Oct., 1999(Revised 2001 Oct)
Number Systems Revision of conversations What is a register Addition Complementation.
Data Representation in Computer Systems. 2 Signed Integer Representation The conversions we have so far presented have involved only positive numbers.
07/12/ Data Representation Two’s Complement & Binary Arithmetic.
Bits, Data types, and Operations: Chapter 2 COMP 2610 Dr. James Money COMP
Arithmetic Operations
Chapter 4 Operations on Bits. Apply arithmetic operations on bits when the integer is represented in two’s complement. Apply logical operations on bits.
©Brooks/Cole, 2003 Chapter 3 Number Representation.
1 Ethics of Computing MONT 113G, Spring 2012 Session 4 Binary Addition.
Chapter 4 Operations on Bits. Apply arithmetic operations on bits when the integer is represented in two’s complement. Apply logical operations on bits.
09/03/20161 Information Representation Two’s Complement & Binary Arithmetic.
Computer Organization 1 Data Representation Negative Integers.
Lecture No. 4 Computer Logic Design. Negative Number Representation 3 Options –Sign-magnitude –One’s Complement –Two’s Complement  used in computers.
{ Binary “There are 10 types of people in the world: Those who understand binary, and those who don't.”
1 Integer Representations V1.0 (22/10/2005). 2 Integer Representations  Unsigned integer  Signed integer  Sign and magnitude  Complements  One’s.
David Kauchak CS 52 – Spring 2017
Chapter 4 Operations on Bits.
A Level Computing Component 2
Chapter 14 Bitwise Operators Objectives
Teaching Computing to GCSE
Number Representation
Overview Fractions & Sign Extension Floating Point Representations
Chapter3 Fixed Point Representation
Chapter 1 (Part c) Digital Systems and Binary Numbers
OBJECTIVES After reading this chapter, the reader should be able to :
靜夜思 床前明月光, 疑是地上霜。 舉頭望明月, 低頭思故鄉。 ~ 李白 李商隱.
Two’s Complement & Binary Arithmetic
Presentation transcript:

Chapter 4 Operations on Bits

Apply arithmetic operations on bits when the integer is represented in two’s complement. Apply logical operations on bits. Understand the applications of logical operations using masks. After reading this chapter, the reader should be able to: O BJECTIVES Understand the shift operations on numbers and how a number can be multiplied or divided by powers of two using shift operations.

Figure 4-1 Operations on bits

ARITHMETICOPERATIONSARITHMETICOPERATIONS 4.1

Table 4.1 Adding bits Number of 1s Number of 1s None One Two Three Result Result Carry Carry

Rule of Adding Integers in Two’s Complement Add 2 bits and propagate the carry to the next column. If there is a final carry after the leftmost column addition, discard it. Note:

簡要解釋為何 two’s complement 可以 這樣做運算 假設是 n bits 正數 + 正數 ( 和一般情況一樣 ) 負數 (-x) + 負數 (-y) -x 在 two’s complement 表示值為 2 n -x -y 在 two’s complement 表示值為 2 n -y 2 n - x + 2 n - y = 2 n + (2 n - (x+y)) Carry ( 進位 ) -(x+y) 的 two’s complement 表示法

簡要解釋為何 two’s complement 可以 這樣做運算 ( 續前頁 ) 正數 (x) + 負數 (-y) -y 在 two’s complement 表示值為 2 n -y 得 2 n +x-y (1) x >= y x-y 為正值 ; 2 n 為進位 (2) x <y 2 n +x-y = 2 n -(y-x)

Example 1 Add two numbers in two’s complement representation: (+17) + (+22)  (+39) Solution Carry Result  39

Example 2 Add two numbers in two’s complement representation: (+24) + (-17)  (+7) Solution Carry Result  +7

Example 3 Add two numbers in two’s complement representation: (-35) + (+20)  (-15) Solution Carry Result  -15

Example 4 Add two numbers in two’s complement representation: (+127) + (+3)  (+130) Solution Carry (Error) An overflow has occurred Result  -126 (Error) An overflow has occurred.

Range of numbers in two’s complement representation - (2 N-1 ) (2 N-1 –1) Note:

Figure 4-2 Two’s complement numbers visualization

When you do arithmetic operations on numbers in a computer, remember that each number and the result should be in the range defined by the bit allocation. Note:

Example 5 Subtract 62 from 101 in two’s complement: (+101) - (+62)  (+101) + (-62) Solution Carry Result  39 The leftmost carry is discarded.

Example 6 Add two floats: Solution The exponents are 5 and 3. The numbers are: +2 5 x and +2 3 x Make the exponents the same. (+2 5 x )+ (+2 5 x )  +2 5 x After normalization +2 6 x , which is stored as:

LOGICALOPERATIONSLOGICALOPERATIONS 4.2

Figure 4-3 Unary and binary operations

Figure 4-4 Logical operations

Figure 4-5 Truth tables

Figure 4-6 NOT operator

Example 7 Use the NOT operator on the bit pattern Solution Target NOT Result

Figure 4-7 AND operator

Example 8 Use the AND operator on bit patterns and Solution Target AND Result

Figure 4-8 Inherent rule of the AND operator

Figure 4-9 OR operator

Example 9 Use the OR operator on bit patterns and Solution Target OR Result

Figure 4-10 Inherent rule of the OR operator

Figure 4-11 XOR operator

Example 10 Use the XOR operator on bit patterns and Solution Target XOR Result

Figure 4-12 Inherent rule of the XOR operator

More about XOR 一連串的 bits 做 XOR, 若奇數個 1, 則結果為 1; 若偶數個 1 則結果為 XOR

Figure 4-13 Mask

Figure 4-14 Example of unsetting specific bits

Example 11 Use a mask to unset (clear) the 5 leftmost bits of a pattern. Test the mask with the pattern Solution The mask is Target AND Mask Result

Example 12 Imagine a power plant that pumps water to a city using eight pumps. The state of the pumps (on or off) can be represented by an 8-bit pattern. For example, the pattern shows that pumps 1 to 3 (from the right), 7 and 8 are on while pumps 4, 5, and 6 are off. Now assume pump 7 shuts down. How can a mask show this situation? Solution on the next slide.

Use the mask to AND with the target pattern. The only 0 bit (bit 7) in the mask turns off the seventh bit in the target. Target AND Mask Result Solution

Figure 4-15 Example of setting specific bits

Example 13 Use a mask to set the 5 leftmost bits of a pattern. Test the mask with the pattern Solution The mask is Target OR Mask Result

Example 14 Using the power plant example, how can you use a mask to to show that pump 6 is now turned on? Solution Use the mask Target OR Mask Result

Figure 4-16 Example of flipping specific bits

Example 15 Use a mask to flip the 5 leftmost bits of a pattern. Test the mask with the pattern Solution Target XOR Mask Result

SHIFTOPERATIONSSHIFTOPERATIONS 4.3

Figure 4-17 Shift operations

Solution If a bit pattern represents an unsigned number, a right-shift operation divides the number by two. The pattern represents 59. When you shift the number to the right, you get , which is 29. If you shift the original number to the left, you get , which is 118. Example 16 Show how you can divide or multiply a number by 2 using shift operations.

Example 17 Use the mask to AND with the target to keep the fourth bit and clear the rest of the bits. Solution Use a combination of logical and shift operations to find the value (0 or 1) of the fourth bit (from the right). Continued on the next slide

Solution (continued) Target a b c d e f g h AND Mask Result e Shift the new pattern three times to the right 0000e000  00000e00  e0  e Now it is easy to test the value of the new pattern as an unsigned integer. If the value is 1, the original bit was 1; otherwise the original bit was 0.