1 / 41

IEEE 754 Floating Point Standard

IEEE 754 Floating Point Standard. Normalized REAL Binary Number: ± 1.yyyyyyyyy x 2 eeee IEEE 754 (-1) S x ( 1 + F) x 2 E-127. s exponent+127 significand - 1. 1 bit E (8 bits) F (23 bits). Only Zero is F = 0 and E = 0

kennan
Télécharger la présentation

IEEE 754 Floating Point Standard

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. IEEE 754 Floating Point Standard Normalized REAL Binary Number: ±1.yyyyyyyyy x 2eeee IEEE 754 (-1)S x ( 1 + F) x 2E-127 s exponent+127 significand - 1 1 bit E (8 bits) F (23 bits) • Only Zero is F = 0 and E = 0 • Simplifies data exchange • Compare using integer processes • Accuracy and round-off & Overflow and Underflow

  2. IEEE 754 Floating Point Standard Normalized REAL Binary Number: ±1.yyyyyyyyy x 2eeee Double Precision IEEE 754 (-1)S x ( 1 + F) x 2E-1023 s exponent+1023 significand - 1 1 bit E (11 bits) F (20 bits) significand – 1 (continued) F (32 bits)

  3. Sequential Network Structures - Review Input Y1 Y2 Ym X1 X2 Xn Q1 Q2 Qm Combinational Logic Register Q Z1 Z2 Zk Clock Output clki Y Q Stability Condition

  4. Flip - Flop with NOR Gates R Q = R+Q Q = S+Q S Present State RS Q 00 01 10 11 0 1 Next State Q

  5. Flip - Flop with NOR Gates R Q = R+Q Q = S+Q S Present State RS Q 00 01 10 11 0 0 1 1 Next State Q

  6. Flip - Flop with NOR Gates R Q = R+Q Q = S+Q S Present State RS Q 00 01 10 11 0 0 1 1 1 1 Next State Q

  7. Flip - Flop with NOR Gates R Q = R+Q Q = S+Q S Present State RS Q 00 01 10 11 0 0 1 0 1 1 1 0 Next State Q

  8. Flip - Flop with NOR Gates R Q = R+Q Q = S+Q S Present State RS Q 00 01 10 11 0 0 1 0 ? 1 1 1 0 ? Next State Q

  9. D-latch R C Q Q D S D C Q

  10. D-latch R C Q Q D S D C Q

  11. D flip-flop D Q D Q D Q Output changes only on the trailing clock edge D D _ l a t c h l a t c h C C Q C D C Q

  12. D flip-flop D Q D Q D Q Output changes only on the trailing clock edge D D _ l a t c h l a t c h C C Q C D C Q

  13. Sequential Network Structures - Review Input Y1 Y2 Ym X1 X2 Xn Q1 Q2 Qm Combinational Logic Register Q Z1 Z2 Zk Clock Output clki Y Q Stability Condition

  14. Five Components of Computers Memory Control Input Datapath Output Processor

  15. Start by Building the Datapath • Access the Instruction from Memory • Access the Data from Registers • Perform the Instruction • Write the Result

  16. PC Next PC Logic Address Instruction Memory Simplified Overview Instruction Access the Instruction from Memory

  17. PC Next PC Logic Address Instruction Memory Simplified Overview Instruction Register File Access the Data from Registers

  18. PC Next PC Logic Address Instruction Memory Simplified Overview Instruction Register File ALU Perform the Instruction

  19. PC Next PC Logic Address Instruction Memory Simplified Overview Instruction Addr Register File Data Memory ALU Data Out Data In Write the Result

  20. PC Next PC Logic Address Instruction Memory Simplified Overview Instruction Addr Register File Data Memory ALU Data Out Data In Timing Assumption

  21. Basic Instruction Fetch PC + 4 PC Adder 4 PC Address M[PC] Instruction Instruction Memory

  22. MIPS - Lite Consider the following instructions for implementation INSTRUCTION OP FUNCT R type add 0 32 subtract 0 34 AND 0 36 OR 0 37 set on less than 0 42 load word 35 na store word 43 na branch equal 4 na

  23. R type Arithmetic Logic Instructions add rd, rs, rt R op rs rt rd shamt funct 6 5 5 5 5 6 • All R type Instructions • Read two registers addressed by rs and rt • Write one register addressed by rd • R[rs] + R[rt] R[rd] for add

  24. Register File R e a d r e g i s t e r n u m b e r 1 R e g i s t e r 0 R e g i s t e r 1 M u R e a d d a t a 1 x R e g i s t e r n – 1 R e g i s t e r n R e a d r e g i s t e r n u m b e r 2 M u R e a d d a t a 2 x

  25. Register File W r i t e C 0 R e g i s t e r 0 1 D • Note: we still use the real clock to determine when to write n - t o - 1 C R e g i s t e r n u m b e r d e c o d e r R e g i s t e r 1 D n – 1 n C R e g i s t e r n – 1 D C R e g i s t e r n D R e g i s t e r d a t a

  26. n to 1 Decoder RA4 RA3 RA2 RA1 RA0 Multiplexor OOOO OOOOO ••• 31 0 1 R0i R1i Dri + • • R31i

  27. Register File R e a d r e g i s t e r R e a d n u m b e r 1 d a t a 1 R e a d r e g i s t e r n u m b e r 2 R e g i s t e r f i l e W r i t e r e g i s t e r R e a d d a t a 2 W r i t e d a t a W r i t e

  28. R type Arithmetic Logic Instructions add rd, rs, rt R op rs rt rd shamt funct 6 5 5 5 5 6 • All R type Instructions • Read two registers addressed by rs and rt • Write one register addressed by rd • R[rs] + R[rt] R[rd] for add

  29. A L U c o n t r o l 5 R e a d r e g i s t e r 1 R e a d d a t a 1 5 R e g i s t e r R e a d Z e r o r e g i s t e r 2 n u m b e r s R e g i s t e r s D a t a A L U A L U 5 W r i t e r e s u l t r e g i s t e r R e a d d a t a 2 W r i t e D a t a d a t a R e g W r i t e a . R e g i s t e r s b . A L U Dataflow for R – type Arithmetic – Logical Instructions add rd, rs, rt Instruction R[rs] + R[rt] R[rd] rs rt rd 3 ALU is Combinational Logic

  30. Load Word & Store Word ( I – type ) lw rt, imm16 (rs) or sw rt, imm16 ( rs) op rs rt imm16 lw # load word M[ R[rs] + sign_ext(imm16) ] R[rt] sw # store word R[rt] M[ R[rs] + sign_ext(imm16) ]

  31. load word M[ R[rs] + sign_ext(imm16) ] R[rt] Registers Data Memory rs rt R1 R2 Rw Dw Dr1 Dr2 ALU Addr Dr Dw imm16 sign ext 32 16

  32. store word R[rt] M[ R[rs] + sign_ext(imm16) ] Registers Data Memory rs rt R1 R2 Rw Dw Dr1 Dr2 ALU Addr Dr Dw imm16 sign ext 32 16

  33. beq rs, rt, imm16 I -type op rs rt imm16 • Zero =1 iff rs - rt = 0 • If Zero = 1 • SUM (ShLt2[Sign_Ext(imm16)] + PC+4) PC • If Zero = 0 • PC+4 PC Zero (PC+4) + Zero SUM[ (ShLt2[Sign_Ext(imm16)])+PC+4] PC

  34. Zero (PC+4) + Zero SUM[ (ShLt2[Sign_Ext(imm16)])+PC+4] PC Ex: imm16 is 1011 0000 0011 1001

  35. Zero (PC+4) + Zero SUM[ (ShLt2[Sign_Ext(imm16)])+PC+4] PC Ex: imm16 is 1011 0000 0011 1001 Sign_Ext(imm16) is 1111 1111 1111 1111 1011 0000 0011 1001

  36. Zero (PC+4) + Zero SUM[ (ShLt2[Sign_Ext(imm16)])+PC+4] PC Ex: imm16 is 1011 0000 0011 1001 Sign_Ext(imm16) is 1111 1111 1111 1111 1011 0000 0011 1001 ShLt2[Sign_Ext(imm16)] is 1111 1111 1111 11101100 00001110 0100

  37. Zero (PC+4) + Zero SUM[ (ShLt2[Sign_Ext(imm16)])+PC+4] Zero =1 iff rs - rt = 0 PC PC+4 Sum to PC ALU Shift Left 2 branch equal imm16 sign ext 32 16

  38. Zero (PC+4) + Zero SUM[ (ShLt2[Sign_Ext(imm16)])+PC+4] Zero =1 iff rs - rt = 0 PC PC+4 Sum to PC ALU branch equal Shift Left 2 ALU op Registers Zero rs rt R1 R2 Rw Dw Dr1 Dr2 ALU imm16 sign ext 32 16

  39. P C S r c M A d d u x A L U A d d 4 r e s u l t S h i f t l e f t 2 R e g i s t e r s A L U o p e r a t i o n 3 R e a d M e m W r i t e A L U S r c R e a d r e g i s t e r 1 P C R e a d a d d r e s s R e a d M e m t o R e g d a t a 1 Z e r o r e g i s t e r 2 I n s t r u c t i o n A L U A L U R e a d W r i t e R e a d A d d r e s s r e s u l t M d a t a r e g i s t e r d a t a 2 M u I n s t r u c t i o n u x W r i t e m e m o r y D a t a x d a t a m e m o r y W r i t e R e g W r i t e d a t a 3 2 1 6 S i g n M e m R e a d e x t e n d Dataflow Review Fig 5.13 page 354

More Related