Scribd
Upload
0 views

Lec4 Computer Architecture

The document discusses the representation of floating-point numbers, including the concepts of normalization and binary multiplication methods. It explains explicit and implicit normalization of binary numbers and provides examples of multiplication for both unsigned and signed numbers using Booth's method. The content concludes with a flowchart and block diagram illustrating the multiplication process.

Uploaded by

omaralsharqawi4016
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0 views

Lec4 Computer Architecture

The document discusses the representation of floating-point numbers, including the concepts of normalization and binary multiplication methods. It explains explicit and implicit normalization of binary numbers and provides examples of multiplication for both unsigned and signed numbers using Booth's method. The content concludes with a flowchart and block diagram illustrating the multiplication process.

Uploaded by

omaralsharqawi4016
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 39

E

E M

Mantissa (1:N)2𝐸−127

(1:N)2𝐸−1023
E
E M

Mantissa
Representation of Floating-Point Numbers
• (5.625)10=(101.101)2
• (5.625)10 (0.5625x101 ) Exponent
Mantissa
• (101.101)2 (0.101101x23 ) Exponent
• Mantissa

Sign Exponent Mantissa


Need of Normalization
• (101.101)2= 0.101101x23
• (101.101)2=1.01101x 22
• (101.101)2=0.0101101x24
• (101.101)2=101101x2−3
• Normalization(floating point numbers is normalized if Most Significant Bit of mantissa
is non-zero)
• Two types
1. Explicit Normalization: Move the radix point to the LHS of the most significant ‘1’ in the bit
sequence.
(101.101)2= 0.101101x23
2. Implicit Normalization:Move the radix point to the RHS of the most significant ‘1’ in the bit
sequence.
(101.101)2= 1.01101x22
The numerical value of the number is evaluated as
Explicit Normalization: Implicit Normalization:
(−1)𝑠 𝑥 0. 𝑀 𝑥 2𝐸−𝐵𝑎𝑖𝑠 (−1)𝑠 𝑥 1. 𝑀 𝑥 2𝐸−𝐵𝑎𝑖𝑠
Binary Multiplication
Binary Multiplication: Successively multiply the multiplicand by each digit of the
multiplier starting at the right shifting the result left by an extra left position each time each
time but the first. Then sum all partial results.

❑ Unsigned multiplication
❑ Signed multiplication

Block diagram
Method 1:

Try: Multiply 7 X 6

Example: Multiply 15 X 11

Flowchart of Unsigned Binary Multiplication


1011x1101
Multiplication for UNsigned numbers (Booth method) 2’s complement

Example : 3 X -7

Example : 6 X -2

Multiply 9 X -3
Multiplication for signed numbers (Booth method) 2’s complement
Q Q-1

AC+M’+1

M
AC+M M’

AC+M’+1
The END of the Lecture

for
Your Attention

You might also like