Scribd
Upload
32 views2 pages

B Nhân Floating Point 32 Bit: 1/ Data Path

This document summarizes a 32-bit floating point unit. It has two main sections: 1. The data path which describes the flow of a float multiply operation through sign, exponent, and significant bits over multiple cycles. 2. The controller which uses three enable signals (en_1, en_2, en_3) to control the flow through an initial state and multiply state over 4 cycles total.

Uploaded by

Quốc Bảo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
32 views2 pages

B Nhân Floating Point 32 Bit: 1/ Data Path

This document summarizes a 32-bit floating point unit. It has two main sections: 1. The data path which describes the flow of a float multiply operation through sign, exponent, and significant bits over multiple cycles. 2. The controller which uses three enable signals (en_1, en_2, en_3) to control the flow through an initial state and multiply state over 4 cycles total.

Uploaded by

Quốc Bảo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

BỘ NHÂN FLOATING POINT 32 BIT

1/ DATA PATH
1 bit 8 bit 23 bit 1 bit 8 bit 23 bit

Sign Exponent Significant Sign Exponent Significant

1 Significant 1 Significant

Xor -127
Cary Booth
F.A
24 bit x 24 bit

CSA 8 bit
23 bit (bit 46 – 24)

Sign Exponent Significant

1 bit 8 bit 23 bit

𝒂 = (−𝟏)𝑺𝒂 . 𝟏, 𝑭𝒂. 𝟐𝑬𝒂−𝟏𝟐𝟕


𝒃 = (−𝟏)𝑺𝒃 . 𝟏, 𝑭𝒃. 𝟐𝑬𝒃−𝟏𝟐𝟕
𝒄 = (−𝟏)𝑺𝒄 . 𝟏, 𝑭𝒄. 𝟐𝑬𝒄−𝟏𝟐𝟕
𝑺𝒄 = 𝑺𝒂^𝑺𝒃
𝒄 = 𝒂. 𝒃 => { 𝑬𝒄 = 𝑬𝒂 + 𝑬𝒃 − 𝟏𝟐𝟕
(𝟏 + 𝑭𝒂)(𝟏 + 𝑭𝒃) = 𝟏 + 𝑭𝒄
1 Cycle
Function
Mux
DFF
Input A
(2 Cycle)
Sign:
1 Cycle

Mux
1 Cycle CLK DFF
Exponent:
2 Cycle Output
Input B Significant:
Mux

DFF 2 Cycle
CLK

en_1 en_2 en_3

2/ CONTROLLER
en_1 = 1
en_1 = 0
en_3 = 0

Initial Multiply

en_3 = 1

Bảng điều khiển trạng thái


en_1 en_2 en_3
Initial 0 0 0
Multiply 1 1 1

Tổng công tốn 4 cycle  sử dụng biến count 1  4 khi en_1 =1 gắn count =1, count = 3
gán en_3 = 1

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy